Smallest Missing Positive

CodeChefOpen on judge ↗

Shreya loves to collect small rocks. She has $N$ number of Stones. Each having a height $A[i]$. Find in $O(N)$ time and $O(N)$ space, the least **positive** height rock Shreya should get for her collection. ### Input - First line will contain $T$, number of testcases. Then the testcases follow. - First line of each testcase has $N$. - Followed by $N$ space separated integers. ### Output For ea

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