# Number Of Longest Increasing Subsequence: Practice Notes

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

## Key idea

DP length[i] and count[i]: for each j < i with nums[j] < nums[i], if length[j]+1 > length[i] reset count[i], if equal add count[j]. Sum count[i] over all i that share the global max length.

## 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^2).

## Common mistake

Only computing the LIS length and forgetting to track how many sequences achieve it.

## 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 AI help for online coding assessments.