# Longest Square Streak In An Array: Practice Notes
Longest Square Streak In An Array shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
A square streak is a subsequence you can order so each next value is the square of the previous (length >= 2). Put numbers in a set; from each unvisited start, walk x, x^2, x^4, ... while present, and take the max chain (or DP on sorted unique values).
## 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 n).
## Common mistake
Requiring consecutive squares that differ by 1, or overflowing 32-bit when squaring.
## 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 real-time interview help.