Find Building Where Alice and Bob Can Meet (LeetCode 2940)
HardLeetCode 2940 · Fenwick Tree (BIT) · Google, Amazon +3 · 37:09Find Building Where Alice and Bob Can Meet · Segment Tree Concepts & Qns · Video 11 · Leetcode 2940My 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 2940 Find Building Where Alice and Bob Can Meet by codestorywithMIK: Segment Tree & BIT, Hard. Topics: Array, Binary Search, Stack, Binary Indexed Tree. Watch the explanation, then check the code and solve it on LeetCode.
- Difficulty
- hard
- Topics
- Array, Binary Search, Stack, Binary Indexed Tree, Segment Tree, Heap (Priority Queue), Monotonic Stack
- Patterns
- Fenwick Tree (BIT)
- Chapter
- Segment Tree & BIT
- Duration
- 37:09