3510. 最小配对移除使数组有序 II
Hard | Array, Hash Table, Linked List, Heap (Priority Queue), Simulation, Doubly-Linked List, Ordered Set
Hard | Array, Hash Table, Linked List, Heap (Priority Queue), Simulation, Doubly-Linked List, Ordered Set
Hard | Array, Tree, Depth-First Search, Ordered Set
Medium | Array, Hash Table, Depth-First Search, Breadth-First Search, Union-Find, Graph Theory, Heap (Priority Queue), Ordered Set
Hard | Math, String, Breadth-First Search, Union-Find, Ordered Set
Medium | Hash Table, Design, Heap (Priority Queue), Ordered Set
Medium | Array, Hash Table, Design, Heap (Priority Queue), Ordered Set
Medium | Array, Hash Table, Heap (Priority Queue), Ordered Set
Hard | Array, Math, Geometry, Sorting, Ordered Set
Hard | Array, Binary Search, Greedy, Binary Indexed Tree, Segment Tree, Sorting, Ordered Set
Hard | Array, Hash Table, Binary Search, Dynamic Programming, Memoization, Sorting, Matrix, Ordered Set