Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
n = 0;
correct = [1];
assert(isequal(pascalTri(n),correct))
|
2 | Pass |
n = 1;
correct = [1 1];
assert(isequal(pascalTri(n),correct))
|
3 | Pass |
n = 2;
correct = [1 2 1];
assert(isequal(pascalTri(n),correct))
|
4 | Pass |
n = 3;
correct = [1 3 3 1];
assert(isequal(pascalTri(n),correct))
|
5 | Pass |
n = 10;
correct = [1 10 45 120 210 252 210 120 45 10 1];
assert(isequal(pascalTri(n),correct))
|
1400 Solvers
239 Solvers
Find perfect placement of non-rotating dominoes (easier)
228 Solvers
Arrange vector in ascending order
541 Solvers
Given a window, how many subsets of a vector sum positive
673 Solvers