Available question text
Given a sequence of unit grid moves where you can change up to k moves to any direction, compute the maximum Manhattan distance from the origin reached at any prefix of the walk. The core challenge is choosing which moves to flip (affecting x and y contributions separately) for each prefix to maximize |x|+|y| efficiently for n up to 1e5.
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
No company association
Leetcode 3443. Maximum Manhattan Distance After K Changes
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source