← All problemsSign in

Can place participants

In **SCET** college, there is a coding competition taking place. There are a total of $N$ computers arranged in a row represented using an **Array**. Some of the candidates have already arrived and have taken some random computers following the sitting rule of the SCET college. The array either contains $1$ which represents occupied or $0$ which represents unoccupied. **Sitting Rule**: Participan

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

Sign in to chat with the tutor and save your progress.

Sign in to start