2550. 猴子碰撞的方法数
Medium | Math, Recursion
Medium | Math, Recursion
Hard | Array, Greedy, Sorting, Heap (Priority Queue)
Hard | Array, Dynamic Programming, Binary Indexed Tree, Enumeration, Prefix Sum
Easy | Array, Simulation
Medium | Array, Hash Table, Binary Search, Greedy, Sorting
Medium | Array, Binary Search, Sliding Window
Medium | Array, Dynamic Programming, Depth-First Search, Breadth-First Search, Matrix
Easy | Array, Heap (Priority Queue), Simulation
Medium | Array, String, Prefix Sum
Medium | Array, Binary Search, Dynamic Programming, Greedy
Hard | Array, Hash Table, Greedy, Sort
Easy | Array, Two Pointers, Simulation
Medium | Array, Two Pointers, Binary Search, Sorting
Medium | Array, Hash Table, String, Bit Manipulation
Hard | Two Pointers, String, Binary Search
Easy | Math, Greedy
Medium | Array, Greedy, Sorting
Medium | Array, Bit Manipulation, Brainteaser
Hard | Array, Segment Tree
Easy | Array, Hash Table, Two Pointers