Search

CodeChefOpen on judge ↗

You are given a list of unique integers $fest$ sorted in ascending order. Find the minimum $i$ such that fest[i]==i. If there is no such element print “-1”. Get the buggy code from [here!](https://pastebin.com/MNaviFJ2) ### Input - Input contains of a single line, a list of integers $fest$. ### Output Output is a single line integer. ### Constraints - $1 \leq T \leq 1000$ - $2 \leq M \leq 10^9

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