2940. 找到爱丽丝和鲍勃可以相遇的建筑
Hard | Array, Binary Search, Stack, Binary Indexed Tree, Segment Tree, Heap (Priority Queue), Monotonic Stack
Hard | Array, Binary Search, Stack, Binary Indexed Tree, Segment Tree, Heap (Priority Queue), Monotonic Stack
Medium | Array, Hash Table, Binary Search, Design, Segment Tree
Hard | Array, Binary Search, Divide and Conquer, Binary Indexed Tree, Segment Tree, Merge Sort, Ordered Set
Hard | Array, String, Segment Tree, Ordered Set
Hard | Design, Segment Tree, Ordered Set
Hard | Array, Divide and Conquer, Dynamic Programming, Binary Indexed Tree, Segment Tree, Queue, Monotonic Queue
Medium | Hash Table, Binary Search, Union-Find, Design, Binary Indexed Tree, Segment Tree, Heap (Priority Queue), Ordered Set
Hard | Array, Binary Search, Divide and Conquer, Binary Indexed Tree, Segment Tree, Merge Sort, Ordered Set
Hard | Array, Segment Tree
Medium | Array, Dynamic Programming, Binary Indexed Tree, Segment Tree