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 > Trim to Non-Decreasing > Editorial

Trim to Non-Decreasing — Solution & Editorial

Back to the Problem

The kept elements form the longest NON-DECREASING subsequence — patience sorting with an upper-bound insertion (allows equals). Deletions = N − its length.

Complexity: O(N log N)

Watch out: Non-decreasing needs bisect_right (upper bound), not bisect_left, so equal values extend the run.