# help me plz

Challenge Task 1 of 1

Return a multiplication table consisting of an array of arrays. The table should contain all of the products of integers from 0 to maxFactor. For example, if maxFactor is 3 the resulting multiplication table should contain the following: 0 0 0 0 0 1 2 3 0 2 4 6 0 3 6 9

Bummer! Your code could not be compiled. Please click on "Preview" to view the compiler errors. Restart Preview Get Help Recheck work Math.cs

array 1 namespace Treehouse.CodeChallenges 2 { 3 public static class MathHelpers 4 { 5 public static int[,] BuildMultiplicationTable(int maxFactor) 6 { 7 for (int i = 0; i < array.Length; i++) 8 { 9 System.Console.Write("maxFactor({0}): ", i); 10 } 11 ​ 12 ​ 13 } 14 } 15 } 16 ​

Math.cs
```namespace Treehouse.CodeChallenges
{
public static class MathHelpers
{
public static int[,] BuildMultiplicationTable(int maxFactor)
{
for (int i = 0; i <  array.Length; i++)
{
System.Console.Write("maxFactor({0}): ", i);
}

}
}
}
``` ## It looks like you asked this twice.

Here are the hints I gave on the original question:

• you don't need to write to the console, just build and return the table.
• you might need a second loop nested inside the first to handle both dimensions.
• it's a multiplication table — don't forget to multiply. @Steven Parker OK, Can you watch this video first"https://teamtreehouse.com/library/jagged-arrays"? After watching it, can you tell me that we can do complete this code challenge? The whole video are done in the console. i still don't know how to do this in the work space. shawn khah Here is complete example of this question

namespace Treehouse.CodeChallenges { public static class MathHelpers { public static int[][] BuildMultiplicationTable(int maxFactor) { maxFactor++; int[][] result= new int[maxFactor][]; for(int i = 0; i<maxFactor; i++) { result[i] = new int[maxFactor]; for(int j=0; j<maxFactor; j++) { result[i][j] = i*j; } } return result; } } }