| 2849 |
determine if a cell is reachable at a given time |
 |
 |
solution |
| 2785 |
sort vowels in a string |
  |
|
solution |
| 2433 |
find the original array of prefix xor |
  |
|
solution |
| 2391 |
minimum amount of time to collect garbage |
 |
|
solution |
| 2265 |
count nodes equal to average of subtree |
   |
|
solution |
| 1887 |
reduction operations to make the array elements equal |
|
|
solution |
| 1877 |
minimize maximum pair sum in array |
  |
|
solution |
| 1846 |
maximum element after decreasing and rearranging |
|
|
solution |
| 1845 |
seat reservation manager |
  |
|
solution |
| 1838 |
frequency of the most frequent element |
  |
|
solution |
| 1833 |
maximum ice cream bars |
 |
|
solution |
| 1535 |
find the winner of an array game |
 |
|
solution |
| 1503 |
last moment before all ants fall out of a plank |
 |
|
solution |
| 1441 |
build an array with stack operations |
 |
|
solution |
| 1356 |
sort integers by the number of 1 bits |
 |
 |
solution |
| 815 |
bus routes |
  |
 |
solution |
| 501 |
find mode in binary search tree |
 |
|
solution |
| 1814 |
count nice pairs in an array |
|
|
solution |
| 1424 |
diagonal traverse II |
|
|
solution |
| 1630 |
arithmetic subarrays |
|
|
solution |
| 1561 |
maximum number of coins you can get |
 |
|
solution |
| 1727 |
largest submatrix with rearrangements |
 |
|
solution |
| 935 |
knight dialer |
 |
|
solution |
| 2147 |
number of ways to divide a long corridor |
|
|
solution |
| 191 |
number of 1 bits |
 |
|
solution |
| 1685 |
sum of absolute differences in a sorted array |
|
|
solution |
| 1611 |
minimum one bit operations to make integers zero |
 |
|
solution |
| 1160 |
find words that can be formed by characters |
|
|
solution |
| 1266 |
minimum time visiting all points |
 |
|
solution |
| 2264 |
largest 3-same-digit number in string |
|
|
solution |
| 1688 |
Count of matches in tournament |
|
|
solution |
| 1716 |
calculate money in leetcode bank |
|
|
solution |
| 1903 |
largest odd number in string |
|
|
solution |
| 606 |
construct string from binary tree |
|
|
solution |
| 94 |
binary tree inorder traversal |
|
|
solution |
| 867 |
transpose matrix |
|
|
solution |
| 1287 |
element appearing more than 25 In sorted array |
|
|
solution |
| 1464 |
maximum product of two elements in an array |
|
|
solution |
| 1582 |
special positions in a binary matrix |
|
|
solution |
| 2482 |
difference between ones and zeros in row and column |
|
|
solution |
| 1436 |
destination city |
|
|
solution |
| 242 |
valid anagram |
|
|
solution |
| 1913 |
maximum product difference between two pairs |
|
|
solution |
| 2706 |
buy two chocolates |
|
|
solution |
| 1637 |
widest vertical area between two points containing no points |
|
|
solution |
| 1422 |
maximum score after splitting a string |
|
|
solution |
| 1496 |
path crossing |
|
|
solution |
| 1758 |
minimum changes to make alternating binary string |
|
|
solution |
| 938 |
range sum of BST |
|
|
solution |
| 872 |
leaf-Similar trees |
|
|
solution |
| 2385 |
amount of time for binary tree to be infected |
|
|
solution |
| 1704 |
determine if string halves are alike |
|
|
solution |
| 2225 |
find players with zero or one losses |
|
|
solution |
| 1207 |
unique number of occurrences |
|
|
solution |
| 70 |
climbing stairs |
|
|
solution |
| 931 |
minimum falling path sum |
|
|
solution |
| 2108 |
find first palindromic string in the array |
|
|
solution |
| 513 |
find bottom left tree value |
|
|
solution |
| 1609 |
even odd tree |
|
|
solution |
| 2864 |
maximum odd binary number |
|
|
solution |
| 19 |
remove nth node from end of list |
 |
