LeetCode Daily Challenge-3443. Maximum Manhattan Distance After K Changes

Problem Description Thinking process Let's read the problem description first. It mentioned that we have a list of directions in sequence, given at most k times to change direction at any step. How far can you go from the base point in Manhattan dist...