3505. 使 K 个子数组内元素相等的最少操作次数
Hard | Array, Hash Table, Math, Dynamic Programming, Sliding Window, Heap (Priority Queue)
Hard | Array, Hash Table, Math, Dynamic Programming, Sliding Window, Heap (Priority Queue)
Easy | Array, Hash Table, Linked List, Heap (Priority Queue), Simulation, Doubly-Linked List, Ordered Set
Medium | Array, Hash Table, Binary Search, Design, Queue, Ordered Set
Hard | Array, Hash Table, Dynamic Programming
Hard | Array, Hash Table, Linked List, Heap (Priority Queue), Simulation, Doubly-Linked List, Ordered Set
Hard | Hash Table, Math, String, Combinatorics, Counting
Medium | Array, Hash Table, String, Simulation
Medium | Array, Hash Table, String, Counting
Medium | Array, Hash Table, Sorting
Medium | Array, Hash Table, Binary Search, Union-Find, Graph Theory
Easy | Hash Table, String, Counting
Medium | Array, Hash Table, Stack, Greedy, Monotonic Stack
Medium | Hash Table, Dynamic Programming, Graph Theory
Easy | Hash Table, String, Greedy, Sorting, Counting
Medium | Array, Hash Table, Sorting
Medium | Array, Hash Table, Breadth-First Search, Matrix
Medium | Hash Table, Math, String, Sorting, Number Theory
Medium | Hash Table, String, Dynamic Programming, Greedy
Medium | Array, Hash Table, Bit Manipulation, Breadth-First Search, Matrix
Medium | Array, Hash Table, Counting