Longest Balanced Substring I (LeetCode 3713)
MediumLeetCode 3713 · Opposite Ends · Google, Amazon +2 · 13:38Longest Balanced Substring I · Easy Explanation · Leetcode 3713My 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 3713 Longest Balanced Substring I by codestorywithMIK: Two Pointers, Medium. Topics: Hash Table, String, Counting, Enumeration. Watch the explanation, then check the code and solve it on LeetCode.
- Difficulty
- medium
- Topics
- Hash Table, String, Counting, Enumeration
- Patterns
- Opposite Ends
- Chapter
- Two Pointers
- Duration
- 13:38
Related problems
- Reverse Vowels of a String (Google, Zoho, Flipkart) : Explanation ➕ Live Coding 🧑🏻💻👩🏻💻 (LeetCode 345)
- Reverse Words in a String (Amazon, Microsoft, MentorGraphics, MakeMyTrip) : Explanation➕Live Coding (LeetCode 151)
- Minimum Length of String After Deleting Similar Ends (LeetCode 1750)
- Maximum Width Ramp (LeetCode 962)
- Push Dominoes (LeetCode 838)
- Find the Lexicographically Largest String From the Box I (LeetCode 3403)
- Longest Balanced Subarray I (LeetCode 3719)
- Maximum Distance Between a Pair of Values (LeetCode 1855)