# Longest Increasing Subsequence II: Interview Notes

Longest Increasing Subsequence II shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

LIS where adjacent chosen values may differ by at most k. Segment tree / fenwick on compressed values: dp[v] = 1 + max(dp[v-k..v-1]), then set dp[v]. Query the range max in log time.

## 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 V).

## Common mistake

Standard O(n^2) LIS without the difference constraint, or querying the whole prefix instead of [v-k, v-1].

## 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 Linkjob AI interview assistant.