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 > The Mountain Subsequence > Editorial

The Mountain Subsequence — Solution & Editorial

Back to the Problem

Compute the longest increasing subsequence ending at each i and the longest decreasing subsequence starting at each i; the peak is inc[i] + dec[i] − 1. (Each side is O(N log N) with patience sorting.)

Complexity: O(N2) here