|
solution |
| 977 |
squares of a sorted array |
|
|
solution |
| 948 |
bag of tokens |
|
|
solution |
| 1750 |
minimum length of string after deleting similar ends |
|
|
solution |
| 141 |
linked list cycle |
|
|
solution |
| 876 |
middle of the linked list |
|
|
solution |
| 3005 |
count elements with maximum frequency |
|
|
solution |
| 791 |
custom sort string |
|
|
solution |
| 1171 |
remove zero sum consecutive nodes from linked list |
|
|
solution |
| 2485 |
find the pivot integer |
|
|
solution |
| 930 |
binary subarrays with sum |
|
|
solution |
| 238 |
product of array except self |
|
|
solution |
| 57 |
insert interval |
|
|
solution |
| 442 |
find all duplicates in an array |
|
|
solution |
| 42 |
trapping rain water |
 |
|
solution |
| 404 |
sum of left leaves |
|
|
solution |
| 129 |
sum root to leaf numbers |
|
|
solution |
| 623 |
add one row to tree |
|
|
solution |
| 988 |
smallest string starting from leaf |
 |
|
solution |
| 463 |
island perimeter |
|
|
solution |
| 200 |
number of islands |
 |
|
solution |
| 1971 |
find if path exists in graph |
 |
|
solution |
| 752 |
open the lock |
|
|
solution |
| 310 |
minimum height Trees |
 |
|
solution |
| 1137 |
n-th tribonacci number |
|
|
solution |
| 1289 |
minimum falling path sum II |
|
|
solution |
| 2997 |
minimum number of operations to make array XOR equal to k |
|
|
solution |
| 2441 |
largest positive integer that exists with its negative |
|
|
solution |
| 165 |
compare version numbers |
|
|
solution |
| 881 |
boats to save people |
|
|
solution |
| 237 |
delete node in a linked list |
|
|
solution |
| 2487 |
remove nodes from linked list |
 |
|
solution |
| 2816 |
double a number represented as a linked list |
|
|
solution |
| 506 |
relative ranks |
|
|
solution |
| 3075 |
maximize happiness of selected children |
|
|
solution |
| 786 |
k-th smallest prime fraction |
|
|
solution |
| 857 |
minimum cost to hire k workers |
|
|
solution |
| 861 |
score after flipping matrix |
|
|
solution |
| 1219 |
path with maximum gold |
|
|
solution |
| 2331 |
evaluate boolean binary tree |
|
|
solution |
| 1325 |
delete leaves with a given value |
|
|
solution |
| 1863 |
sum of all subset xor totals |
  |
|
solution |
| 78 |
subsets |
|
|
solution |
| 131 |
palindrome partitioning |
|
|
solution |
| 2597 |
the number of beautiful subsets |
|
|
solution |
| 1255 |
maximum score words formed by letters |
 |
|
solution |
| 552 |
student attendance record II |
|
|
solution |
| 9 |
palindrome number |
|
|
solution |
| 13 |
roman to integer |
|
|
solution |
| 1608 |
special array with x elements greater than or equal x |
|
|
solution |
| 1208 |
get equal substrings within budget |
|
|
solution |
| 1442 |
count triplets that can form two arrays of equal xor |
|
|
solution |
| 260 |
single number III |
|
|
solution |
| 3110 |
score of a string |
|
|
solution |
| 344 |
reverse string |
|
|
solution |
| 2486 |
append characters to string to make subsequence |
|
|
solution |
| 409 |
longest palindrome |
|
|
solution |
| 1002 |
find common characters |
|
|
solution |
| 846 |
hand of straights |
|
|
solution |
| 648 |
replace words |
 |
