Beautiful Substring

CodeChefOpen on judge ↗

###PROBLEM STATEMENT - You are given a string $S$ of size $N$ and you have to find two beautiful substrings. A string is beautiful when it is the first sorted substring of length $K$ and it is the last reverse sorted substring of length $K$. Note - (All alphabets are in upper case). $For Example$ - You have a string "$AABBCCDDEEDDA$" and its two beautiful substrings of size $K = 5$ are "

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