Sequence Odd

CodeChefOpen on judge ↗

Print the following pattern. ###Input: - First line will contain $N$, number of rows. ###Output: - For each testcase,print the pattern. ###Constraints - $1 \leq T \leq 100$ ###Sample Input: 5 ###Sample Output: 1 2 3 4 5 4 3 2 1 1 2 3 2 1 1 ###Sample Input: 4 ###Sample Output: 1 2 3 4 3 2 1 1 2 1 ###EXPLANATION: If input is 4 $[1,2,3,4] -> [3,2,1] -

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