Longest Balanced Subarray II (LeetCode 3721)
HardLeetCode 3721 · Build & Range Query · Google, Amazon · 33:17Longest Balanced Subarray II · Leetcode 3721 · Min-Max Query · Segment Tree Concept · Video 15My 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 3721 Longest Balanced Subarray II by codestorywithMIK: Segment Tree & BIT, Hard. Topics: Array, Hash Table, Divide and Conquer, Segment Tree. Watch the explanation, then check the code and solve it on LeetCode.
- Difficulty
- hard
- Topics
- Array, Hash Table, Divide and Conquer, Segment Tree, Prefix Sum
- Patterns
- Build & Range Query
- Chapter
- Segment Tree & BIT
- Duration
- 33:17