Zarcade

CodeChefOpen on judge ↗

You are given an integer $N$. In a grid of size $N$ x $N$, numbers are filled starting from $1$, diagonally from the top-left corner to the bottom-right corner. After reaching the end of the grid, you move upwards and repeat the same, in the other direction. This goes on till no more numbers can be filled in the grid. Example: For $N = 7$, the grid will be filled like this - ![](https://raw.gith

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI