Hiring process8 levels
  1. 1 IQ Test
  2. 2 Additional Online Test (If Required)
  3. 3 Office Interview with Hiring Manager
  4. 4 Unpaid Test Task (Motivation Check)
  5. 5 Paid Test Task and Follow-Up Interview
  6. 6 Iterative Paid Test Tasks
  7. 7 Office Verification
  8. 8 Final Interview with the Founder

Problems > Smallest Impossible Sum > Editorial

Smallest Impossible Sum — Solution & Editorial

Back to the Problem

Sort. If every value up to R is reachable and the next coin c ≤ R+1, reachability extends to R+c; the first coin with c > R+1 freezes the answer at R+1.

Complexity: O(N log N)

Watch out: The running reach exceeds 32 bits with 105 coins of 109.