Cody

# Problem 23. Finding Perfect Squares

Solution 2028200

Submitted on 19 Nov 2019 by Ian O Neill
This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.

### Test Suite

Test Status Code Input and Output
1   Pass
a = [2 3 4]; assert(isequal(isItSquared(a),true))

b = 0 k = 3 b = logical 1

2   Pass
a = [20:30]; assert(isequal(isItSquared(a),false))

b = 0 k = 1×0 empty double row vector k = 1×0 empty double row vector k = 1×0 empty double row vector k = 1×0 empty double row vector k = 1×0 empty double row vector k = 1×0 empty double row vector k = 1×0 empty double row vector k = 1×0 empty double row vector k = 1×0 empty double row vector k = 1×0 empty double row vector k = 1×0 empty double row vector

3   Pass
a = [1]; assert(isequal(isItSquared(a),true))

b = 0 k = 1 b = logical 1

4   Pass
a = [6 10 12 14 36 101]; assert(isequal(isItSquared(a),true))

b = 0 k = 5 b = logical 1

5   Pass
a = [6 10 12 14 101]; assert(isequal(isItSquared(a),false))

b = 0 k = 1×0 empty double row vector k = 1×0 empty double row vector k = 1×0 empty double row vector k = 1×0 empty double row vector k = 1×0 empty double row vector