Palindromes Of Lol Land

CodeChefOpen on judge ↗

You are provided with a string of length n which contains only lower case alphabets from a to z. While solving this problem, you need to follow 1 based indexing (starting index = 1, last index = n (which is the length of the string)) You are also provided with two types of queries: - TYPE 1 - 1 $p$ $m$ Replace the letter at index $p$ to $m$ - TYPE 2 - 2 $x$ $y$ Find whether the substring from i

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