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))
|
Find the longest sequence of 1's in a binary sequence.
3370 Solvers
3894 Solvers
624 Solvers
309 Solvers
Number of Even Elements in Fibonacci Sequence
665 Solvers
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!