2571. 使整数减为 0 的最少操作次数
Medium | Dynamic Programming, Greedy, Bit Manipulation
Medium | Dynamic Programming, Greedy, Bit Manipulation
Medium | Array, Math, Dynamic Programming, Bit Manipulation, Number Theory, Bitmask
Hard | Array, String, Dynamic Programming, Greedy, Union-Find, Matrix
Easy | Array, Prefix Sum
Medium | Array, Math, String
Medium | Array, Two Pointers, Binary Search, Greedy, Sorting
Hard | Array, Breadth-First Search, Graph Theory, Heap (Priority Queue), Matrix, Shortest Path
Easy | Math, Greedy, Sorting
Medium | Math
Medium | Array, Sorting
Hard | Array, Hash Table, Dynamic Programming, Tree, Depth-First Search
Easy | Math, Simulation
Medium | Tree, Breadth-First Search, Sorting, Binary Tree
Hard | Array, Hash Table, Math, Number Theory
Hard | Array, Dynamic Programming
Easy | Array, String, Counting
Medium | Array, Greedy, Sorting, Prefix Sum
Medium | Array, Hash Table, Bit Manipulation, Prefix Sum
Hard | Array, Binary Search, Stack, Greedy, Sorting
Easy | Math, Greedy