Hash Table
3443. Maximum Manhattan Distance After K Changes
Given a move string s of characters N/S/E/W. You may change up to k characters to anything. Find the maximum Manhattan distance from the origin achievable at any point during the walk.
Loading…