508. 最频繁的子树元素和
Medium | Hash Table, Tree, Depth-First Search, Binary Tree
Medium | Hash Table, Tree, Depth-First Search, Binary Tree
Medium | Hash Table, Math, Reservoir Sampling, Randomized
Medium | Array, Hash Table, Math, Prefix Sum
Medium | Array, Hash Table, Prefix Sum
Medium | Array, Hash Table, Two Pointers, Binary Search, Sorting
Medium | Hash Table, String, Design, Hash Function
Medium | Array, Hash Table
Medium | Hash Table, Two Pointers, String, Sliding Window
Easy | Array, Hash Table
Easy | Array, Hash Table, Sliding Window, Sorting, Counting
Medium | Array, Hash Table, String
Medium | Array, Hash Table, Greedy, Sorting, Heap (Priority Queue), Counting
Easy | Array, Hash Table, Bit Manipulation, Sorting
Medium | Array, Hash Table, String, Trie
Medium | Hash Table, Tree, Depth-First Search, Binary Tree
Easy | Hash Table, Two Pointers, Tree, Depth-First Search, Breadth-First Search, Binary Search Tree, Binary Tree
Medium | Array, Hash Table, Greedy, Heap (Priority Queue)
Medium | Hash Table, String, Depth-First Search, Design, Trie
Medium | Array, Hash Table, Tree, Depth-First Search, Breadth-First Search
Hard | Array, Hash Table, String, Dynamic Programming, Backtracking, Bit Manipulation, Memoization, Bitmask