Minimum steps needed to cover a sequence of points on an infinite grid
Filed under Hewlett Packard Enterprise
The question
Given an ordered sequence of 2D coordinates on an infinite grid, find the minimum number of steps required to visit all points in order, moving in any of the 8 adjacent directions at each step.
No write-up yet. Related questions below have one.
Related Hewlett Packard Enterprise questions
Collected from public candidate posts and coding forums. Updated Nov 2026.