An algorithm starts with a single square and on each of its next iterations adds new squares all around the outside as shown below.
S
S S S S
S S S S S S S S S
S S S S
S
n = 1 n = 2 n = 3 How many unit squares will there be after the nth iteration?
Solution Stats
Problem Comments
Solution Comments
Show comments
Loading...
Problem Recent Solvers37
Suggested Problems
-
Return unique values without sorting
999 Solvers
-
Set the array elements whose value is 13 to 0
1438 Solvers
-
Test if two numbers have the same digits
264 Solvers
-
369 Solvers
-
Back to Basics - Find no. of elements in a matrix?
328 Solvers
More from this Author18
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!