Lendro Check

CodeChefOpen on judge ↗

Problem description. In JNUTUV there is a boy called Lindro. Lindro always likes palindromes. He has N number of strings, some of them are palindromes and some of them are not palindromes. As per Lindro palindrome means any string which appears same (Case In Sensitive) from both directions is a palindrome. As he always likes palindromes he ignores case sensitivity for palindrome check. Any strin

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