Available question text
Given an N×M city grid where delivery centers are marked as 1 and houses as 0, find the minimum possible maximum Chebyshev distance (8-directional movement) from any house to its nearest delivery center by strategically placing at most one additional delivery center.
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
Amazon
Minimize Maximum Chebyshev Distance by Adding One Delivery Center
Reported Nov 1, 2026 · 5 source reports
INTERN, MID_LEVEL
Source snapshot: Nov 12, 2026
View source