Separate Black and White Balls MEDIUM Two Pointers String Greedy
Minimum Operations to Reduce an Integer to 0 MEDIUM Dynamic Programming Greedy Bit Manipulation
Find the Peaks EASY Array Enumeration
Two Sum EASY Array Hash Table
Replace the Substring for Balanced String MEDIUM String Sliding Window
Fill Missing Data EASY
Count All Valid Pickup and Delivery Options HARD Math Dynamic Programming Combinatorics
Game of Life MEDIUM Array Matrix Simulation
Reformat Phone Number EASY String
Check If Digits Are Equal in String After Operations II HARD Math String Combinatorics Number Theory
Arithmetic Slices MEDIUM Array Dynamic Programming Sliding Window
Parsing A Boolean Expression HARD String Stack Recursion
Insert Delete GetRandom O(1) MEDIUM Array Hash Table Math Design Randomized
Minimum Absolute Difference EASY Array Sorting
Eliminate Maximum Number of Monsters MEDIUM Array Greedy Sorting
Text Justification HARD Array String Simulation
Find the Number of Good Pairs II MEDIUM Array Hash Table
Find the Number of Good Pairs I EASY Array Hash Table
Minimum Array Changes to Make Differences Equal MEDIUM Array Hash Table Prefix Sum
XOR Queries of a Subarray MEDIUM Array Bit Manipulation Prefix Sum
Find Polygon With the Largest Perimeter MEDIUM Array Greedy Sorting Prefix Sum
N-Repeated Element in Size 2N Array EASY Array Hash Table
Map Sum Pairs MEDIUM Hash Table String Design Trie
Cherry Pickup HARD Array Dynamic Programming Matrix
Network Delay Time MEDIUM Depth-First Search Breadth-First Search Graph Theory Heap (Priority Queue) Shortest Path
Create Sorted Array through Instructions HARD Array Binary Search Divide and Conquer Binary Indexed Tree Segment Tree Merge Sort Ordered Set
Minimum Initial Energy to Finish Tasks HARD Array Greedy Sorting
Can Make Palindrome from Substring MEDIUM Array Hash Table String Bit Manipulation Prefix Sum
Constrained Subsequence Sum HARD Array Dynamic Programming Queue Sliding Window Heap (Priority Queue) Monotonic Queue
Dice Roll Simulation HARD Array Dynamic Programming
Number of Different Subsequences GCDs HARD Array Math Counting Number Theory
Number of Operations to Make Network Connected MEDIUM Depth-First Search Breadth-First Search Union-Find Graph Theory
Reduce Array Size to The Half MEDIUM Array Hash Table Greedy Sorting Heap (Priority Queue)
Increasing Decreasing String EASY Hash Table String Counting
Split Array with Equal Sum HARD Array Hash Table Prefix Sum
Split Concatenated Strings MEDIUM Array String Greedy
Path Sum IV MEDIUM Array Hash Table Tree Depth-First Search Binary Tree
Valid Parenthesis String MEDIUM String Dynamic Programming Stack Greedy
Number Of Rectangles That Can Form The Largest Square EASY Array
Maximum Number of Removable Characters MEDIUM Array Two Pointers String Binary Search
Maximum Number of Pairs in Array EASY Array Hash Table Counting
Watering Plants MEDIUM Array Simulation
Number of Divisible Substrings MEDIUM Hash Table String Counting Prefix Sum
Design a 3D Binary Matrix with Efficient Layer Tracking MEDIUM Array Hash Table Design Heap (Priority Queue) Matrix Ordered Set
Construct Uniform Parity Array I EASY Array Math
Construct Uniform Parity Array II MEDIUM Array Math
Find a Value of a Mysterious Function Closest to Target HARD Array Binary Search Bit Manipulation Segment Tree
Percentage of Letter in String EASY String
Maximum Equal Frequency HARD Array Hash Table
Maximize the Topmost Element After K Moves MEDIUM Array Greedy