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 > Leftmost Big Enough > Editorial

Leftmost Big Enough — Solution & Editorial

Back to the Problem

A max segment tree answers this WITHOUT binary search: descend from the root, always preferring the left child when its max is ≥ x — O(log N) per query. (Binary search over prefix maxima costs an extra log.)

Complexity: O((N + Q) log N)

Watch out: The tree descent — not a scan — is the intended trick; a per-query scan is O(NQ).