2349. 设计数字容器系统
Medium | Hash Table, Design, Heap (Priority Queue), Ordered Set
Medium | Hash Table, Design, Heap (Priority Queue), Ordered Set
Medium | Array, Hash Table, String, Design, Heap (Priority Queue), Ordered Set
Easy | Array, Hash Table, Sorting, Ordered Set
Hard | Array, Union-Find, Prefix Sum, Ordered Set
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, Hash Table, Breadth-First Search, Union-Find, Ordered Set
Medium | Hash Table, String, Binary Search, Design, Sorting, Ordered Set
Medium | Array, Hash Table, String, Sorting, Ordered Set
Hard | Array, Heap (Priority Queue), Simulation, Ordered Set