This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.
Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
n = 5;
S = 40;
assert(isequal(FibSumSquares(n),S))
x =
1 1
S =
40
|
2 | Pass |
n = 8;
S = 714;
assert(isequal(FibSumSquares(n),S))
x =
1 1
S =
714
|
3 | Pass |
n = 11;
S = 12816;
assert(isequal(FibSumSquares(n),S))
x =
1 1
S =
12816
|
4 | Pass |
n = 15;
S = 602070;
assert(isequal(FibSumSquares(n),S))
x =
1 1
S =
602070
|
5 | Pass |
n = 21;
S = 193864606;
assert(isequal(FibSumSquares(n),S))
x =
1 1
S =
193864606
|
6 | Pass |
n = 26;
S = 23843770274;
assert(isequal(FibSumSquares(n),S))
x =
1 1
S =
2.3844e+10
|
Return the 3n+1 sequence for n
5203 Solvers
Get the area codes from a list of phone numbers
417 Solvers
1123 Solvers
Make one big string out of two smaller strings
1070 Solvers
Rounding off numbers to n decimals
282 Solvers