| 1 |
|
two sum |
golang |
简单 |
| 2 |
|
add two numbers |
|
中等 |
| 3 |
|
longest substring without repeating characters |
|
中等 |
| 4 |
|
median of two sorted arrays |
|
困难 |
| 5 |
|
longest palindromic substring |
|
中等 |
| 6 |
|
zigzag conversion |
|
中等 |
| 7 |
|
reverse integer |
|
简单 |
| 8 |
|
string to integer atoi |
|
中等 |
| 9 |
|
palindrome number |
|
简单 |
| 10 |
|
regular expression matching |
|
困难 |
| 11 |
|
container with most water |
|
中等 |
| 12 |
|
integer to roman |
|
中等 |
| 13 |
|
roman to integer |
|
简单 |
| 14 |
|
longest common prefix |
|
简单 |
| 15 |
|
3sum |
|
中等 |
| 16 |
|
3sum closest |
|
中等 |
| 17 |
|
letter combinations of a phone number |
|
中等 |
| 18 |
|
4sum |
|
中等 |
| 19 |
|
remove nth node from end of list |
|
中等 |
| 20 |
|
valid parentheses |
golang |
简单 |
| 21 |
|
merge two sorted lists |
golang |
简单 |
| 22 |
|
generate parentheses |
|
中等 |
| 23 |
|
merge k sorted lists |
|
困难 |
| 24 |
|
swap nodes in pairs |
|
中等 |
| 25 |
|
reverse nodes in k group |
|
困难 |
| 26 |
|
remove duplicates from sorted array |
golang |
简单 |
| 27 |
|
remove element |
|
简单 |
| 28 |
|
implement strstr |
|
简单 |
| 29 |
|
divide two integers |
|
中等 |
| 30 |
|
substring with concatenation of all words |
|
困难 |
| 31 |
|
next permutation |
|
中等 |
| 32 |
|
longest valid parentheses |
|
困难 |
| 33 |
|
search in rotated sorted array |
|
中等 |
| 34 |
|
find first and last position of element in sorted array |
|
中等 |
| 35 |
|
search insert position |
|
简单 |
| 36 |
|
valid sudoku |
|
中等 |
| 37 |
|
sudoku solver |
|
困难 |
| 38 |
|
count and say |
|
简单 |
| 39 |
|
combination sum |
|
中等 |
| 40 |
|
combination sum ii |
|
中等 |
| 41 |
|
first missing positive |
|
困难 |
| 42 |
|
trapping rain water |
golang |
困难 |
| 43 |
|
multiply strings |
|
中等 |
| 44 |
|
wildcard matching |
|
困难 |
| 45 |
|
jump game ii |
|
困难 |
| 46 |
|
permutations |
|
中等 |
| 47 |
|
permutations ii |
|
中等 |
| 48 |
|
rotate image |
|
中等 |
| 49 |
|
group anagrams |
golang |
中等 |
| 50 |
|
powx n |
|
中等 |
| 51 |
|
n queens |
|
困难 |
| 52 |
|
n queens ii |
|
困难 |
| 53 |
|
maximum subarray |
|
简单 |
| 54 |
|
spiral matrix |
|
中等 |
| 55 |
|
jump game |
|
中等 |
| 56 |
|
merge intervals |
|
中等 |
| 57 |
|
insert interval |
|
困难 |
| 58 |
|
length of last word |
|
简单 |
| 59 |
|
spiral matrix ii |
|
中等 |
| 60 |
|
permutation sequence |
|
中等 |
| 61 |
|
rotate list |
|
中等 |
| 62 |
|
unique paths |
|
中等 |
| 63 |
|
unique paths ii |
|
中等 |
| 64 |
|
minimum path sum |
golang |
中等 |
| 65 |
|
valid number |
|
困难 |
| 66 |
|
plus one |
golang |
简单 |
| 67 |
|
add binary |
|
简单 |
| 68 |
|
text justification |
|
困难 |
| 69 |
|
sqrtx |
|
简单 |
| 70 |
|
climbing stairs |
|
简单 |
| 71 |
|
simplify path |
|
中等 |
| 72 |
|
edit distance |
|
困难 |
| 73 |
|
set matrix zeroes |
|
中等 |
| 74 |
|
search a 2d matrix |
|
中等 |
| 75 |
|
sort colors |
|
中等 |
| 76 |
|
minimum window substring |
|
困难 |
| 77 |
|
combinations |
|
中等 |
| 78 |
|
subsets |
|
中等 |
| 79 |
|
word search |
|
中等 |
| 80 |
|
remove duplicates from sorted array ii |
|
中等 |
| 81 |
|
search in rotated sorted array ii |
|
中等 |
| 82 |
|
remove duplicates from sorted list ii |
|
中等 |
| 83 |
|
remove duplicates from sorted list |
|
简单 |
| 84 |
|
largest rectangle in histogram |
|
困难 |
| 85 |
|
maximal rectangle |
|
困难 |
| 86 |
|
partition list |
|
中等 |
| 87 |
|
scramble string |
|
困难 |
| 88 |
|
merge sorted array |
|
简单 |
| 89 |
|
gray code |
|
中等 |
| 90 |
|
subsets ii |
|
中等 |
| 91 |
|
decode ways |
golang |
中等 |
| 92 |
|
reverse linked list ii |
|
中等 |
| 93 |
|
restore ip addresses |
|
中等 |
| 94 |
|
binary tree inorder traversal |
|
中等 |
| 95 |
|
unique binary search trees ii |
|
中等 |
| 96 |
|
unique binary search trees |
|
中等 |
| 97 |
|
interleaving string |
|
困难 |
| 98 |
|
validate binary search tree |
|
中等 |
| 99 |
|
recover binary search tree |
|
困难 |
| 100 |
|
same tree |
|
简单 |
| 101 |
|
symmetric tree |
|
简单 |
| 102 |
|
binary tree level order traversal |
|
中等 |
| 103 |
|
binary tree zigzag level order traversal |
|
中等 |
| 104 |
|
maximum depth of binary tree |
|
简单 |
| 105 |
|
construct binary tree from preorder and inorder traversal |
|
中等 |
| 106 |
|
construct binary tree from inorder and postorder traversal |
|
中等 |
| 107 |
|
binary tree level order traversal ii |
|
简单 |
| 108 |
|
convert sorted array to binary search tree |
|
简单 |
| 109 |
|
convert sorted list to binary search tree |
|
中等 |
| 110 |
|
balanced binary tree |
|
简单 |
| 111 |
|
minimum depth of binary tree |
|
简单 |
| 112 |
|
path sum |
|
简单 |
| 113 |
|
path sum ii |
|
中等 |
| 114 |
|
flatten binary tree to linked list |
|
中等 |
| 115 |
|
distinct subsequences |
|
困难 |
| 116 |
|
populating next right pointers in each node |
|
中等 |
| 117 |
|
populating next right pointers in each node ii |
|
中等 |
| 118 |
|
pascals triangle |
|
简单 |
| 119 |
|
pascals triangle ii |
|
简单 |
| 120 |
|
triangle |
|
中等 |
| 121 |
|
best time to buy and sell stock |
|
简单 |
| 122 |
|
best time to buy and sell stock ii |
|
简单 |
| 123 |
|
best time to buy and sell stock iii |
|
困难 |
| 124 |
|
binary tree maximum path sum |
|
困难 |
| 125 |
|
valid palindrome |
golang |
简单 |
| 126 |
|
word ladder ii |
|
困难 |
| 127 |
|
word ladder |
|
中等 |
| 128 |
|
longest consecutive sequence |
|
困难 |
| 129 |
|
sum root to leaf numbers |
|
中等 |
| 130 |
|
surrounded regions |
|
中等 |
| 131 |
|
palindrome partitioning |
|
中等 |
| 132 |
|
palindrome partitioning ii |
|
困难 |
| 133 |
|
clone graph |
|
中等 |
| 134 |
|
gas station |
|
中等 |
| 135 |
|
candy |
|
困难 |
| 136 |
|
single number |
|
简单 |
| 137 |
|
single number ii |
|
中等 |
| 138 |
|
copy list with random pointer |
|
中等 |
| 139 |
|
word break |
|
中等 |
| 140 |
|
word break ii |
|
困难 |
| 141 |
|
linked list cycle |
|
简单 |
| 142 |
|
linked list cycle ii |
|
中等 |
| 143 |
|
reorder list |
|
中等 |
| 144 |
|
binary tree preorder traversal |
golang |
中等 |
| 145 |
|
binary tree postorder traversal |
|
困难 |
| 146 |
|
lru cache |
|
中等 |
| 147 |
|
insertion sort list |
|
中等 |
| 148 |
|
sort list |
|
中等 |
| 149 |
|
max points on a line |
|
困难 |
| 150 |
|
evaluate reverse polish notation |
|
中等 |
| 151 |
|
reverse words in a string |
|
中等 |
| 152 |
|
maximum product subarray |
|
中等 |
| 153 |
|
find minimum in rotated sorted array |
|
中等 |
| 154 |
|
find minimum in rotated sorted array ii |
|
困难 |
| 155 |
|
min stack |
|
简单 |
| 156 |
|
binary tree upside down |
|
中等 |
| 157 |
|
read n characters given read4 |
|
简单 |
| 158 |
|
read n characters given read4 ii call multiple times |
|
困难 |
| 159 |
|
longest substring with at most two distinct characters |
|
中等 |
| 160 |
|
intersection of two linked lists |
|
简单 |
| 161 |
|
one edit distance |
|
中等 |
| 162 |
|
find peak element |
|
中等 |
| 163 |
|
missing ranges |
|
中等 |
| 164 |
|
maximum gap |
|
困难 |
| 165 |
|
compare version numbers |
|
中等 |
| 166 |
|
fraction to recurring decimal |
|
中等 |
| 167 |
|
two sum ii input array is sorted |
|
简单 |
| 168 |
|
excel sheet column title |
|
简单 |
| 169 |
|
majority element |
|
简单 |
| 170 |
|
two sum iii data structure design |
|
简单 |
| 171 |
|
excel sheet column number |
|
简单 |
| 172 |
|
factorial trailing zeroes |
|
简单 |
| 173 |
|
binary search tree iterator |
|
中等 |
| 174 |
|
dungeon game |
|
困难 |
| 175 |
|
combine two tables |
|
简单 |
| 176 |
|
second highest salary |
|
简单 |
| 177 |
|
nth highest salary |
|
中等 |
| 178 |
|
rank scores |
|
中等 |
| 179 |
|
largest number |
|
中等 |
| 180 |
|
consecutive numbers |
|
中等 |
| 181 |
|
employees earning more than their managers |
|
简单 |
| 182 |
|
duplicate emails |
|
简单 |
| 183 |
|
customers who never order |
|
简单 |
| 184 |
|
department highest salary |
|
中等 |
| 185 |
|
department top three salaries |
|
困难 |
| 186 |
|
reverse words in a string ii |
|
中等 |
| 187 |
|
repeated dna sequences |
|
中等 |
| 188 |
|
best time to buy and sell stock iv |
|
困难 |
| 189 |
|
rotate array |
|
简单 |
| 190 |
|
reverse bits |
|
简单 |
| 191 |
|
number of 1 bits |
|
简单 |
| 192 |
|
word frequency |
|
中等 |
| 193 |
|
valid phone numbers |
|
简单 |
| 194 |
|
transpose file |
|
中等 |
| 195 |
|
tenth line |
|
简单 |
| 196 |
|
delete duplicate emails |
|
简单 |
| 197 |
|
rising temperature |
|
简单 |
| 198 |
|
house robber |
|
简单 |
| 199 |
|
binary tree right side view |
|
中等 |
| 200 |
|
number of islands |
|
中等 |
| 201 |
|
bitwise and of numbers range |
|
中等 |
| 202 |
|
happy number |
|
简单 |
| 203 |
|
remove linked list elements |
|
简单 |
| 204 |
|
count primes |
|
简单 |
| 205 |
|
isomorphic strings |
|
简单 |
| 206 |
|
reverse linked list |
golang |
简单 |
| 207 |
|
course schedule |
|
中等 |
| 208 |
|
implement trie prefix tree |
|
中等 |
| 209 |
|
minimum size subarray sum |
|
中等 |
| 210 |
|
course schedule ii |
|
中等 |
| 211 |
|
add and search word data structure design |
|
中等 |
| 212 |
|
word search ii |
|
困难 |
| 213 |
|
house robber ii |
|
中等 |
| 214 |
|
shortest palindrome |
|
困难 |
| 215 |
|
kth largest element in an array |
|
中等 |
| 216 |
|
combination sum iii |
|
中等 |
| 217 |
|
contains duplicate |
|
简单 |
| 218 |
|
the skyline problem |
|
困难 |
| 219 |
|
contains duplicate ii |
|
简单 |
| 220 |
|
contains duplicate iii |
|
中等 |
| 221 |
|
maximal square |
|
中等 |
| 222 |
|
count complete tree nodes |
|
中等 |
| 223 |
|
rectangle area |
|
中等 |
| 224 |
|
basic calculator |
|
困难 |
| 225 |
|
implement stack using queues |
|
简单 |
| 226 |
|
invert binary tree |
|
简单 |
| 227 |
|
basic calculator ii |
|
中等 |
| 228 |
|
summary ranges |
|
中等 |
| 229 |
|
majority element ii |
|
中等 |
| 230 |
|
kth smallest element in a bst |
|
中等 |
| 231 |
|
power of two |
|
简单 |
| 232 |
|
implement queue using stacks |
|
简单 |
| 233 |
|
number of digit one |
|
困难 |
| 234 |
|
palindrome linked list |
|
简单 |
| 235 |
|
lowest common ancestor of a binary search tree |
|
简单 |
| 236 |
|
lowest common ancestor of a binary tree |
golang |
中等 |
| 237 |
|
delete node in a linked list |
|
简单 |
| 238 |
|
product of array except self |
|
中等 |
| 239 |
|
sliding window maximum |
golang |
困难 |
| 240 |
|
search a 2d matrix ii |
|
中等 |
| 241 |
|
different ways to add parentheses |
|
中等 |
| 242 |
|
valid anagram |
|
简单 |
| 243 |
|
shortest word distance |
|
简单 |
| 244 |
|
shortest word distance ii |
|
中等 |
| 245 |
|
shortest word distance iii |
|
中等 |
| 246 |
|
strobogrammatic number |
|
简单 |
| 247 |
|
strobogrammatic number ii |
|
中等 |
| 248 |
|
strobogrammatic number iii |
|
困难 |
| 249 |
|
group shifted strings |
|
中等 |
| 250 |
|
count univalue subtrees |
|
中等 |
| 251 |
|
flatten 2d vector |
|
中等 |
| 252 |
|
meeting rooms |
|
简单 |
| 253 |
|
meeting rooms ii |
|
中等 |
| 254 |
|
factor combinations |
|
中等 |
| 255 |
|
verify preorder sequence in binary search tree |
|
中等 |
| 256 |
|
paint house |
|
简单 |
| 257 |
|
binary tree paths |
|
简单 |
| 258 |
|
add digits |
|
简单 |
| 259 |
|
3sum smaller |
|
中等 |
| 260 |
|
single number iii |
|
中等 |
| 261 |
|
graph valid tree |
|
中等 |
| 262 |
|
trips and users |
|
困难 |
| 263 |
|
ugly number |
|
简单 |
| 264 |
|
ugly number ii |
|
中等 |
| 265 |
|
paint house ii |
|
困难 |
| 266 |
|
palindrome permutation |
|
简单 |
| 267 |
|
palindrome permutation ii |
|
中等 |
| 268 |
|
missing number |
|
简单 |
| 269 |
|
alien dictionary |
|
困难 |
| 270 |
|
closest binary search tree value |
|
简单 |
| 271 |
|
encode and decode strings |
|
中等 |
| 272 |
|
closest binary search tree value ii |
|
困难 |
| 273 |
|
integer to english words |
|
困难 |
| 274 |
|
h index |
|
中等 |
| 275 |
|
h index ii |
|
中等 |
| 276 |
|
paint fence |
|
简单 |
| 277 |
|
find the celebrity |
|
中等 |
| 278 |
|
first bad version |
|
简单 |
| 279 |
|
perfect squares |
|
中等 |
| 280 |
|
wiggle sort |
|
中等 |
| 281 |
|
zigzag iterator |
|
中等 |
| 282 |
|
expression add operators |
|
困难 |
| 283 |
|
move zeroes |
golang |
简单 |
| 284 |
|
peeking iterator |
|
中等 |
| 285 |
|
inorder successor in bst |
|
中等 |
| 286 |
|
walls and gates |
|
中等 |
| 287 |
|
find the duplicate number |
|
中等 |
| 288 |
|
unique word abbreviation |
|
中等 |
| 289 |
|
game of life |
|
中等 |
| 290 |
|
word pattern |
|
简单 |
| 291 |
|
word pattern ii |
|
困难 |
| 292 |
|
nim game |
|
简单 |
| 293 |
|
flip game |
|
简单 |
| 294 |
|
flip game ii |
|
中等 |
| 295 |
|
find median from data stream |
|
困难 |
| 296 |
|
best meeting point |
|
困难 |
| 297 |
|
serialize and deserialize binary tree |
|
困难 |
| 298 |
|
binary tree longest consecutive sequence |
|
中等 |
| 299 |
|
bulls and cows |
|
简单 |
| 300 |
|
longest increasing subsequence |
|
中等 |
| 301 |
|
remove invalid parentheses |
|
困难 |
| 302 |
|
smallest rectangle enclosing black pixels |
|
困难 |
| 303 |
|
range sum query immutable |
|
简单 |
| 304 |
|
range sum query 2d immutable |
|
中等 |
| 305 |
|
number of islands ii |
|
困难 |
| 306 |
|
additive number |
|
中等 |
| 307 |
|
range sum query mutable |
|
中等 |
| 308 |
|
range sum query 2d mutable |
|
困难 |
| 309 |
|
best time to buy and sell stock with cooldown |
|
中等 |
| 310 |
|
minimum height trees |
|
中等 |
| 311 |
|
sparse matrix multiplication |
|
中等 |
| 312 |
|
burst balloons |
|
困难 |
| 313 |
|
super ugly number |
|
中等 |
| 314 |
|
binary tree vertical order traversal |
|
中等 |
| 315 |
|
count of smaller numbers after self |
|
困难 |
| 316 |
|
remove duplicate letters |
|
困难 |
| 317 |
|
shortest distance from all buildings |
|
困难 |
| 318 |
|
maximum product of word lengths |
|
中等 |
| 319 |
|
bulb switcher |
|
中等 |
| 320 |
|
generalized abbreviation |
|
中等 |
| 321 |
|
create maximum number |
|
困难 |
| 322 |
|
coin change |
|
中等 |
| 323 |
|
number of connected components in an undirected graph |
|
中等 |
| 324 |
|
wiggle sort ii |
|
中等 |
| 325 |
|
maximum size subarray sum equals k |
|
中等 |
| 326 |
|
power of three |
|
简单 |
| 327 |
|
count of range sum |
|
困难 |
| 328 |
|
odd even linked list |
|
中等 |
| 329 |
|
longest increasing path in a matrix |
|
困难 |
| 330 |
|
patching array |
|
困难 |
| 331 |
|
verify preorder serialization of a binary tree |
|
中等 |
| 332 |
|
reconstruct itinerary |
|
中等 |
| 333 |
|
largest bst subtree |
|
中等 |
| 334 |
|
increasing triplet subsequence |
|
中等 |
| 335 |
|
self crossing |
|
困难 |
| 336 |
|
palindrome pairs |
|
困难 |
| 337 |
|
house robber iii |
|
中等 |
| 338 |
|
counting bits |
|
中等 |
| 339 |
|
nested list weight sum |
|
简单 |
| 340 |
|
longest substring with at most k distinct characters |
|
困难 |
| 341 |
|
flatten nested list iterator |
|
中等 |
| 342 |
|
power of four |
|
简单 |
| 343 |
|
integer break |
|
中等 |
| 344 |
|
reverse string |
|
简单 |
| 345 |
|
reverse vowels of a string |
|
简单 |
| 346 |
|
moving average from data stream |
|
简单 |
| 347 |
|
top k frequent elements |
|
中等 |
| 348 |
|
design tic tac toe |
|
中等 |
| 349 |
|
intersection of two arrays |
|
简单 |
| 350 |
|
intersection of two arrays ii |
|
简单 |
| 351 |
|
android unlock patterns |
|
中等 |
| 352 |
|
data stream as disjoint intervals |
|
困难 |
| 353 |
|
design snake game |
|
中等 |
| 354 |
|
russian doll envelopes |
|
困难 |
| 355 |
|
design twitter |
|
中等 |
| 356 |
|
line reflection |
|
中等 |
| 357 |
|
count numbers with unique digits |
|
中等 |
| 358 |
|
rearrange string k distance apart |
|
困难 |
| 359 |
|
logger rate limiter |
|
简单 |
| 360 |
|
sort transformed array |
|
中等 |
| 361 |
|
bomb enemy |
|
中等 |
| 362 |
|
design hit counter |
|
中等 |
| 363 |
|
max sum of rectangle no larger than k |
|
困难 |
| 364 |
|
nested list weight sum ii |
|
中等 |
| 365 |
|
water and jug problem |
golang |
中等 |
| 366 |
|
find leaves of binary tree |
|
中等 |
| 367 |
|
valid perfect square |
|
简单 |
| 368 |
|
largest divisible subset |
|
中等 |
| 369 |
|
plus one linked list |
|
中等 |
| 370 |
|
range addition |
|
中等 |
| 371 |
|
sum of two integers |
|
简单 |
| 372 |
|
super pow |
|
中等 |
| 373 |
|
find k pairs with smallest sums |
|
中等 |
| 374 |
|
guess number higher or lower |
|
简单 |
| 375 |
|
guess number higher or lower ii |
|
中等 |
| 376 |
|
wiggle subsequence |
|
中等 |
| 377 |
|
combination sum iv |
|
中等 |
| 378 |
|
kth smallest element in a sorted matrix |
|
中等 |
| 379 |
|
design phone directory |
|
中等 |
| 380 |
|
insert delete getrandom o1 |
|
中等 |
| 381 |
|
insert delete getrandom o1 duplicates allowed |
|
困难 |
| 382 |
|
linked list random node |
|
中等 |
| 383 |
|
ransom note |
|
简单 |
| 384 |
|
shuffle an array |
|
中等 |
| 385 |
|
mini parser |
|
中等 |
| 386 |
|
lexicographical numbers |
|
中等 |
| 387 |
|
first unique character in a string |
|
简单 |
| 388 |
|
longest absolute file path |
|
中等 |
| 389 |
|
find the difference |
|
简单 |
| 390 |
|
elimination game |
|
中等 |
| 391 |
|
perfect rectangle |
|
困难 |
| 392 |
|
is subsequence |
|
简单 |
| 393 |
|
utf 8 validation |
|
中等 |
| 394 |
|
decode string |
|
中等 |
| 395 |
|
longest substring with at least k repeating characters |
|
中等 |
| 396 |
|
rotate function |
|
中等 |
| 397 |
|
integer replacement |
|
中等 |
| 398 |
|
random pick index |
|
中等 |
| 399 |
|
evaluate division |
|
中等 |
| 400 |
|
nth digit |
|
中等 |
| 401 |
|
binary watch |
|
简单 |
| 402 |
|
remove k digits |
|
中等 |
| 403 |
|
frog jump |
|
困难 |
| 404 |
|
sum of left leaves |
|
简单 |
| 405 |
|
convert a number to hexadecimal |
|
简单 |
| 406 |
|
queue reconstruction by height |
|
中等 |
| 407 |
|
trapping rain water ii |
|
困难 |
| 408 |
|
valid word abbreviation |
|
简单 |
| 409 |
|
longest palindrome |
golang |
简单 |
| 410 |
|
split array largest sum |
|
困难 |
| 411 |
|
minimum unique word abbreviation |
|
困难 |
| 412 |
|
fizz buzz |
|
简单 |
| 413 |
|
arithmetic slices |
|
中等 |
| 414 |
|
third maximum number |
|
简单 |
| 415 |
|
add strings |
|
简单 |
| 416 |
|
partition equal subset sum |
|
中等 |
| 417 |
|
pacific atlantic water flow |
|
中等 |
| 418 |
|
sentence screen fitting |
|
中等 |
| 419 |
|
battleships in a board |
|
中等 |
| 420 |
|
strong password checker |
|
困难 |
| 421 |
|
maximum xor of two numbers in an array |
|
中等 |
| 422 |
|
valid word square |
|
简单 |
| 423 |
|
reconstruct original digits from english |
|
中等 |
| 424 |
|
longest repeating character replacement |
|
中等 |
| 425 |
|
word squares |
|
困难 |
| 426 |
|
convert binary search tree to sorted doubly linked list |
|
中等 |
| 427 |
|
construct quad tree |
|
中等 |
| 428 |
|
serialize and deserialize n ary tree |
|
困难 |
| 429 |
|
n ary tree level order traversal |
|
中等 |
| 430 |
|
flatten a multilevel doubly linked list |
|
中等 |
| 431 |
|
encode n ary tree to binary tree |
|
困难 |
| 432 |
|
all oone data structure |
|
困难 |
| 433 |
|
minimum genetic mutation |
|
中等 |
| 434 |
|
number of segments in a string |
|
简单 |
| 435 |
|
non overlapping intervals |
|
中等 |
| 436 |
|
find right interval |
|
中等 |
| 437 |
|
path sum iii |
|
简单 |
| 438 |
|
find all anagrams in a string |
|
中等 |
| 439 |
|
ternary expression parser |
|
中等 |
| 440 |
|
k th smallest in lexicographical order |
|
困难 |
| 441 |
|
arranging coins |
|
简单 |
| 442 |
|
find all duplicates in an array |
|
中等 |
| 443 |
|
string compression |
|
简单 |
| 444 |
|
sequence reconstruction |
|
中等 |
| 445 |
|
add two numbers ii |
|
中等 |
| 446 |
|
arithmetic slices ii subsequence |
|
困难 |
| 447 |
|
number of boomerangs |
|
简单 |
| 448 |
|
find all numbers disappeared in an array |
|
简单 |
| 449 |
|
serialize and deserialize bst |
|
中等 |
| 450 |
|
delete node in a bst |
|
中等 |
| 451 |
|
sort characters by frequency |
|
中等 |
| 452 |
|
minimum number of arrows to burst balloons |
|
中等 |
| 453 |
|
minimum moves to equal array elements |
|
简单 |
| 454 |
|
4sum ii |
|
中等 |
| 455 |
|
assign cookies |
golang |
简单 |
| 456 |
|
132 pattern |
|
中等 |
| 457 |
|
circular array loop |
|
中等 |
| 458 |
|
poor pigs |
|
困难 |
| 459 |
|
repeated substring pattern |
|
简单 |
| 460 |
|
lfu cache |
|
困难 |
| 461 |
|
hamming distance |
|
简单 |
| 462 |
|
minimum moves to equal array elements ii |
|
中等 |
| 463 |
|
island perimeter |
|
简单 |
| 464 |
|
can i win |
|
中等 |
| 465 |
|
optimal account balancing |
|
困难 |
| 466 |
|
count the repetitions |
|
困难 |
| 467 |
|
unique substrings in wraparound string |
|
中等 |
| 468 |
|
validate ip address |
|
中等 |
| 469 |
|
convex polygon |
|
中等 |
| 470 |
|
implement rand10 using rand7 |
|
中等 |
| 471 |
|
encode string with shortest length |
|
困难 |
| 472 |
|
concatenated words |
|
困难 |
| 473 |
|
matchsticks to square |
|
中等 |
| 474 |
|
ones and zeroes |
|
中等 |
| 475 |
|
heaters |
|
简单 |
| 476 |
|
number complement |
|
简单 |
| 477 |
|
total hamming distance |
|
中等 |
| 478 |
|
generate random point in a circle |
|
中等 |
| 479 |
|
largest palindrome product |
|
困难 |
| 480 |
|
sliding window median |
|
困难 |
| 481 |
|
magical string |
|
中等 |
| 482 |
|
license key formatting |
|
简单 |
| 483 |
|
smallest good base |
|
困难 |
| 484 |
|
find permutation |
|
中等 |
| 485 |
|
max consecutive ones |
|
简单 |
| 486 |
|
predict the winner |
|
中等 |
| 487 |
|
max consecutive ones ii |
|
中等 |
| 488 |
|
zuma game |
|
困难 |
| 489 |
|
robot room cleaner |
|
困难 |
| 490 |
|
the maze |
|
中等 |
| 491 |
|
increasing subsequences |
|
中等 |
| 492 |
|
construct the rectangle |
|
简单 |
| 493 |
|
reverse pairs |
|
困难 |
| 494 |
|
target sum |
|
中等 |
| 495 |
|
teemo attacking |
|
中等 |
| 496 |
|
next greater element i |
|
简单 |
| 497 |
|
random point in non overlapping rectangles |
|
中等 |
| 498 |
|
diagonal traverse |
|
中等 |
| 499 |
|
the maze iii |
|
困难 |
| 500 |
|
keyboard row |
|
简单 |
| 501 |
|
find mode in binary search tree |
|
简单 |
| 502 |
|
ipo |
|
困难 |
| 503 |
|
next greater element ii |
|
中等 |
| 504 |
|
base 7 |
|
简单 |
| 505 |
|
the maze ii |
|
中等 |
| 506 |
|
relative ranks |
|
简单 |
| 507 |
|
perfect number |
|
简单 |
| 508 |
|
most frequent subtree sum |
|
中等 |
| 509 |
|
fibonacci number |
python |
简单 |
| 510 |
|
inorder successor in bst ii |
|
中等 |
| 511 |
|
game play analysis i |
|
简单 |
| 512 |
|
game play analysis ii |
|
简单 |
| 513 |
|
find bottom left tree value |
|
中等 |
| 514 |
|
freedom trail |
|
困难 |
| 515 |
|
find largest value in each tree row |
|
中等 |
| 516 |
|
longest palindromic subsequence |
|
中等 |
| 517 |
|
super washing machines |
|
困难 |
| 518 |
|
coin change 2 |
|
中等 |
| 519 |
|
random flip matrix |
|
中等 |
| 520 |
|
detect capital |
|
简单 |
| 521 |
|
longest uncommon subsequence i |
|
简单 |
| 522 |
|
longest uncommon subsequence ii |
|
中等 |
| 523 |
|
continuous subarray sum |
|
中等 |
| 524 |
|
longest word in dictionary through deleting |
|
中等 |
| 525 |
|
contiguous array |
|
中等 |
| 526 |
|
beautiful arrangement |
|
中等 |
| 527 |
|
word abbreviation |
|
困难 |
| 528 |
|
random pick with weight |
|
中等 |
| 529 |
|
minesweeper |
|
中等 |
| 530 |
|
minimum absolute difference in bst |
|
简单 |
| 531 |
|
lonely pixel i |
|
中等 |
| 532 |
|
k diff pairs in an array |
|
简单 |
| 533 |
|
lonely pixel ii |
|
中等 |
| 534 |
|
game play analysis iii |
|
中等 |
| 535 |
|
encode and decode tinyurl |
|
中等 |
| 536 |
|
construct binary tree from string |
|
中等 |
| 537 |
|
complex number multiplication |
|
中等 |
| 538 |
|
convert bst to greater tree |
|
简单 |
| 539 |
|
minimum time difference |
|
中等 |
| 540 |
|
single element in a sorted array |
|
中等 |
| 541 |
|
reverse string ii |
|
简单 |
| 542 |
|
01 matrix |
|
中等 |
| 543 |
|
diameter of binary tree |
|
简单 |
| 544 |
|
output contest matches |
|
中等 |
| 545 |
|
boundary of binary tree |
|
中等 |
| 546 |
|
remove boxes |
|
困难 |
| 547 |
|
friend circles |
|
中等 |
| 548 |
|
split array with equal sum |
|
中等 |
| 549 |
|
binary tree longest consecutive sequence ii |
|
中等 |
| 550 |
|
game play analysis iv |
|
中等 |
| 551 |
|
student attendance record i |
|
简单 |
| 552 |
|
student attendance record ii |
|
困难 |
| 553 |
|
optimal division |
|
中等 |
| 554 |
|
brick wall |
|
中等 |
| 555 |
|
split concatenated strings |
|
中等 |
| 556 |
|
next greater element iii |
|
中等 |
| 557 |
|
reverse words in a string iii |
|
简单 |
| 558 |
|
quad tree intersection |
|
简单 |
| 559 |
|
maximum depth of n ary tree |
|
简单 |
| 560 |
|
subarray sum equals k |
|
中等 |
| 561 |
|
array partition i |
|
简单 |
| 562 |
|
longest line of consecutive one in matrix |
|
中等 |
| 563 |
|
binary tree tilt |
|
简单 |
| 564 |
|
find the closest palindrome |
|
困难 |
| 565 |
|
array nesting |
|
中等 |
| 566 |
|
reshape the matrix |
|
简单 |
| 567 |
|
permutation in string |
|
中等 |
| 568 |
|
maximum vacation days |
|
困难 |
| 569 |
|
median employee salary |
|
困难 |
| 570 |
|
managers with at least 5 direct reports |
|
中等 |
| 571 |
|
find median given frequency of numbers |
|
困难 |
| 572 |
|
subtree of another tree |
|
简单 |
| 573 |
|
squirrel simulation |
|
中等 |
| 574 |
|
winning candidate |
|
中等 |
| 575 |
|
distribute candies |
|
简单 |
| 576 |
|
out of boundary paths |
|
中等 |
| 577 |
|
employee bonus |
|
简单 |
| 578 |
|
get highest answer rate question |
|
中等 |
| 579 |
|
find cumulative salary of an employee |
|
困难 |
| 580 |
|
count student number in departments |
|
中等 |
| 581 |
|
shortest unsorted continuous subarray |
|
简单 |
| 582 |
|
kill process |
|
中等 |
| 583 |
|
delete operation for two strings |
|
中等 |
| 584 |
|
find customer referee |
|
简单 |
| 585 |
|
investments in 2016 |
|
中等 |
| 586 |
|
customer placing the largest number of orders |
|
简单 |
| 587 |
|
erect the fence |
|
困难 |
| 588 |
|
design in memory file system |
|
困难 |
| 589 |
|
n ary tree preorder traversal |
golang |
简单 |
| 590 |
|
n ary tree postorder traversal |
golang |
简单 |
| 591 |
|
tag validator |
|
困难 |
| 592 |
|
fraction addition and subtraction |
|
中等 |
| 593 |
|
valid square |
|
中等 |
| 594 |
|
longest harmonious subsequence |
|
简单 |
| 595 |
|
big countries |
|
简单 |
| 596 |
|
classes more than 5 students |
|
简单 |
| 597 |
|
friend requests i overall acceptance rate |
|
简单 |
| 598 |
|
range addition ii |
|
简单 |
| 599 |
|
minimum index sum of two lists |
|
简单 |
| 600 |
|
non negative integers without consecutive ones |
|
困难 |
| 601 |
|
human traffic of stadium |
|
困难 |
| 602 |
|
friend requests ii who has the most friends |
|
中等 |
| 603 |
|
consecutive available seats |
|
简单 |
| 604 |
|
design compressed string iterator |
|
简单 |
| 605 |
|
can place flowers |
|
简单 |
| 606 |
|
construct string from binary tree |
|
简单 |
| 607 |
|
sales person |
|
简单 |
| 608 |
|
tree node |
|
中等 |
| 609 |
|
find duplicate file in system |
|
中等 |
| 610 |
|
triangle judgement |
|
简单 |
| 611 |
|
valid triangle number |
|
中等 |
| 612 |
|
shortest distance in a plane |
|
中等 |
| 613 |
|
shortest distance in a line |
|
简单 |
| 614 |
|
second degree follower |
|
中等 |
| 615 |
|
average salary departments vs company |
|
困难 |
| 616 |
|
add bold tag in string |
|
中等 |
| 617 |
|
merge two binary trees |
|
简单 |
| 618 |
|
students report by geography |
|
困难 |
| 619 |
|
biggest single number |
|
简单 |
| 620 |
|
not boring movies |
|
简单 |
| 621 |
|
task scheduler |
|
中等 |
| 622 |
|
design circular queue |
|
中等 |
| 623 |
|
add one row to tree |
|
中等 |
| 624 |
|
maximum distance in arrays |
|
简单 |
| 625 |
|
minimum factorization |
|
中等 |
| 626 |
|
exchange seats |
|
中等 |
| 627 |
|
swap salary |
|
简单 |
| 628 |
|
maximum product of three numbers |
|
简单 |
| 629 |
|
k inverse pairs array |
|
困难 |
| 630 |
|
course schedule iii |
|
困难 |
| 631 |
|
design excel sum formula |
|
困难 |
| 632 |
|
smallest range covering elements from k lists |
|
困难 |
| 633 |
|
sum of square numbers |
|
简单 |
| 634 |
|
find the derangement of an array |
|
中等 |
| 635 |
|
design log storage system |
|
中等 |
| 636 |
|
exclusive time of functions |
|
中等 |
| 637 |
|
average of levels in binary tree |
|
简单 |
| 638 |
|
shopping offers |
|
中等 |
| 639 |
|
decode ways ii |
|
困难 |
| 640 |
|
solve the equation |
|
中等 |
| 641 |
|
design circular deque |
|
中等 |
| 642 |
|
design search autocomplete system |
|
困难 |
| 643 |
|
maximum average subarray i |
|
简单 |
| 644 |
|
maximum average subarray ii |
|
困难 |
| 645 |
|
set mismatch |
|
简单 |
| 646 |
|
maximum length of pair chain |
|
中等 |
| 647 |
|
palindromic substrings |
|
中等 |
| 648 |
|
replace words |
|
中等 |
| 649 |
|
dota2 senate |
|
中等 |
| 650 |
|
2 keys keyboard |
|
中等 |
| 651 |
|
4 keys keyboard |
|
中等 |
| 652 |
|
find duplicate subtrees |
|
中等 |
| 653 |
|
two sum iv input is a bst |
|
简单 |
| 654 |
|
maximum binary tree |
|
中等 |
| 655 |
|
print binary tree |
|
中等 |
| 656 |
|
coin path |
|
困难 |
| 657 |
|
robot return to origin |
|
简单 |
| 658 |
|
find k closest elements |
|
中等 |
| 659 |
|
split array into consecutive subsequences |
|
中等 |
| 660 |
|
remove 9 |
|
困难 |
| 661 |
|
image smoother |
|
简单 |
| 662 |
|
maximum width of binary tree |
|
中等 |
| 663 |
|
equal tree partition |
|
中等 |
| 664 |
|
strange printer |
|
困难 |
| 665 |
|
non decreasing array |
|
简单 |
| 666 |
|
path sum iv |
|
中等 |
| 667 |
|
beautiful arrangement ii |
|
中等 |
| 668 |
|
kth smallest number in multiplication table |
|
困难 |
| 669 |
|
trim a binary search tree |
|
简单 |
| 670 |
|
maximum swap |
|
中等 |
| 671 |
|
second minimum node in a binary tree |
|
简单 |
| 672 |
|
bulb switcher ii |
|
中等 |
| 673 |
|
number of longest increasing subsequence |
|
中等 |
| 674 |
|
longest continuous increasing subsequence |
|
简单 |
| 675 |
|
cut off trees for golf event |
|
困难 |
| 676 |
|
implement magic dictionary |
|
中等 |
| 677 |
|
map sum pairs |
|
中等 |
| 678 |
|
valid parenthesis string |
|
中等 |
| 679 |
|
24 game |
|
困难 |
| 680 |
|
valid palindrome ii |
|
简单 |
| 681 |
|
next closest time |
|
中等 |
| 682 |
|
baseball game |
|
简单 |
| 683 |
|
k empty slots |
|
困难 |
| 684 |
|
redundant connection |
|
中等 |
| 685 |
|
redundant connection ii |
|
困难 |
| 686 |
|
repeated string match |
|
简单 |
| 687 |
|
longest univalue path |
|
简单 |
| 688 |
|
knight probability in chessboard |
|
中等 |
| 689 |
|
maximum sum of 3 non overlapping subarrays |
|
困难 |
| 690 |
|
employee importance |
|
简单 |
| 691 |
|
stickers to spell word |
|
困难 |
| 692 |
|
top k frequent words |
|
中等 |
| 693 |
|
binary number with alternating bits |
|
简单 |
| 694 |
|
number of distinct islands |
|
中等 |
| 695 |
|
max area of island |
|
中等 |
| 696 |
|
count binary substrings |
|
简单 |
| 697 |
|
degree of an array |
|
简单 |
| 698 |
|
partition to k equal sum subsets |
|
中等 |
| 699 |
|
falling squares |
|
困难 |
| 700 |
|
search in a binary search tree |
|
简单 |
| 701 |
|
insert into a binary search tree |
|
中等 |
| 702 |
|
search in a sorted array of unknown size |
|
中等 |
| 703 |
|
kth largest element in a stream |
|
简单 |
| 704 |
|
binary search |
|
简单 |
| 705 |
|
design hashset |
|
简单 |
| 706 |
|
design hashmap |
|
简单 |
| 707 |
|
design linked list |
|
中等 |
| 708 |
|
insert into a sorted circular linked list |
|
中等 |
| 709 |
|
to lower case |
|
简单 |
| 710 |
|
random pick with blacklist |
|
困难 |
| 711 |
|
number of distinct islands ii |
|
困难 |
| 712 |
|
minimum ascii delete sum for two strings |
|
中等 |
| 713 |
|
subarray product less than k |
|
中等 |
| 714 |
|
best time to buy and sell stock with transaction fee |
|
中等 |
| 715 |
|
range module |
|
困难 |
| 716 |
|
max stack |
|
简单 |
| 717 |
|
1 bit and 2 bit characters |
|
简单 |
| 718 |
|
maximum length of repeated subarray |
|
中等 |
| 719 |
|
find k th smallest pair distance |
|
困难 |
| 720 |
|
longest word in dictionary |
|
简单 |
| 721 |
|
accounts merge |
|
中等 |
| 722 |
|
remove comments |
|
中等 |
| 723 |
|
candy crush |
|
中等 |
| 724 |
|
find pivot index |
golang |
简单 |
| 725 |
|
split linked list in parts |
|
中等 |
| 726 |
|
number of atoms |
|
困难 |
| 727 |
|
minimum window subsequence |
|
困难 |
| 728 |
|
self dividing numbers |
|
简单 |
| 729 |
|
my calendar i |
|
中等 |
| 730 |
|
count different palindromic subsequences |
|
困难 |
| 731 |
|
my calendar ii |
|
中等 |
| 732 |
|
my calendar iii |
|
困难 |
| 733 |
|
flood fill |
|
简单 |
| 734 |
|
sentence similarity |
|
简单 |
| 735 |
|
asteroid collision |
|
中等 |
| 736 |
|
parse lisp expression |
|
困难 |
| 737 |
|
sentence similarity ii |
|
中等 |
| 738 |
|
monotone increasing digits |
|
中等 |
| 739 |
|
daily temperatures |
|
中等 |
| 740 |
|
delete and earn |
|
中等 |
| 741 |
|
cherry pickup |
|
困难 |
| 742 |
|
closest leaf in a binary tree |
|
中等 |
| 743 |
|
network delay time |
|
中等 |
| 744 |
|
find smallest letter greater than target |
|
简单 |
| 745 |
|
prefix and suffix search |
|
困难 |
| 746 |
|
min cost climbing stairs |
|
简单 |
| 747 |
|
largest number at least twice of others |
golang |
简单 |
| 748 |
|
shortest completing word |
|
简单 |
| 749 |
|
contain virus |
|
困难 |
| 750 |
|
number of corner rectangles |
|
中等 |
| 751 |
|
ip to cidr |
|
简单 |
| 752 |
|
open the lock |
|
中等 |
| 753 |
|
cracking the safe |
|
困难 |
| 754 |
|
reach a number |
|
简单 |
| 755 |
|
pour water |
|
中等 |
| 756 |
|
pyramid transition matrix |
|
中等 |
| 757 |
|
set intersection size at least two |
|
困难 |
| 758 |
|
bold words in string |
|
简单 |
| 759 |
|
employee free time |
|
困难 |
| 760 |
|
find anagram mappings |
|
简单 |
| 761 |
|
special binary string |
|
困难 |
| 762 |
|
prime number of set bits in binary representation |
|
简单 |
| 763 |
|
partition labels |
|
中等 |
| 764 |
|
largest plus sign |
|
中等 |
| 765 |
|
couples holding hands |
|
困难 |
| 766 |
|
toeplitz matrix |
|
简单 |
| 767 |
|
reorganize string |
|
中等 |
| 768 |
|
max chunks to make sorted ii |
|
困难 |
| 769 |
|
max chunks to make sorted |
|
中等 |
| 770 |
|
basic calculator iv |
|
困难 |
| 771 |
|
jewels and stones |
|
简单 |
| 772 |
|
basic calculator iii |
|
困难 |
| 773 |
|
sliding puzzle |
|
困难 |
| 774 |
|
minimize max distance to gas station |
|
困难 |
| 775 |
|
global and local inversions |
|
中等 |
| 776 |
|
split bst |
|
中等 |
| 777 |
|
swap adjacent in lr string |
|
中等 |
| 778 |
|
swim in rising water |
|
困难 |
| 779 |
|
k th symbol in grammar |
|
中等 |
| 780 |
|
reaching points |
|
困难 |
| 781 |
|
rabbits in forest |
|
中等 |
| 782 |
|
transform to chessboard |
|
困难 |
| 783 |
|
minimum distance between bst nodes |
|
简单 |
| 784 |
|
letter case permutation |
|
简单 |
| 785 |
|
is graph bipartite |
|
中等 |
| 786 |
|
k th smallest prime fraction |
|
困难 |
| 787 |
|
cheapest flights within k stops |
|
中等 |
| 788 |
|
rotated digits |
|
简单 |
| 789 |
|
escape the ghosts |
|
中等 |
| 790 |
|
domino and tromino tiling |
|
中等 |
| 791 |
|
custom sort string |
|
中等 |
| 792 |
|
number of matching subsequences |
|
中等 |
| 793 |
|
preimage size of factorial zeroes function |
|
困难 |
| 794 |
|
valid tic tac toe state |
|
中等 |
| 795 |
|
number of subarrays with bounded maximum |
|
中等 |
| 796 |
|
rotate string |
|
简单 |
| 797 |
|
all paths from source to target |
|
中等 |
| 798 |
|
smallest rotation with highest score |
|
困难 |
| 799 |
|
champagne tower |
|
中等 |
| 800 |
|
similar rgb color |
|
简单 |
| 801 |
|
minimum swaps to make sequences increasing |
|
中等 |
| 802 |
|
find eventual safe states |
|
中等 |
| 803 |
|
bricks falling when hit |
|
困难 |
| 804 |
|
unique morse code words |
|
简单 |
| 805 |
|
split array with same average |
|
困难 |
| 806 |
|
number of lines to write string |
|
简单 |
| 807 |
|
max increase to keep city skyline |
|
中等 |
| 808 |
|
soup servings |
|
中等 |
| 809 |
|
expressive words |
|
中等 |
| 810 |
|
chalkboard xor game |
|
困难 |
| 811 |
|
subdomain visit count |
|
简单 |
| 812 |
|
largest triangle area |
|
简单 |
| 813 |
|
largest sum of averages |
|
中等 |
| 814 |
|
binary tree pruning |
|
中等 |
| 815 |
|
bus routes |
|
困难 |
| 816 |
|
ambiguous coordinates |
|
中等 |
| 817 |
|
linked list components |
|
中等 |
| 818 |
|
race car |
|
困难 |
| 819 |
|
most common word |
|
简单 |
| 820 |
|
short encoding of words |
|
中等 |
| 821 |
|
shortest distance to a character |
|
简单 |
| 822 |
|
card flipping game |
|
中等 |
| 823 |
|
binary trees with factors |
|
中等 |
| 824 |
|
goat latin |
|
简单 |
| 825 |
|
friends of appropriate ages |
|
中等 |
| 826 |
|
most profit assigning work |
|
中等 |
| 827 |
|
making a large island |
|
困难 |
| 828 |
|
unique letter string |
|
困难 |
| 829 |
|
consecutive numbers sum |
|
困难 |
| 830 |
|
positions of large groups |
|
简单 |
| 831 |
|
masking personal information |
|
中等 |
| 832 |
|
flipping an image |
|
简单 |
| 833 |
|
find and replace in string |
|
中等 |
| 834 |
|
sum of distances in tree |
|
困难 |
| 835 |
|
image overlap |
|
中等 |
| 836 |
|
rectangle overlap |
golang |
简单 |
| 837 |
|
new 21 game |
|
中等 |
| 838 |
|
push dominoes |
|
中等 |
| 839 |
|
similar string groups |
|
困难 |
| 840 |
|
magic squares in grid |
|
简单 |
| 841 |
|
keys and rooms |
|
中等 |
| 842 |
|
split array into fibonacci sequence |
|
中等 |
| 843 |
|
guess the word |
|
困难 |
| 844 |
|
backspace string compare |
|
简单 |
| 845 |
|
longest mountain in array |
|
中等 |
| 846 |
|
hand of straights |
|
中等 |
| 847 |
|
shortest path visiting all nodes |
|
困难 |
| 848 |
|
shifting letters |
|
中等 |
| 849 |
|
maximize distance to closest person |
|
简单 |
| 850 |
|
rectangle area ii |
|
困难 |
| 851 |
|
loud and rich |
|
中等 |
| 852 |
|
peak index in a mountain array |
|
简单 |
| 853 |
|
car fleet |
|
中等 |
| 854 |
|
k similar strings |
|
困难 |
| 855 |
|
exam room |
|
中等 |
| 856 |
|
score of parentheses |
|
中等 |
| 857 |
|
minimum cost to hire k workers |
|
困难 |
| 858 |
|
mirror reflection |
|
中等 |
| 859 |
|
buddy strings |
|
简单 |
| 860 |
|
lemonade change |
golang |
简单 |
| 861 |
|
score after flipping matrix |
|
中等 |
| 862 |
|
shortest subarray with sum at least k |
|
困难 |
| 863 |
|
all nodes distance k in binary tree |
|
中等 |
| 864 |
|
shortest path to get all keys |
|
困难 |
| 865 |
|
smallest subtree with all the deepest nodes |
|
中等 |
| 866 |
|
prime palindrome |
|
中等 |
| 867 |
|
transpose matrix |
|
简单 |
| 868 |
|
binary gap |
|
简单 |
| 869 |
|
reordered power of 2 |
|
中等 |
| 870 |
|
advantage shuffle |
|
中等 |
| 871 |
|
minimum number of refueling stops |
|
困难 |
| 872 |
|
leaf similar trees |
|
简单 |
| 873 |
|
length of longest fibonacci subsequence |
|
中等 |
| 874 |
|
walking robot simulation |
|
简单 |
| 875 |
|
koko eating bananas |
|
中等 |
| 876 |
|
middle of the linked list |
golang |
简单 |
| 877 |
|
stone game |
|
中等 |
| 878 |
|
nth magical number |
|
困难 |
| 879 |
|
profitable schemes |
|
困难 |
| 880 |
|
decoded string at index |
|
中等 |
| 881 |
|
boats to save people |
|
中等 |
| 882 |
|
reachable nodes in subdivided graph |
|
困难 |
| 883 |
|
projection area of 3d shapes |
|
简单 |
| 884 |
|
uncommon words from two sentences |
|
简单 |
| 885 |
|
spiral matrix iii |
|
中等 |
| 886 |
|
possible bipartition |
|
中等 |
| 887 |
|
super egg drop |
|
困难 |
| 888 |
|
fair candy swap |
|
简单 |
| 889 |
|
construct binary tree from preorder and postorder traversal |
|
中等 |
| 890 |
|
find and replace pattern |
|
中等 |
| 891 |
|
sum of subsequence widths |
|
困难 |
| 892 |
|
surface area of 3d shapes |
golang |
简单 |
| 893 |
|
groups of special equivalent strings |
|
简单 |
| 894 |
|
all possible full binary trees |
|
中等 |
| 895 |
|
maximum frequency stack |
|
困难 |
| 896 |
|
monotonic array |
|
简单 |
| 897 |
|
increasing order search tree |
|
简单 |
| 898 |
|
bitwise ors of subarrays |
|
中等 |
| 899 |
|
orderly queue |
|
困难 |
| 900 |
|
rle iterator |
|
中等 |
| 901 |
|
online stock span |
|
中等 |
| 902 |
|
numbers at most n given digit set |
|
困难 |
| 903 |
|
valid permutations for di sequence |
|
困难 |
| 904 |
|
fruit into baskets |
|
中等 |
| 905 |
|
sort array by parity |
|
简单 |
| 906 |
|
super palindromes |
|
困难 |
| 907 |
|
sum of subarray minimums |
|
中等 |
| 908 |
|
smallest range i |
|
简单 |
| 909 |
|
snakes and ladders |
|
中等 |
| 910 |
|
smallest range ii |
|
中等 |
| 911 |
|
online election |
|
中等 |
| 912 |
|
sort an array |
|
中等 |
| 913 |
|
cat and mouse |
|
困难 |
| 914 |
|
x of a kind in a deck of cards |
golang |
简单 |
| 915 |
|
partition array into disjoint intervals |
|
中等 |
| 916 |
|
word subsets |
|
中等 |
| 917 |
|
reverse only letters |
|
简单 |
| 918 |
|
maximum sum circular subarray |
|
中等 |
| 919 |
|
complete binary tree inserter |
|
中等 |
| 920 |
|
number of music playlists |
|
困难 |
| 921 |
|
minimum add to make parentheses valid |
|
中等 |
| 922 |
|
sort array by parity ii |
|
简单 |
| 923 |
|
3sum with multiplicity |
|
中等 |
| 924 |
|
minimize malware spread |
|
困难 |
| 925 |
|
long pressed name |
|
简单 |
| 926 |
|
flip string to monotone increasing |
|
中等 |
| 927 |
|
three equal parts |
|
困难 |
| 928 |
|
minimize malware spread ii |
|
困难 |
| 929 |
|
unique email addresses |
|
简单 |
| 930 |
|
binary subarrays with sum |
|
中等 |
| 931 |
|
minimum falling path sum |
|
中等 |
| 932 |
|
beautiful array |
|
中等 |
| 933 |
|
number of recent calls |
|
简单 |
| 934 |
|
shortest bridge |
|
中等 |
| 935 |
|
knight dialer |
|
中等 |
| 936 |
|
stamping the sequence |
|
困难 |
| 937 |
|
reorder data in log files |
|
简单 |
| 938 |
|
range sum of bst |
|
简单 |
| 939 |
|
minimum area rectangle |
|
中等 |
| 940 |
|
distinct subsequences ii |
|
困难 |
| 941 |
|
valid mountain array |
|
简单 |
| 942 |
|
di string match |
|
简单 |
| 943 |
|
find the shortest superstring |
|
困难 |
| 944 |
|
delete columns to make sorted |
|
简单 |
| 945 |
|
minimum increment to make array unique |
|
中等 |
| 946 |
|
validate stack sequences |
|
中等 |
| 947 |
|
most stones removed with same row or column |
|
中等 |
| 948 |
|
bag of tokens |
|
中等 |
| 949 |
|
largest time for given digits |
|
简单 |
| 950 |
|
reveal cards in increasing order |
|
中等 |
| 951 |
|
flip equivalent binary trees |
|
中等 |
| 952 |
|
largest component size by common factor |
|
困难 |
| 953 |
|
verifying an alien dictionary |
|
简单 |
| 954 |
|
array of doubled pairs |
|
中等 |
| 955 |
|
delete columns to make sorted ii |
|
中等 |
| 956 |
|
tallest billboard |
|
困难 |
| 957 |
|
prison cells after n days |
|
中等 |
| 958 |
|
check completeness of a binary tree |
|
中等 |
| 959 |
|
regions cut by slashes |
|
中等 |
| 960 |
|
delete columns to make sorted iii |
|
困难 |
| 961 |
|
n repeated element in size 2n array |
|
简单 |
| 962 |
|
maximum width ramp |
|
中等 |
| 963 |
|
minimum area rectangle ii |
|
中等 |
| 964 |
|
least operators to express number |
|
困难 |
| 965 |
|
univalued binary tree |
|
简单 |
| 966 |
|
vowel spellchecker |
|
中等 |
| 967 |
|
numbers with same consecutive differences |
|
中等 |
| 968 |
|
binary tree cameras |
|
困难 |
| 969 |
|
pancake sorting |
|
中等 |
| 970 |
|
powerful integers |
|
简单 |
| 971 |
|
flip binary tree to match preorder traversal |
|
中等 |
| 972 |
|
equal rational numbers |
|
困难 |
| 973 |
|
k closest points to origin |
|
中等 |
| 974 |
|
subarray sums divisible by k |
|
中等 |
| 975 |
|
odd even jump |
|
困难 |
| 976 |
|
largest perimeter triangle |
|
简单 |
| 977 |
|
squares of a sorted array |
|
简单 |
| 978 |
|
longest turbulent subarray |
|
中等 |
| 979 |
|
distribute coins in binary tree |
|
中等 |
| 980 |
|
unique paths iii |
|
困难 |
| 981 |
|
time based key value store |
|
中等 |
| 982 |
|
triples with bitwise and equal to zero |
|
困难 |
| 983 |
|
minimum cost for tickets |
|
中等 |
| 984 |
|
string without aaa or bbb |
|
中等 |
| 985 |
|
sum of even numbers after queries |
|
简单 |
| 986 |
|
interval list intersections |
|
中等 |
| 987 |
|
vertical order traversal of a binary tree |
|
中等 |
| 988 |
|
smallest string starting from leaf |
|
中等 |
| 989 |
|
add to array form of integer |
|
简单 |
| 990 |
|
satisfiability of equality equations |
|
中等 |
| 991 |
|
broken calculator |
|
中等 |
| 992 |
|
subarrays with k different integers |
|
困难 |
| 993 |
|
cousins in binary tree |
|
简单 |
| 994 |
|
rotting oranges |
|
简单 |
| 995 |
|
minimum number of k consecutive bit flips |
|
困难 |
| 996 |
|
number of squareful arrays |
|
困难 |
| 997 |
|
find the town judge |
|
简单 |
| 998 |
|
maximum binary tree ii |
|
中等 |
| 999 |
|
available captures for rook |
|
简单 |
| 1000 |
|
minimum cost to merge stones |
|
困难 |
| 1001 |
|
grid illumination |
|
困难 |
| 1002 |
|
find common characters |
|
简单 |
| 1003 |
|
check if word is valid after substitutions |
|
中等 |
| 1004 |
|
max consecutive ones iii |
|
中等 |
| 1005 |
|
maximize sum of array after k negations |
|
简单 |
| 1006 |
|
clumsy factorial |
|
中等 |
| 1007 |
|
minimum domino rotations for equal row |
|
中等 |
| 1008 |
|
construct binary search tree from preorder traversal |
|
中等 |
| 1009 |
|
complement of base 10 integer |
|
简单 |
| 1010 |
|
pairs of songs with total durations divisible by 60 |
|
简单 |
| 1011 |
|
capacity to ship packages within d days |
|
中等 |
| 1012 |
|
numbers with repeated digits |
|
困难 |
| 1013 |
|
partition array into three parts with equal sum |
|
简单 |
| 1014 |
|
best sightseeing pair |
|
中等 |
| 1015 |
|
smallest integer divisible by k |
|
中等 |
| 1016 |
|
binary string with substrings representing 1 to n |
|
中等 |
| 1017 |
|
convert to base 2 |
|
中等 |
| 1018 |
|
binary prefix divisible by 5 |
|
简单 |
| 1019 |
|
next greater node in linked list |
|
中等 |
| 1020 |
|
number of enclaves |
|
中等 |
| 1021 |
|
remove outermost parentheses |
|
简单 |
| 1022 |
|
sum of root to leaf binary numbers |
|
简单 |
| 1023 |
|
camelcase matching |
|
中等 |
| 1024 |
|
video stitching |
|
中等 |
| 1025 |
|
divisor game |
|
简单 |
| 1026 |
|
maximum difference between node and ancestor |
|
中等 |
| 1027 |
|
longest arithmetic sequence |
|
中等 |
| 1028 |
|
recover a tree from preorder traversal |
|
困难 |
| 1029 |
|
two city scheduling |
|
简单 |
| 1030 |
|
matrix cells in distance order |
|
简单 |
| 1031 |
|
maximum sum of two non overlapping subarrays |
|
中等 |
| 1032 |
|
stream of characters |
|
困难 |
| 1033 |
|
moving stones until consecutive |
|
简单 |
| 1034 |
|
coloring a border |
|
中等 |
| 1035 |
|
uncrossed lines |
|
中等 |
| 1036 |
|
escape a large maze |
|
困难 |
| 1037 |
|
valid boomerang |
|
简单 |
| 1038 |
|
binary search tree to greater sum tree |
|
中等 |
| 1039 |
|
minimum score triangulation of polygon |
|
中等 |
| 1040 |
|
moving stones until consecutive ii |
|
中等 |
| 1041 |
|
robot bounded in circle |
|
中等 |
| 1042 |
|
flower planting with no adjacent |
|
简单 |
| 1043 |
|
partition array for maximum sum |
|
中等 |
| 1044 |
|
longest duplicate substring |
|
困难 |
| 1045 |
|
customers who bought all products |
|
中等 |
| 1046 |
|
last stone weight |
|
简单 |
| 1047 |
|
remove all adjacent duplicates in string |
|
简单 |
| 1048 |
|
longest string chain |
|
中等 |
| 1049 |
|
last stone weight ii |
|
中等 |
| 1050 |
|
actors and directors who cooperated at least three times |
|
简单 |
| 1051 |
|
height checker |
|
简单 |
| 1052 |
|
grumpy bookstore owner |
|
中等 |
| 1053 |
|
previous permutation with one swap |
|
中等 |
| 1054 |
|
distant barcodes |
|
中等 |
| 1055 |
|
shortest way to form string |
|
中等 |
| 1056 |
|
confusing number |
|
简单 |
| 1057 |
|
campus bikes |
|
中等 |
| 1058 |
|
minimize rounding error to meet target |
|
中等 |
| 1059 |
|
all paths from source lead to destination |
|
中等 |
| 1060 |
|
missing element in sorted array |
|
中等 |
| 1061 |
|
lexicographically smallest equivalent string |
|
中等 |
| 1062 |
|
longest repeating substring |
|
中等 |
| 1063 |
|
number of valid subarrays |
|
困难 |
| 1064 |
|
fixed point |
|
简单 |
| 1065 |
|
index pairs of a string |
|
简单 |
| 1066 |
|
campus bikes ii |
|
中等 |
| 1067 |
|
digit count in range |
|
困难 |
| 1068 |
|
product sales analysis i |
|
简单 |
| 1069 |
|
product sales analysis ii |
|
简单 |
| 1070 |
|
product sales analysis iii |
|
中等 |
| 1071 |
|
greatest common divisor of strings |
|
简单 |
| 1072 |
|
flip columns for maximum number of equal rows |
|
中等 |
| 1073 |
|
adding two negabinary numbers |
|
中等 |
| 1074 |
|
number of submatrices that sum to target |
|
困难 |
| 1075 |
|
project employees i |
|
简单 |
| 1076 |
|
project employees ii |
|
简单 |
| 1077 |
|
project employees iii |
|
中等 |
| 1078 |
|
occurrences after bigram |
|
简单 |
| 1079 |
|
letter tile possibilities |
|
中等 |
| 1080 |
|
insufficient nodes in root to leaf paths |
|
中等 |
| 1081 |
|
smallest subsequence of distinct characters |
|
中等 |
| 1082 |
|
sales analysis i |
|
简单 |
| 1083 |
|
sales analysis ii |
|
简单 |
| 1084 |
|
sales analysis iii |
|
简单 |
| 1085 |
|
sum of digits in the minimum number |
|
简单 |
| 1086 |
|
high five |
|
简单 |
| 1087 |
|
brace expansion |
|
中等 |
| 1088 |
|
confusing number ii |
|
困难 |
| 1089 |
|
duplicate zeros |
|
简单 |
| 1090 |
|
largest values from labels |
|
中等 |
| 1091 |
|
shortest path in binary matrix |
|
中等 |
| 1092 |
|
shortest common supersequence |
|
困难 |
| 1093 |
|
statistics from a large sample |
|
中等 |
| 1094 |
|
car pooling |
|
中等 |
| 1095 |
|
find in mountain array |
|
困难 |
| 1096 |
|
brace expansion ii |
|
困难 |
| 1097 |
|
game play analysis v |
|
困难 |
| 1098 |
|
unpopular books |
|
中等 |
| 1099 |
|
two sum less than k |
|
简单 |
| 1100 |
|
find k length substrings with no repeated characters |
|
中等 |
| 1101 |
|
the earliest moment when everyone become friends |
|
中等 |
| 1102 |
|
path with maximum minimum value |
|
中等 |
| 1103 |
|
distribute candies to people |
|
简单 |
| 1104 |
|
path in zigzag labelled binary tree |
|
中等 |
| 1105 |
|
filling bookcase shelves |
|
中等 |
| 1106 |
|
parsing a boolean expression |
|
困难 |
| 1107 |
|
new users daily count |
|
中等 |
| 1108 |
|
defanging an ip address |
|
简单 |
| 1109 |
|
corporate flight bookings |
|
中等 |
| 1110 |
|
delete nodes and return forest |
|
中等 |
| 1111 |
|
maximum nesting depth of two valid parentheses strings |
golang |
中等 |
| 1112 |
|
highest grade for each student |
|
中等 |
| 1113 |
|
reported posts |
|
简单 |
| 1114 |
|
print in order |
|
简单 |
| 1115 |
|
print foobar alternately |
|
中等 |
| 1116 |
|
print zero even odd |
|
中等 |
| 1117 |
|
building h2o |
|
中等 |
| 1118 |
|
number of days in a month |
|
简单 |
| 1119 |
|
remove vowels from a string |
|
简单 |
| 1120 |
|
maximum average subtree |
|
中等 |
| 1121 |
|
divide array into increasing sequences |
|
困难 |
| 1122 |
|
relative sort array |
|
简单 |
| 1123 |
|
lowest common ancestor of deepest leaves |
|
中等 |
| 1124 |
|
longest well performing interval |
|
中等 |
| 1125 |
|
smallest sufficient team |
|
困难 |
| 1126 |
|
active businesses |
|
中等 |
| 1127 |
|
user purchase platform |
|
困难 |
| 1128 |
|
number of equivalent domino pairs |
|
简单 |
| 1129 |
|
shortest path with alternating colors |
|
中等 |
| 1130 |
|
minimum cost tree from leaf values |
|
中等 |
| 1131 |
|
maximum of absolute value expression |
|
中等 |
| 1132 |
|
reported posts ii |
|
中等 |
| 1133 |
|
largest unique number |
|
简单 |
| 1134 |
|
armstrong number |
|
简单 |
| 1135 |
|
connecting cities with minimum cost |
|
中等 |
| 1136 |
|
parallel courses |
|
困难 |
| 1137 |
|
n th tribonacci number |
|
简单 |
| 1138 |
|
alphabet board path |
|
中等 |
| 1139 |
|
largest 1 bordered square |
|
中等 |
| 1140 |
|
stone game ii |
|
中等 |
| 1141 |
|
user activity for the past 30 days i |
|
简单 |
| 1142 |
|
user activity for the past 30 days ii |
|
简单 |
| 1143 |
|
longest common subsequence |
|
中等 |
| 1144 |
|
decrease elements to make array zigzag |
|
中等 |
| 1145 |
|
binary tree coloring game |
|
中等 |
| 1146 |
|
snapshot array |
|
中等 |
| 1147 |
|
longest chunked palindrome decomposition |
|
困难 |
| 1148 |
|
article views i |
|
简单 |
| 1149 |
|
article views ii |
|
中等 |
| 1150 |
|
check if a number is majority element in a sorted array |
|
简单 |
| 1151 |
|
minimum swaps to group all 1s together |
|
中等 |
| 1152 |
|
analyze user website visit pattern |
|
中等 |
| 1153 |
|
string transforms into another string |
|
困难 |
| 1154 |
|
day of the year |
|
简单 |
| 1155 |
|
number of dice rolls with target sum |
|
中等 |
| 1156 |
|
swap for longest repeated character substring |
|
中等 |
| 1157 |
|
online majority element in subarray |
|
困难 |
| 1158 |
|
market analysis i |
|
中等 |
| 1159 |
|
market analysis ii |
|
困难 |
| 1160 |
|
find words that can be formed by characters |
golang |
简单 |
| 1161 |
|
maximum level sum of a binary tree |
|
中等 |
| 1162 |
|
as far from land as possible |
|
中等 |
| 1163 |
|
last substring in lexicographical order |
|
困难 |
| 1164 |
|
product price at a given date |
|
中等 |
| 1165 |
|
single row keyboard |
|
简单 |
| 1166 |
|
design file system |
|
中等 |
| 1167 |
|
minimum cost to connect sticks |
|
中等 |
| 1168 |
|
optimize water distribution in a village |
|
困难 |
| 1169 |
|
invalid transactions |
|
中等 |
| 1170 |
|
compare strings by frequency of the smallest character |
|
简单 |
| 1171 |
|
remove zero sum consecutive nodes from linked list |
|
中等 |
| 1172 |
|
dinner plate stacks |
|
困难 |
| 1173 |
|
immediate food delivery i |
|
简单 |
| 1174 |
|
immediate food delivery ii |
|
中等 |
| 1175 |
|
prime arrangements |
|
简单 |
| 1176 |
|
diet plan performance |
|
简单 |
| 1177 |
|
can make palindrome from substring |
|
中等 |
| 1178 |
|
number of valid words for each puzzle |
|
困难 |
| 1179 |
|
reformat department table |
|
简单 |
| 1180 |
|
count substrings with only one distinct letter |
|
简单 |
| 1181 |
|
before and after puzzle |
|
中等 |
| 1182 |
|
shortest distance to target color |
|
中等 |
| 1183 |
|
maximum number of ones |
|
困难 |
| 1184 |
|
distance between bus stops |
|
简单 |
| 1185 |
|
day of the week |
|
简单 |
| 1186 |
|
maximum subarray sum with one deletion |
|
中等 |
| 1187 |
|
make array strictly increasing |
|
困难 |
| 1188 |
|
design bounded blocking queue |
|
中等 |
| 1189 |
|
maximum number of balloons |
|
简单 |
| 1190 |
|
reverse substrings between each pair of parentheses |
|
中等 |
| 1191 |
|
k concatenation maximum sum |
|
中等 |
| 1192 |
|
critical connections in a network |
|
困难 |
| 1193 |
|
monthly transactions i |
|
中等 |
| 1194 |
|
tournament winners |
|
困难 |
| 1195 |
|
fizz buzz multithreaded |
|
中等 |
| 1196 |
|
how many apples can you put into the basket |
|
简单 |
| 1197 |
|
minimum knight moves |
|
中等 |
| 1198 |
|
find smallest common element in all rows |
|
中等 |
| 1199 |
|
minimum time to build blocks |
|
困难 |
| 1200 |
|
minimum absolute difference |
|
简单 |
| 1201 |
|
ugly number iii |
|
中等 |
| 1202 |
|
smallest string with swaps |
|
中等 |
| 1203 |
|
sort items by groups respecting dependencies |
|
困难 |
| 1204 |
|
last person to fit in the elevator |
|
中等 |
| 1205 |
|
monthly transactions ii |
|
中等 |
| 1206 |
|
design skiplist |
|
困难 |
| 1207 |
|
unique number of occurrences |
|
简单 |
| 1208 |
|
get equal substrings within budget |
|
中等 |
| 1209 |
|
remove all adjacent duplicates in string ii |
|
中等 |
| 1210 |
|
minimum moves to reach target with rotations |
|
困难 |
| 1211 |
|
queries quality and percentage |
|
简单 |
| 1212 |
|
team scores in football tournament |
|
中等 |
| 1213 |
|
intersection of three sorted arrays |
|
简单 |
| 1214 |
|
two sum bsts |
|
中等 |
| 1215 |
|
stepping numbers |
|
中等 |
| 1216 |
|
valid palindrome iii |
|
困难 |
| 1217 |
|
play with chips |
|
简单 |
| 1218 |
|
longest arithmetic subsequence of given difference |
|
中等 |
| 1219 |
|
path with maximum gold |
|
中等 |
| 1220 |
|
count vowels permutation |
|
困难 |
| 1221 |
|
split a string in balanced strings |
|
简单 |
| 1222 |
|
queens that can attack the king |
|
中等 |
| 1223 |
|
dice roll simulation |
|
中等 |
| 1224 |
|
maximum equal frequency |
|
困难 |
| 1225 |
|
report contiguous dates |
|
困难 |
| 1226 |
|
the dining philosophers |
|
中等 |
| 1227 |
|
airplane seat assignment probability |
|
中等 |
| 1228 |
|
missing number in arithmetic progression |
|
简单 |
| 1229 |
|
meeting scheduler |
|
中等 |
| 1230 |
|
toss strange coins |
|
中等 |
| 1231 |
|
divide chocolate |
|
困难 |
| 1232 |
|
check if it is a straight line |
|
简单 |
| 1233 |
|
remove sub folders from the filesystem |
|
中等 |
| 1234 |
|
replace the substring for balanced string |
|
中等 |
| 1235 |
|
maximum profit in job scheduling |
|
困难 |
| 1236 |
|
web crawler |
|
中等 |
| 1237 |
|
find positive integer solution for a given equation |
|
简单 |
| 1238 |
|
circular permutation in binary representation |
|
中等 |
| 1239 |
|
maximum length of a concatenated string with unique characters |
|
中等 |
| 1240 |
|
tiling a rectangle with the fewest squares |
|
困难 |
| 1241 |
|
number of comments per post |
|
简单 |
| 1242 |
|
web crawler multithreaded |
|
中等 |
| 1243 |
|
array transformation |
|
简单 |
| 1244 |
|
design a leaderboard |
|
中等 |
| 1245 |
|
tree diameter |
|
中等 |
| 1246 |
|
palindrome removal |
|
困难 |
| 1247 |
|
minimum swaps to make strings equal |
|
中等 |
| 1248 |
|
count number of nice subarrays |
|
中等 |
| 1249 |
|
minimum remove to make valid parentheses |
|
中等 |
| 1250 |
|
check if it is a good array |
|
困难 |
| 1251 |
|
average selling price |
|
简单 |
| 1252 |
|
cells with odd values in a matrix |
|
简单 |
| 1253 |
|
reconstruct a 2 row binary matrix |
|
中等 |
| 1254 |
|
number of closed islands |
|
中等 |
| 1255 |
|
maximum score words formed by letters |
|
困难 |
| 1256 |
|
encode number |
|
中等 |
| 1257 |
|
smallest common region |
|
中等 |
| 1258 |
|
synonymous sentences |
|
中等 |
| 1259 |
|
handshakes that dont cross |
|
困难 |
| 1260 |
|
shift 2d grid |
|
简单 |
| 1261 |
|
find elements in a contaminated binary tree |
|
中等 |
| 1262 |
|
greatest sum divisible by three |
|
中等 |
| 1263 |
|
minimum moves to move a box to their target location |
|
困难 |
| 1264 |
|
page recommendations |
|
中等 |
| 1265 |
|
print immutable linked list in reverse |
|
中等 |
| 1266 |
|
minimum time visiting all points |
|
简单 |
| 1267 |
|
count servers that communicate |
|
中等 |
| 1268 |
|
search suggestions system |
|
中等 |
| 1269 |
|
number of ways to stay in the same place after some steps |
|
困难 |
| 1270 |
|
all people report to the given manager |
|
中等 |