Smallest Palindromic Rearrangement I (LeetCode 3517)
MediumLeetCode 3517 · Sorting-based Greedy · Google, Amazon +3 · 10:38Smallest Palindromic Rearrangement I · Simple Explanation · Dry Run · Leetcode 3517My 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 3517 Smallest Palindromic Rearrangement I by codestorywithMIK: Greedy, Medium. Topics: String, Sorting, Counting Sort. Watch the explanation, then check the code and solve it on LeetCode.
- Difficulty
- medium
- Topics
- String, Sorting, Counting Sort
- Patterns
- Sorting-based Greedy, Greedy on Strings & Counting
- Chapter
- Greedy
- Duration
- 10:38
Related problems
- Bag of Tokens (LeetCode 948)
- Boats to Save People (LeetCode 881)
- Break a Palindrome (LeetCode 1328)
- Minimum Time to Make Rope Colorful (LeetCode 1578)
- Earliest Possible Day of Full Bloom(Google, Amazon, Microsoft, Adobe):Explanation ➕ Live Coding (LeetCode 2136)
- Longest Palindrome by Concatenating Two Letter Words: Greedy Explanation ➕ Live Coding 🧑🏻💻 (LeetCode 2131)
- Maximum 69 Number (LeetCode 1323)
- Maximum Bags With Full Capacity of Rocks (LeetCode 2279)