Cody

Problem 23. Finding Perfect Squares

Solution 2255984

Submitted on 5 May 2020 by Andrzej Mamczura
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))

square = 4 9 16 A = 1×3 logical array 0 0 1 b = logical 1

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

square = 400 441 484 529 576 625 676 729 784 841 900 A = 1×11 logical array 0 0 0 0 0 0 0 0 0 0 0 b = logical 0

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

square = 1 A = logical 1 b = logical 1

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

square = 36 100 144 196 1296 10201 A = 1×6 logical array 0 0 0 0 1 0 b = logical 1

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

square = 36 100 144 196 10201 A = 1×5 logical array 0 0 0 0 0 b = logical 0

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!