| 38 |
count and say |
 |
| 143 |
reorder list |
 |
| 166 |
fraction to recurring decimal |
 |
| 180 |
consecutive numbers |
 |
| 442 |
find all duplicates in an array |
 |
| 550 |
game play analysis iv |
 |
| 570 |
managers with at least 5 direct reports |
 |
| 640 |
solve the equation |
 |
| 684 |
redundant connection |
 |
| 768 |
partition labels |
 |
| 820 |
find eventual safe states |
 |
| 940 |
fruit into baskets |
 |
| 948 |
bag of tokens |
 |
| 952 |
word subsets |
 |
| 1045 |
customers who bought all products |
 |
| 1070 |
product sales analysis iii |
 |
| 1161 |
maximum level sum of a binary tree |
 |
| 1164 |
product price at a given date |
 |
| 1174 |
immediate food delivery ii |
 |
| 1193 |
monthly transactions i |
 |
| 1218 |
lowest common ancestor of deepest leaves |
 |
| 1335 |
maximum candies allocated to k children |
 |
| 1339 |
maximum product of splitted binary tree |
 |
| 1364 |
tuple with same product |
 |
| 1382 |
balance a binary search tree |
 |
| 1390 |
four divisors |
 |
| 1396 |
count servers that communicate |
 |
| 1477 |
product of the last k numbers |
 |
| 1502 |
construct k palindrome strings |
 |
| 1516 |
the k th lexicographical string of all happy strings of length n |
 |
| 1558 |
course schedule iv |
 |
| 1653 |
minimum deletions to make string balanced |
 |
| 1818 |
maximum score from removing substrings |
 |
| 1819 |
construct the lexicographically largest valid sequence |
 |
| 1876 |
map of highest peak |
 |
| 1877 |
minimize maximum pair sum in array |
 |
| 1895 |
minimum number of operations to move all balls to each box |
 |
| 1917 |
maximum average pass ratio |
 |
| 1934 |
confirmation rate |
 |
| 1975 |
maximum matrix sum |
 |
| 2021 |
remove all occurrences of a substring |
 |
| 2050 |
count good numbers |
 |
| 2059 |
unique length 3 palindromic subsequences |
 |
| 2090 |
number of ways to arrive at destination |
 |
| 2107 |
find unique binary string |
 |
| 2145 |
grid game |
 |
| 2220 |
find all possible recipes from given supplies |
 |
| 2221 |
check if a parentheses string can be valid |
 |
| 2265 |
partition array according to given pivot |
 |
| 2358 |
number of ways to split array |
 |
| 2448 |
count number of bad pairs |
 |
| 2456 |
construct smallest number from di string |
 |
| 2465 |
shifting letters ii |
 |
| 2473 |
max sum of a pair with equal sum of digits |
 |
| 2478 |
longest nice subarray |
 |
| 2497 |
maximum matching of players with trainers |
 |
| 2498 |
smallest subarrays with maximum bitwise or |
 |
| 2509 |
minimize xor |
 |
| 2529 |
range product queries of powers |
 |
| 2533 |
bitwise xor of all pairings |
 |
| 2610 |
closest prime numbers in range |
 |
| 2685 |
first completely painted row or column |
 |
| 2691 |
count vowel strings in ranges |
 |
| 2764 |
maximum number of fish in a grid |
 |
| 2766 |
find the prefix common array of two arrays |
 |
| 2792 |
neighboring bitwise xor |
 |
| 2975 |
maximum square area by removing fences from a field |
 |
| 2976 |
minimum cost to convert string i |
 |
| 3018 |
make string a subsequence using cyclic increments |
 |
| 3152 |
maximum value of an ordered triplet ii |
 |
| 3219 |
make lexicographically smallest array by swapping elements |
 |
| 3278 |
find the number of ways to place people i |
 |
| 3315 |
construct the minimum bitwise array ii |
 |
| 3430 |
count days without meetings |
 |
| 3453 |
separate squares i |
 |
| 3455 |
minimum length of string after operations |
 |
| 3569 |
count of substrings containing every vowel and k consonants ii |
 |
| 3634 |
minimum removals to balance array |
 |
| 3643 |
zero array transformation ii |
 |
| 3650 |
minimum cost path with edge reversals |
 |
| 3678 |
design task manager |
 |
| 3719 |
longest balanced subarray i |
 |
| 3794 |
find the minimum amount of time to brew potions |
 |