Problem 2

CodeChefOpen on judge ↗

An ideal string of length N is a string where the 1-based index of the first occurrence of each letter, is equal to the number of occurrences of that letter in the string. For example, the string "BAOOOA"(inverted commas for clarity purpose only) is an ideal string. The letter 'B' appears 1 time, and its index is 1. The letter 'A' occurs 2 times and its first index is 2. The letter 'O' occurs

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