Maximum Manhattan Distance After K Changes (LeetCode 3443)
MediumLeetCode 3443 · Greedy on Strings & Counting · Meta, Microsoft +2 · 38:28Maximum Manhattan Distance After K Changes · Detailed Explanation · Leetcode 3443My notes
Sign in to keep private notes on every station, with video timestamps.
Pause here and write your approach in two lines. Compare it with MIK's when the video ends.
Sign in to write your approach →About this video
Video solution for LeetCode 3443 Maximum Manhattan Distance After K Changes by codestorywithMIK: Greedy, Medium. Topics: Hash Table, Math, String, Counting. Watch the explanation, then check the code and solve it on LeetCode.
- Difficulty
- medium
- Topics
- Hash Table, Math, String, Counting
- Patterns
- Greedy on Strings & Counting
- Chapter
- Greedy
- Duration
- 38:28
Related problems
- Break a Palindrome (LeetCode 1328)
- Minimum Time to Make Rope Colorful (LeetCode 1578)
- Longest Palindrome by Concatenating Two Letter Words: Greedy Explanation ➕ Live Coding 🧑🏻💻 (LeetCode 2131)
- Maximum 69 Number (LeetCode 1323)
- Minimum Rounds to Complete All Tasks : Explanation ➕ Live Coding 🧑🏻💻👩🏻💻 (LeetCode 2244)
- Optimal Partition of String - (AMAZON) (LeetCode 2405)
- Dota2 Senate (LeetCode 649)
- Minimum Deletions to Make Character Frequencies Unique (LeetCode 1647)