Minimum Number of Swaps to Make the String Balanced (LeetCode 1963)
MediumLeetCode 1963 · Parentheses & Matching · Google, Amazon +11 · 18:09Minimum Number of Swaps to Make the String Balanced · Reason · Leetcode 1963My 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 1963 Minimum Number of Swaps to Make the String Balanced by codestorywithMIK: Stack, Medium. Topics: Two Pointers, String, Stack, Greedy. Watch the explanation, then check the code and solve it on LeetCode.
- Difficulty
- medium
- Topics
- Two Pointers, String, Stack, Greedy, Bracket Sequences
- Patterns
- Parentheses & Matching
- Chapter
- Stack
- Duration
- 18:09
Related problems
- Valid Parentheses (LeetCode 20)
- Minimum Remove to Make Valid Parentheses (LeetCode 1249)
- Reverse Substrings Between Each Pair of Parentheses (LeetCode 1190)
- Minimum Deletions to Make String Balanced (LeetCode 1653)
- Minimum Add to Make Parentheses Valid (LeetCode 921)
- Check if a Parentheses String Can Be Valid (LeetCode 2116)
- Score of Parentheses (LeetCode 856)
- Maximum Nesting Depth of the Parentheses (LeetCode 1614)