Palindromic Queries

CodeChefOpen on judge ↗

Mark has recently started studying string algorithms. So, as to gauge his knowledge, Lucy challenges him to a task. "Given a string s, answer several times a query to determine whether a substring s[i, j] (inclusive) is palindromic or not.", said Lucy in a confident tone! As smart as Mark is, he was able to instantly find the solution! Now, Mark has challenged little Lucy to do the same task by

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