Akhil And Random String

CodeChefRating 2025Open on judge ↗

Akhil comes across a string S of length N. He started wondering about the smallest lexicographical subsequence of string S of length K. A subsequence of a string is formed by deleting some characters (possibly none) from it's original string. A string A is said to be lexicographically smaller than the string B of the same length if at the first position where A and B differ, A contains a letter

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