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 |
a = 3;
b = 4;
c = 5;
flag_correct = true;
assert(isequal(isRightAngled(a,b,c),flag_correct))
|
2 | Pass |
a = 3;
b = 4;
c = 6;
flag_correct = false;
assert(isequal(isRightAngled(a,b,c),flag_correct))
|
3 | Pass |
a = 3;
b = 5;
c = 4;
flag_correct = true;
assert(isequal(isRightAngled(a,b,c),flag_correct))
|
4 | Pass |
a = 4;
b = 3;
c = 5;
flag_correct = true;
assert(isequal(isRightAngled(a,b,c),flag_correct))
|
5 | Pass |
a = 4;
b = 5;
c = 3;
flag_correct = true;
assert(isequal(isRightAngled(a,b,c),flag_correct))
|
6 | Pass |
a = 5;
b = 3;
c = 4;
flag_correct = true;
assert(isequal(isRightAngled(a,b,c),flag_correct))
|
7 | Pass |
a = 5;
b = 4;
c = 3;
flag_correct = true;
assert(isequal(isRightAngled(a,b,c),flag_correct))
|
8 | Pass |
a = 5;
b = 12;
c = 13;
flag_correct = true;
assert(isequal(isRightAngled(a,b,c),flag_correct))
|
8420 Solvers
851 Solvers
Calculate the Levenshtein distance between two strings
304 Solvers
244 Solvers
739 Solvers