895. 最大频率栈
Hard | Hash Table, Stack, Design, Ordered Set
Hard | Hash Table, Stack, Design, Ordered Set
Hard | Array, Dynamic Programming, Stack, Sorting, Monotonic Stack, Ordered Set
Hard | Array, Binary Search, Divide and Conquer, Binary Indexed Tree, Segment Tree, Merge Sort, Ordered Set
Medium | Array, Math, Binary Search, Reservoir Sampling, Prefix Sum, Ordered Set, Randomized
Hard | Array, Segment Tree, Ordered Set
Hard | Design, Segment Tree, Ordered Set
Hard | Array, Binary Search, Divide and Conquer, Binary Indexed Tree, Segment Tree, Merge Sort, Ordered Set
Hard | Hash Table, Binary Search, Union-Find, Design, Data Stream, Ordered Set
Medium | Array, Binary Search, Stack, Monotonic Stack, Ordered Set
Hard | Array, Divide and Conquer, Binary Indexed Tree, Segment Tree, Sweep Line, Sorting, Heap (Priority Queue), Ordered Set