Minimum Time Visiting All Points
A easy-tier problem at 83% community acceptance, tagged with Array, Math, Geometry. Reported in interviews at Media.net and 0 others.
Minimum Time Visiting All Points is a deceptive easy problem that trips up candidates who overthink the geometry. You're given a list of points and need to find the minimum time to visit them all, starting anywhere. The acceptance rate sits at 82%, which sounds comfortable until you're live and second-guessing whether you need Dijkstra or dynamic programming. Media.net has asked this one. The trick is simpler than it looks, but miss it and you'll waste 15 minutes chasing the wrong solution. StealthCoder solves it in seconds if you blank on the pattern during your live assessment.
Companies that ask "Minimum Time Visiting All Points"
Minimum Time Visiting All Points is the kind of problem that decides whether you pass. StealthCoder reads the problem on screen and surfaces a working solution in under 2 seconds. Invisible to screen share. The proctor sees nothing. Built because the OA filter rejects engineers who'd pass the on-site. That's a broken filter. This is the workaround.
Get StealthCoderThe core insight is Chebyshev distance, not Euclidean. The time to move from one point to another is the maximum of the absolute differences in x and y coordinates, not the straight-line distance. That's it. Candidates often default to calculating sqrt(dx^2 + dy^2) or trying to find an optimal order, both dead ends. Once you know the time between any two points is max(|x1-x2|, |y1-y2|), the problem becomes a simple sum: iterate through consecutive points and add up the Chebyshev distances. No sorting, no graph search, no greedy ordering required. The array and math topics anchor this: pure computation, no complex data structures. If you hit this on your OA and the Euclidean formula is your instinct, StealthCoder surfaces the Chebyshev approach and a working solution before panic sets in.
Pattern tags
You know the problem.
Make sure you actually pass it.
Minimum Time Visiting All Points recycles across companies for a reason. It's easy-tier, and most candidates blank under the timer. StealthCoder is the hedge: an AI overlay invisible during screen share. It reads the problem and surfaces a working solution in under 2 seconds. Built because the OA filter rejects engineers who'd pass the on-site. That's a broken filter. This is the workaround. Works on HackerRank, CodeSignal, CoderPad, and Karat.
Minimum Time Visiting All Points interview FAQ
Is this problem actually easy, or is the 82% acceptance rate misleading?+
The high acceptance rate is real, but it counts people who know the Chebyshev distance pattern. If you don't know it, you'll waste time on wrong approaches. It's easy once you see it, brutal if you don't. The trick is recognizing that grid movement (king's move in chess) takes max(dx, dy) time, not Euclidean distance.
How does this relate to the geometry and math topics?+
Geometry here means understanding coordinate systems and movement. The math is the Chebyshev distance formula: the maximum of absolute differences. No calculus, no heavy lifting. It's a 2D grid metric problem disguised as a routing problem.
Why would Media.net ask this specific problem?+
Media.net likely uses it to filter for candidates who either know distance metrics cold or can reason through them under pressure. It's a quick way to separate people who overthink from those who recognize the pattern. Also tests whether you can code a simple loop without over-engineering.
What's the most common mistake candidates make?+
Calculating Euclidean distance (sqrt of sum of squares) instead of Chebyshev distance. Others try to sort points or find an optimal visiting order, which is unnecessary. Some also try to handle the starting point as a special case when it doesn't matter which point you start from.
How long should this take to code in an interview?+
Three to five minutes once you understand the pattern. A single loop through the points array, calculating max(|x_diff|, |y_diff|) for each pair, and summing. The hard part is the first minute: knowing to use Chebyshev, not Euclidean. If you don't know it, you're sunk without external help.
Want the actual problem statement? View "Minimum Time Visiting All Points" on LeetCode →