# Latest Time By Replacing Hidden Digits: Explained

Latest Time By Replacing Hidden Digits shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

A time 'hh:mm' may contain '?'. Greedily fill from the left with the largest valid digit: hours tens is 2 if the ones digit allows it else 1; hours ones is 3 if tens is 2 else 9; minutes tens is 5; minutes ones is 9.

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

## Common mistake

Always writing 2 for the first hour digit even when the second digit is 4-9, which makes an invalid hour.

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