# Reaching Points: Study Guide

Reaching Points shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Can you turn (sx,sy) into (tx,ty) by (x,y) -> (x+y,y) or (x,x+y)? Work backwards: while tx > sx and ty > sy, replace the larger with larger % smaller (because repeated subtracts are a modulo). Then check the remaining linear combination.

## 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(log max(tx,ty)).

## Common mistake

BFS forward from (sx,sy), which explodes, or subtracting only once per step.

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