Cakewalk Query

CodeChefOpen on judge ↗

You are given a string $S$ of length $N$ contains only lowercase alphabets and $Q$ queries. In each query you are given an index $i$ and now consider the substring $S_{i}S_{i+1}....S_{N}$. For each query find the lexicographically smallest palindromic subsequence of length exactly 2 . If no such exists then output will be $-1$. A subsequence of s is a non-empty string y = s[p1p2... p|y|] = sp1sp2

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