# Check If There Is A Valid Partition For The Array: Interview Notes

Check If There Is A Valid Partition For The Array shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

A valid partition uses only parts of the form [x,x], [x,x,x], or [x,x+1,x+2]. DP: dp[i] means prefix i can be partitioned; try the three endings that finish at i. Answer dp[n].

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

Requiring the whole array to match one pattern, or forgetting the two-equal-elements part.

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