Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
x = 1;
y_correct = sqrt(5)/2;
tolerance = 1e-12;
assert(abs(rhombus_side(x)-y_correct)<tolerance)
|
2 | Pass |
x = 3;
y_correct = 5/2;
tolerance = 1e-12;
assert(abs(rhombus_side(x)-y_correct)<tolerance)
|
3 | Pass |
x = 2;
y_correct = sqrt(13)/2;
tolerance = 1e-12;
assert(abs(rhombus_side(x)-y_correct)<tolerance)
|
Find the longest sequence of 1's in a binary sequence.
2439 Solvers
Calculate the Levenshtein distance between two strings
303 Solvers
Create a square matrix of multiples
330 Solvers
357 Solvers
345 Solvers