# Reach A Number: Study Guide

Reach A Number shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Find the smallest k with triangular(k) >= target and triangular(k) - target even, because flipping a step of size d subtracts 2d.

## 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(sqrt(target)).

## Common mistake

BFS on the number line, which is too wide.

## 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 coding interview assistant.