# Leetcode 3443. Maximum Manhattan Distance After K Changes

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.

## Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

LevelAll Levels

RegionAll Regions

Company

Filters0

## Leetcode 3443. Maximum Manhattan Distance After K Changes | Hello Interview