# Find The Longest Valid Obstacle Course At Each Position: Walkthrough

Find The Longest Valid Obstacle Course At Each Position shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

For each index i, the longest non-decreasing subsequence of obstacles that ends at i. This is LIS (non-decreasing) with the length at the insertion point: maintain a tails array (lowest ending value for each length) and binary-search the rightmost slot <= obstacles[i].

## Steps to say out loud

1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (binary search on the answer, monotonic stack or deque, interval / interval-DP, string hashing, graph traversal, or shortest paths) and why a nested scan or naive search fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.

## Complexity

O(n log n).

## Common mistake

Requiring a strictly increasing course, or restarting LIS from scratch at every i.

## Practice tip

Time yourself: two minutes to explain, ten to code, three to test edges. Disclosure: I work on Linkjob AI. I also keep a practice cheat sheet at learn more.