Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
deck = [1 4 7 10 13 16 19 22 25 28 3 6 9 12 15 18 21 24 27 2 5 8 11 14 17 20 23 26];
n = 10;
out = [8 26 1 4 7 23 8 8 4 24];
assert(isequal(solitaire(deck, n),out))
|
2 | Pass |
%%
deck = 1:28;
n = 10;
out = [3 22 9 4 23 7 25 16 14 14];
assert(isequal(solitaire(deck, n),out))
|
3 | Pass |
%%
deck = 1:28;
n = 9;
out = [3 22 9 4 23 7 25 16 14];
assert(isequal(solitaire(deck, n),out))
|
Construct a string from letters and counts
113 Solvers
Number of 1s in a binary string
1229 Solvers
Number of digits in an integer
271 Solvers
07 - Common functions and indexing 4
259 Solvers
196 Solvers