# Longest Continuous Increasing Subsequence: Walkthrough
Longest Continuous Increasing Subsequence shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
A contiguous strictly increasing run. Scan and reset the streak whenever nums[i] <= nums[i-1]; track the max streak.
## 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).
## Common mistake
Allowing a non-contiguous increasing subsequence (that is LIS) or using >= instead of >.
## 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 the Linkjob AI app.