Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
games = {'D','D','A','H','D','H'};
draws = 3;
assert(isequal(how_many_draws(games),draws))
|
2 | Pass |
games = {'D','D'};
draws = 2;
assert(isequal(how_many_draws(games),draws))
|
3 | Pass |
games = {'H','H','A'};
draws = 0;
assert(isequal(how_many_draws(games),draws))
|
4 | Pass |
games = {'D','H','H','A','D','H','H','A','D','H','H','A','D','D'};
draws = 5;
assert(isequal(how_many_draws(games),draws))
|
Find relatively common elements in matrix rows
645 Solvers
Calculate the Levenshtein distance between two strings
304 Solvers
Create an n-by-n null matrix and fill with ones certain positions
140 Solvers
1323 Solvers
197 Solvers