how to solve the challenge in that video which says given an interger n, print a nXn matrix with squares (outermost to innermost) having values n, then n-1 and n-2 and so on
Challenge from python for begineers for tutorial #2
The steps to solve the following question are-
- Assume the 4 boundaries of array as walls.
- You need to find the n-min(distance of wall to the point).
The code for the same is - https://ide.codingblocks.com/s/99610
If you still have any doubts then you can post that in this thread or in case if your doubt is resolved then kindly mark the doubt as resolved.
I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.
On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.