We love palindromes!!

CodeChefOpen on judge ↗

Given a sequence of $N$ integers check if it is a palindrome or not. ###Input: - First line will contain $T$, number of testcases. Then the testcases follow. - Each testcase contains of two lines of input. The first line contains a single integer $N$. The next line contains $N$ space separated integers. ###Output: For each testcase, output in a single line if the sequence is palindrome or not

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