Cody

# Problem 23. Finding Perfect Squares

Solution 1581975

Submitted on 12 Jul 2018 by Marshall
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))

ans = 3×3 logical array 0 0 1 0 0 0 0 0 0 ans = logical 1

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

ans = 11×11 logical array 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ans = logical 0

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

ans = logical 1 ans = logical 1

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

ans = 6×6 logical array 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ans = logical 1

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

ans = 5×5 logical array 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ans = logical 0