ACMIIITB2018P8

CodeChefOpen on judge ↗

Alia wants to play with you. She will give you a string (MSG) where ((N = length of MSG) <= 10000)and multiple queries(M). Each query consists of an integer value K. For each query, you have to find the Kth substring if all the substrings of the given string are arranged in lexicographically increasing order without any duplicates( no substring will appear twice in the given arrangement). You hav

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