← All problemsSign in

Children Playing Together

Once upon a time, there was a group of children who were playing a game. Each child was given a number from 1 to N, but one of the numbers was missing. The children were taking turns to shout out the numbers they had, and the first child to shout out the missing number would win the game. You are given an array A containing N-1 distinct integers, representing the numbers that the children have. Y

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