|
solution |
| 523 |
continuous subarray sum |
|
|
solution |
| 974 |
subarray sums divisible by k |
|
|
solution |
| 1051 |
height checker |
|
|
solution |
| 1222 |
relative sort array |
|
|
solution |
| 2037 |
minimum number of moves to seat everyone |
|
|
solution |
| 945 |
minimum increment to make array unique |
|
|
solution |
| 502 |
IPO |
|
|
solution |
| 633 |
sum of square numbers |
|
|
solution |
| 826 |
most profit assigning work |
|
|
solution |
| 1482 |
minimum number of days to make m bouquets |
|
|
solution |
| 1552 |
magnetic force between two balls |
|
|
solution |
| 1052 |
grumpy bookstore owner |
|
|
solution |
| 1038 |
binary search tree to greater sum tree |
|
|
solution |
| 1382 |
balance a binary search tree |
|
|
solution |
| 1791 |
find center of star graph |
|
|
solution |
| 2285 |
maximum total importance of roads |
|
|
solution |
| 2192 |
all ancestors of a node in a directed acyclic graph |
|
|
solution |
| 1550 |
three consecutive odds |
|
|
solution |
| 350 |
intersection of two arrays II |
|
|
solution |
| 1509 |
minimum difference between largest and smallest value in three moves |
|
|
solution |
| 2181 |
merge nodes in between zeros |
|
|
solution |
| 2582 |
pass the pillow |
|
|
solution |
| 1518 |
water bottles |
|
|
solution |
| 1190 |
reverse substrings between each pair of parentheses |
|
|
solution |
| 40 |
combination sum II |
|
|
solution |
| 624 |
maximum distance in arrays |
|
|
solution |
| 590 |
n-ary tree postorder traversal |
|
|
solution |
| 145 |
binary tree postorder traversal |
|
|
solution |
| 2022 |
convert 1D Array Into 2D array |
|
|
solution |
| 1894 |
find the student that will replace the chalk |
|
|
solution |
| 1945 |
sum of digits of string after convert |
|
|
solution |
| 874 |
walking robot simulation |
|
|
solution |
| 2028 |
find missing observations |
|
|
solution |
| 3217 |
delete nodes from linked list present in array |
|
|
solution |
| 2326 |
spiral matrix IV |
|
|
solution |
| 2807 |
insert greatest common divisors in linked list |
 |
|
solution |
| 2220 |
minimum bit flips to convert number |
|
|
solution |
| 1684 |
count the number of consistent strings |
|
|
solution |
| 1310 |
xor queries of a subarray |
|
|
solution |
| 2419 |
longest subarray with maximum bitwise and |
|
|
solution |
| 1371 |
find the longest substring containing vowels in even counts |
|
|
solution |
| 179 |
largest number |
|
|
solution |
| 241 |
different ways to add parentheses |
|
|
solution |
| 214 |
shortest palindrome |
   |
|
solution |
| 2707 |
extra characters in a string |
|
|
solution |
| 118 |
pascals triangle |
|
|
solution |
| 729 |
my calendar I |
  |
