Mr X

CodeChefOpen on judge ↗

Given an integer $N$ (it will be odd) find the required pattern as explained in the examples ## Input First-line contains $T$ denoting the number of the test cases. Each test case contains an integer $N$. ## Output For each test case print the diamond shape corresponding to $N$ ## Constraints $1 \leq T \leq 1000$ $3 \leq N \leq 100$ (It will be odd number) ## Example ### Input

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