# Split Array Into Consecutive Subsequences: Study Guide

Split Array Into Consecutive Subsequences shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Greedy with two maps: leftover counts and the number of chains ending at each value. Prefer extending an existing chain before opening a new one of length 3.

## 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

Always starting a new chain, which fails on arrays like [1,2,3,3,4,5].

## 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 job interview answers in real time.