3031. 将单词恢复到初始状态的最少时间 II
Hard | String, Rolling Hash, String Matching, Hash Function
Hard | String, Rolling Hash, String Matching, Hash Function
Hard | Array, Rolling Hash, String Matching, Hash Function
Hard | Array, Dynamic Programming, Sorting
Hard | Array, String, Trie, Rolling Hash, String Matching, Hash Function
Hard | Array, Binary Search, Greedy, Heap (Priority Queue)
Hard | Array, Dynamic Programming, Greedy, Bit Manipulation, Tree, Sorting
Hard | Array, Binary Indexed Tree, Segment Tree, Simulation
Hard | Array, Dynamic Programming, Prefix Sum
Hard | Array, Dynamic Programming
Hard | Array, Greedy, Sliding Window, Prefix Sum
Hard | Array, String, Trie
Hard | Array, Dynamic Programming, Sorting
Hard | Array, Math, Geometry, Sorting, Ordered Set
Hard | Array, Bit Manipulation, Union-Find, Graph Theory
Hard | Array, Binary Search, Stack, Monotonic Stack
Hard | Array, Math, Binary Search, Bit Manipulation, Combinatorics, Number Theory
Hard | Array, Binary Search, Dynamic Programming, Bit Manipulation, Segment Tree, Queue
Hard | Depth-First Search, Breadth-First Search, Graph Theory, Heap (Priority Queue), Shortest Path
Hard | Dynamic Programming, Prefix Sum
Hard | Array, Hash Table, Binary Search, Sliding Window