# Minimum Skips To Arrive At Meeting On Time: Interview Notes

Minimum Skips To Arrive At Meeting On Time shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

n roads with dist[i], speed; after each road (except the last) time is ceiled to an integer unless you skip. Find the fewest skips so total time <= hours. DP dp[i][skips] = min time (in exact fractions or integers scaled by speed) to finish the first i roads. Or binary-search skips and simulate.

## 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^2).

## Common mistake

Ceiling the last road (the problem forbids it) or comparing floating time without care for precision — scale by speed.

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