Missing Number

CSESIntroductory ProblemsOpen on judge ↗

You are given all numbers between 1,2,\ldots,n except one. Your task is to find the missing number. Input The first input line contains an integer n. The second line contains n-1 numbers. Each number is distinct and between 1 and n (inclusive). Output Print the missing number. Constraints - 2 \le n \le 2 \cdot 10^5 Example Input: 5 2 3 1 5 Output: 4

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