Cody

Problem 23. Finding Perfect Squares

Solution 1439792

Submitted on 12 Feb 2018 by Edward Alborghetti
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))

asquare = 4 9 16 g = 4 9 16 c = 4 d = logical 1 b = logical 1

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

asquare = 400 441 484 529 576 625 676 729 784 841 900 g = 400 441 484 529 576 625 676 729 784 841 900 c = 1×0 empty double row vector d = 1×0 empty logical array b = logical 0

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

asquare = 1 g = 1 c = 1 d = logical 1 b = logical 1

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

asquare = 36 100 144 196 1296 10201 g = 36 100 144 196 1296 10201 c = 36 d = logical 1 b = logical 1

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

asquare = 36 100 144 196 10201 g = 36 100 144 196 10201 c = 1×0 empty double row vector d = 1×0 empty logical array b = logical 0