|
solution |
| 731 |
my calendar II |
|
|
solution |
| 1381 |
design a stack with increment operation |
|
|
solution |
| 884 |
uncommon words from two sentences |
|
|
solution |
| 725 |
split linked list in parts |
|
|
solution |
| 1497 |
check if array pairs are divisible by k |
|
|
solution |
| 1331 |
rank transform of an array |
|
|
solution |
| 1590 |
make sum divisible by p |
|
|
solution |
| 2696 |
minimum string length after removing substrings |
|
|
solution |
| 1963 |
minimum number of swaps to make the string balanced |
|
|
solution |
| 921 |
minimum add to make parentheses valid |
|
|
solution |
| 962 |
maximum width ramp |
|
|
solution |
| 2914 |
minimum number of changes to make binary string beautiful |
|
|
solution |
| 2684 |
maximum number of moves in a grid |
|
|
solution |
| 1415 |
the k-th lexicographical string of all happy strings of length n |
|
|
solution |
| 1980 |
find unique binary string |
|
|
solution |
| 1261 |
find elements in a contaminated binary tree |
|
|
solution |
| 1524 |
number of sub-arrays with odd sum |
|
|
solution |
| 2460 |
apply operations to an array |
|
|
solution |
| 2570 |
merge two 2D arrays by summing values |
|
|
solution |
| 2161 |
partition array according to given pivot |
|
|
solution |
| 3011 |
find if array can be sorted |
|
|
solution |
| 1652 |
defuse the bomb |
|
|
solution |
| 2461 |
maximum sum of distinct subarrays with length K |
|
|
solution |
| 2516 |
take k of each character from left and right |
|
|
solution |
| 1346 |
check if n and its double exist |
|
|
solution |
| 1455 |
check if a word occurs as a prefix of any word in a sentence |
|
|
solution |
| 2109 |
adding spaces to a string |
|
|
solution |
| 2825 |
make string a subsequence using cyclic increments |
|
|
solution |
| 3254 |
find the power of k size subarrays i |
|
|
solution |
| 1662 |
check if two string arrays are equivalent |
|
|
solution |
| 2058 |
find the minimum and maximum number of nodes between critical points |
|
|
solution |
| 3318 |
find x sum of all k long subarrays i |
|
|
solution |
| 976 |
largest perimeter triangle |
|
|
solution |
| 1780 |
check if number is a sum of powers of three |
|
|
solution |
| 3186 |
maximum total damage with spell casting |
|
|
solution |
| 3349 |
adjacent increasing subarrays detection i |
|
|
solution |
| 1488 |
avoid flood in the city |
|
|
solution |
| 812 |
largest triangle area |
|
|
solution |
| 3100 |
water bottles ii |
|
|
solution |
| 3147 |
taking maximum energy from the mystic dungeon |
|
|
solution |
| 303 |
range sum query immutable |
|
|
solution |
| 73 |
set matrix zeroes |
|
|
solution |
| 2965 |
find missing and repeated values |
|
|
solution |
| 2379 |
minimum recolors to get k consecutive black blocks |
|
|
solution |
| 120 |
triangle |
|
|
solution |
| 3461 |
check if digits are equal in string after operations i |
|
|
solution |
| 3381 |
maximum subarray sum with length divisible by k |
|
|
solution |
| 3542 |
minimum operations to convert all elements to zero |
|
|
solution |
| 560 |
subarray sum equals k |
|
|
solution |
| 1578 |
minimum time to make rope colorful |
|
|
solution |
| 2579 |
count total number of colored cells |
|
|
solution |
| 1390 |
four divisors |
|
|
solution |
| 2523 |
closest prime numbers in range |
|
|
solution |
| 3355 |
zero array transformation i |
|
|
solution |
| 392 |
is subsequence |
|
|
solution |
| 2125 |
number of laser beams in a bank |
|
|
solution |
| 2048 |
next greater numerically balanced number |
|
|
solution |
| 3512 |
minimum operations to make array sum divisible by k |
|
|
solution |
| 2529 |
maximum count of positive integer and negative integer |
|
|
solution |
| 2226 |
maximum candies allocated to k children |
|
|
solution |
| 3354 |
make array elements equal to zero |
|
|
solution |
| 1526 |
minimum number of increments on subarrays to form a target array |
|
|
solution |
| 2300 |
successful pairs of spells and potions |
|
|
solution |
| 611 |
valid triangle number |
|
|
solution |
| 1920 |
build array from permutation |
|
|
solution |
| 2273 |
find resultant array after removing anagrams |
|
|
solution |
| 2257 |
count unguarded cells in the grid |
|
|
solution |
| 3350 |
adjacent increasing subarrays detection ii |
|
|
solution |
-blue){kind=icon}
