1 |
Get Maximum in Generated Array |
1646 |
Array, Dynamic Programming, Simulation |
Easy |
2 |
Minimum Deletions to Make Character Frequencies Unique |
1647 |
String, Greedy, Sorting |
Medium |
3 |
Sell Diminishing-Valued Colored Balls |
1648 |
Array, Math, Binary Search, Greedy, Sorting, Heap (Priority Queue) |
Medium |
4 |
Design an Ordered Stream |
1656 |
Array, Hash Table, Design, Data Stream |
Easy |
5 |
Determine if Two Strings Are Close |
1657 |
Hash Table, String, Sorting |
Medium |
6 |
Maximize Grid Happiness |
1659 |
Dynamic Programming, Bit Manipulation, Memoization, Bitmask |
Hard |
7 |
Minimum Operations to Reduce X to Zero |
1658 |
Array, Hash Table, Two Pointers, Binary Search, Prefix Sum |
Medium |
8 |
Check If Two String Arrays are Equivalent |
1662 |
Array, String |
Easy |
9 |
Smallest String With A Given Numeric Value |
1663 |
String, Greedy |
Medium |
10 |
Richest Customer Wealth |
1672 |
Array, Matrix |
Easy |
11 |
Find the Most Competitive Subsequence |
1673 |
Array, Stack, Greedy, Monotonic Stack |
Medium |
12 |
Minimum Moves to Make Array Complementary |
1674 |
Array, Hash Table, Prefix Sum |
Medium |
13 |
Minimize Deviation in Array |
1675 |
Array, Greedy, Heap (Priority Queue), Ordered Set |
Hard |
14 |
Partitioning Into Minimum Number Of Deci-Binary Numbers |
1689 |
String, Greedy |
Medium |
15 |
Stone Game VII |
1690 |
Array, Math, Dynamic Programming, Game Theory |
Medium |
16 |
Reformat Phone Number |
1694 |
String |
Easy |
17 |
Maximum Erasure Value |
1695 |
Array, Hash Table, Sliding Window |
Medium |
18 |
Top K Frequent Elements |
347 |
Array, Hash Table, Divide and Conquer, Sorting, Heap (Priority Queue), Bucket Sort, Counting, Quickselect |
Medium |
19 |
Swapping Nodes in a Linked List |
1721 |
Linked List, Two Pointers |
Medium |
20 |
Decode XORed Array |
1720 |
Array, Bit Manipulation |
Easy |
21 |
Minimize Hamming Distance After Swap Operations |
1722 |
Array, Depth-First Search, Union Find |
Medium |
22 |
Find Minimum Time to Finish All Jobs |
1723 |
Array, Dynamic Programming, Backtracking, Bit Manipulation, Bitmask |
Hard |
23 |
Cat and Mouse II |
1728 |
Math, Dynamic Programming, Breadth-First Search, Graph, Memoization, Game Theory |
Hard |
24 |
Best Time to Buy and Sell Stock |
121 |
Array, Dynamic Programming |
Easy |
25 |
Best Time to Buy and Sell Stock II |
122 |
Array, Dynamic Programming, Greedy |
Easy |
26 |
Latest Time by Replacing Hidden Digits |
1736 |
String, Greedy |
Easy |
27 |
Change Minimum Characters to Satisfy One of Three Conditions |
1737 |
Hash Table, String, Counting, Prefix Sum |
Medium |
28 |
Building Boxes |
1739 |
Math, Binary Search, Greedy |
Hard |
29 |
Maximum Number of Balls in a Box |
1742 |
Hash Table, Math, Counting |
Easy |
30 |
Restore the Array From Adjacent Pairs |
1743 |
Array, Hash Table |
Medium |
31 |
Can You Eat Your Favorite Candy on Your Favorite Day? |
1744 |
Array, Prefix Sum |
Medium |
32 |
Palindrome Partitioning IV |
1745 |
String, Dynamic Programming |
Hard |
33 |
Minimum Changes To Make Alternating Binary String |
1758 |
String |
Easy |
34 |
Count Number of Homogenous Substrings |
1759 |
Math, String |
Medium |
35 |
Minimum Limit of Balls in a Bag |
1760 |
Array, Binary Search |
Medium |
36 |
Minimum Degree of a Connected Trio in a Graph |
1761 |
Graph |
Hard |
37 |
Merge Strings Alternately |
1768 |
Two Pointers, String |
Easy |
38 |
Maximum Score from Performing Multiplication Operations |
1770 |
Array, Dynamic Programming |
Medium |
39 |
Maximize Palindrome Length From Subsequences |
1771 |
String, Dynamic Programming |
Hard |
40 |
Minimum Number of Operations to Move All Balls to Each Box |
1769 |
Array, String |
Medium |
41 |
Check if Binary String Has at Most One Segment of Ones |
1784 |
String |
Easy |
42 |
Check if One String Swap Can Make Strings Equal |
1790 |
Hash Table, String, Counting |
Easy |
43 |
Find Center of Star Graph |
1791 |
Graph |
Easy |
44 |
Maximum Score of a Good Subarray |
1793 |
Array, Two Pointers, Stack, Monotonic Stack |
Hard |
45 |
Maximum Ascending Subarray Sum |
1800 |
Array |
Easy |
46 |
Number of Orders in the Backlog |
1801 |
Array, Heap (Priority Queue), Simulation |
Medium |
47 |
Maximum Value at a Given Index in a Bounded Array |
1802 |
Binary Search, Greedy |
Medium |
48 |
Number of Different Integers in a String |
1805 |
Hash Table, String |
Easy |
49 |
Minimum Number of Operations to Reinitialize a Permutation |
1806 |
Array, Math, Simulation |
Medium |
50 |
Evaluate the Bracket Pairs of a String |
1807 |
Array, Hash Table, String |
Medium |
51 |
Maximize Number of Nice Divisors |
1808 |
Math, Recursion |
Hard |
52 |
Find the Winner of the Circular Game |
1823 |
Array, Math, Recursion, Queue, Simulation |
Medium |
53 |
Sign of the Product of an Array |
1822 |
Array, Math |
Easy |
54 |
Check if the Sentence Is Pangram |
1832 |
Hash Table, String |
Easy |
55 |
Single-Threaded CPU |
1834 |
Array, Sorting, Heap (Priority Queue) |
Medium |
56 |
Find XOR Sum of All Pairs Bitwise AND |
1835 |
Array, Math, Bit Manipulation |
Hard |
57 |
Maximum Ice Cream Bars |
1833 |
Array, Greedy, Sorting |
Medium |
58 |
Frequency of the Most Frequent Element |
1838 |
Array, Binary Search, Greedy, Sliding Window, Sorting, Prefix Sum |
Medium |
59 |
Maximum Building Height |
1840 |
Array, Math |
Hard |
60 |
Longest Substring Of All Vowels in Order |
1839 |
String, Sliding Window |
Medium |
61 |
Sum of Digits in Base K |
1837 |
Math |
Easy |
62 |
Maximum Population Year |
1854 |
Array, Counting |
Easy |
63 |
Maximum Subarray Min-Product |
1856 |
Array, Stack, Monotonic Stack, Prefix Sum |
Medium |
64 |
Maximum Distance Between a Pair of Values |
1855 |
Array, Two Pointers, Binary Search, Greedy |
Medium |
65 |
Two Sum |
1 |
Array, Hash Table |
Easy |
66 |
Largest Color Value in a Directed Graph |
1857 |
Hash Table, Dynamic Programming, Graph, Topological Sort, Memoization, Counting |
Hard |
67 |
Maximum Average Pass Ratio |
1792 |
Array, Greedy, Heap (Priority Queue) |
Medium |
68 |
Count of Matches in Tournament |
1688 |
Math, Simulation |
Easy |
69 |
Longer Contiguous Segments of Ones than Zeros |
1869 |
String |
Easy |
70 |
Minimum Speed to Arrive on Time |
1870 |
Array, Binary Search |
Medium |
71 |
Jump Game VII |
1871 |
Two Pointers, String, Prefix Sum |
Medium |
72 |
Stone Game VIII |
1872 |
Array, Math, Dynamic Programming, Prefix Sum, Game Theory |
Hard |
73 |
Path Sum |
112 |
Tree, Depth-First Search, Binary Tree |
Easy |
74 |
Path Sum II |
113 |
Backtracking, Tree, Depth-First Search, Binary Tree |
Medium |
75 |
Check if Word Equals Summation of Two Words |
1880 |
String |
Easy |
76 |
Maximum Value after Insertion |
1881 |
String, Greedy |
Medium |
77 |
Determine Whether Matrix Can Be Obtained By Rotation |
1886 |
Array, Matrix |
Easy |
78 |
Reduction Operations to Make the Array Elements Equal |
1887 |
Array, Sorting |
Medium |
79 |
Redistribute Characters to Make All Strings Equal |
1897 |
Hash Table, String, Counting |
Easy |
80 |
Maximum Number of Removable Characters |
1898 |
Array, String, Binary Search |
Medium |
81 |
Merge Triplets to Form Target Triplet |
1899 |
Array, Greedy |
Medium |
82 |
Maximum Product Difference Between Two Pairs |
1913 |
Array, Sorting |
Easy |
83 |
Cyclically Rotating a Grid |
1914 |
Array, Matrix, Simulation |
Medium |
84 |
Build Array from Permutation |
1920 |
Array, Simulation |
Easy |
85 |
Eliminate Maximum Number of Monsters |
1921 |
Array, Greedy, Sorting |
Medium |
86 |
Count Good Numbers |
1922 |
Math, Recursion |
Medium |
87 |
Concatenation of Array |
1929 |
Array |
Easy |
88 |
Unique Length-3 Palindromic Subsequences |
1930 |
Hash Table, String, Prefix Sum |
Medium |
89 |
Maximum Number of Words You Can Type |
1935 |
Hash Table, String |
Easy |
90 |
Add Minimum Number of Rungs |
1936 |
Array, Greedy |
Medium |
91 |
Maximum Number of Points with Cost |
1937 |
Array, Dynamic Programming |
Medium |
92 |
Painting a Grid With Three Different Colors |
1931 |
Dynamic Programming |
Hard |
93 |
Final Value of Variable After Performing Operations |
2011 |
Array, String, Simulation |
Easy |
94 |
Sum of Beauty in the Array |
2012 |
Array |
Medium |
95 |
Detect Squares |
2013 |
Array, Hash Table, Design, Counting |
Medium |
96 |
Maximum Difference Between Increasing Elements |
2016 |
Array |
Easy |
97 |
Grid Game |
2017 |
Array, Matrix, Prefix Sum |
Medium |
98 |
Check if Word Can Be Placed In Crossword |
2018 |
Array, Matrix, Enumeration |
Medium |
99 |
The Score of Students Solving Math Expression |
2019 |
Array, Math, String, Dynamic Programming, Stack, Memoization |
Hard |
100 |
Minimum Moves to Convert String |
2027 |
String, Greedy |
Easy |
101 |
Find Missing Observations |
2028 |
Array, Math, Simulation |
Medium |
102 |
Stone Game IX |
2029 |
Array, Math, Greedy, Counting, Game Theory |
Medium |
103 |
Two Out of Three |
2032 |
Array, Hash Table |
Easy |
104 |
Minimum Operations to Make a Uni-Value Grid |
2033 |
Array, Math, Sorting, Matrix |
Medium |
105 |
Check if Numbers Are Ascending in a Sentence |
2042 |
String |
Easy |
106 |
Simple Bank System |
2043 |
Array, Hash Table, Design, Simulation |
Medium |
107 |
Count Number of Maximum Bitwise-OR Subsets |
2044 |
Array, Backtracking, Bit Manipulation |
Medium |
108 |
Second Minimum Time to Reach Destination |
2045 |
Array, Breadth-First Search, Graph, Shortest Path |
Hard |
109 |
Number of Valid Words in a Sentence |
2047 |
String |
Easy |
110 |
Next Greater Numerically Balanced Number |
2048 |
Math, Backtracking, Enumeration |
Medium |
111 |
Count Nodes With the Highest Score |
2049 |
Array, Tree, Depth-First Search, Binary Tree |
Medium |
112 |
Count Vowel Substrings of a String |
2062 |
Hash Table, String |
Easy |
113 |
Vowels of All Substrings |
2063 |
Math, String, Dynamic Programming, Combinatorics |
Medium |
114 |
Ugly Number |
263 |
Math |
Easy |
115 |
Ugly Number II |
264 |
Hash Table, Math, Dynamic Programming, Heap (Priority Queue) |
Medium |
116 |
Minimized Maximum of Products Distributed to Any Store |
2064 |
Array, Binary Search |
Medium |
117 |
Time Needed to Buy Tickets |
2073 |
Array, Queue, Simulation |
Easy |
118 |
Reverse Nodes in Even Length Groups |
2074 |
Linked List |
Medium |
119 |
Decode the Slanted Ciphertext |
2075 |
String, Simulation |
Medium |
120 |
Two Furthest Houses With Different Colors |
2078 |
Array, Greedy |
Easy |
121 |
Watering Plants |
2079 |
Array |
Medium |
122 |
Range Frequency Queries |
2080 |
Array, Hash Table, Binary Search, Design, Segment Tree |
Medium |
123 |
Sum of k-Mirror Numbers |
2081 |
Math, Enumeration |
Hard |
124 |
Course Schedule |
207 |
Depth-First Search, Breadth-First Search, Graph, Topological Sort |
Medium |
125 |
Course Schedule IV |
1462 |
Depth-First Search, Breadth-First Search, Graph, Topological Sort |
Medium |
126 |
Unique Binary Search Trees |
96 |
Math, Dynamic Programming, Tree, Binary Search Tree, Binary Tree |
Medium |
127 |
Unique Binary Search Trees II |
95 |
Dynamic Programming, Backtracking, Tree, Binary Search Tree, Binary Tree |
Medium |