1 |
Two Sum |
Easy |
Go |
2 |
Add Two Numbers |
Medium |
Go |
3 |
Longest Substring Without Repeating Characters |
Medium |
Go |
4 |
Median of Two Sorted Arrays |
Hard |
Go |
5 |
Longest Palindromic Substring |
Medium |
Go |
6 |
ZigZag Conversion |
Medium |
Go |
7 |
Reverse Integer |
Easy |
Go |
8 |
String to Integer (atoi) |
Medium |
Go |
9 |
Palindrome Number |
Easy |
Go |
10 |
Regular Expression Matching |
Hard |
Go |
11 |
Container With Most Water |
Medium |
Go |
12 |
Integer to Roman |
Medium |
Go |
13 |
Roman to Integer |
Easy |
Go |
14 |
Longest Common Prefix |
Easy |
Go |
15 |
3Sum |
Medium |
Go |
16 |
3Sum Closest |
Medium |
Go |
17 |
Letter Combinations of a Phone Number |
Medium |
Go |
18 |
4Sum |
Medium |
Go |
19 |
Remove Nth Node From End of List |
Medium |
Go |
20 |
Valid Parentheses |
Easy |
Go |
21 |
Merge Two Sorted Lists |
Easy |
Go |
22 |
Generate Parentheses |
Medium |
Go |
23 |
Merge k Sorted Lists |
Hard |
Go |
24 |
Swap Nodes in Pairs |
Medium |
Go |
25 |
Reverse Nodes in k-Group |
Hard |
|
26 |
Remove Duplicates from Sorted Array |
Easy |
Go |
27 |
Remove Element |
Easy |
Go |
28 |
Implement strStr() |
Easy |
Go |
29 |
Divide Two Integers |
Medium |
Go |
30 |
Substring with Concatenation of All Words |
Hard |
|
31 |
Next Permutation |
Medium |
|
32 |
Longest Valid Parentheses |
Hard |
|
33 |
Search in Rotated Sorted Array |
Medium |
Go |
34 |
Find First and Last Position of Element in Sorted Array |
Medium |
Go |
35 |
Search Insert Position |
Easy |
|
36 |
Valid Sudoku |
Medium |
Go |
37 |
Sudoku Solver |
Hard |
|
38 |
Count and Say |
Medium |
Go |
39 |
Combination Sum |
Medium |
|
40 |
Combination Sum II |
Medium |
|
41 |
First Missing Positive |
Hard |
Go |
42 |
Trapping Rain Water |
Hard |
Go |
43 |
Multiply Strings |
Medium |
|
44 |
Wildcard Matching |
Hard |
Go |
45 |
Jump Game II |
Hard |
|
46 |
Permutations |
Medium |
Go |
47 |
Permutations II |
Medium |
|
48 |
Rotate Image |
Medium |
Go |
49 |
Group Anagrams |
Medium |
Go |
50 |
Pow(x, n) |
Medium |
Go |
51 |
N-Queens |
Hard |
|
52 |
N-Queens II |
Hard |
|
53 |
Maximum Subarray |
Easy |
Go |
54 |
Spiral Matrix |
Medium |
Go |
55 |
Jump Game |
Medium |
Go |
56 |
Merge Intervals |
Medium |
Go |
57 |
Insert Interval |
Medium |
|
58 |
Length of Last Word |
Easy |
|
59 |
Spiral Matrix II |
Medium |
|
60 |
Permutation Sequence |
Hard |
|
61 |
Rotate List |
Medium |
Go |
62 |
Unique Paths |
Medium |
Go |
63 |
Unique Paths II |
Medium |
|
64 |
Minimum Path Sum |
Medium |
|
65 |
Valid Number |
Hard |
|
66 |
Plus One |
Easy |
Go |
67 |
Add Binary |
Easy |
|
68 |
Text Justification |
Hard |
|
69 |
Sqrt(x) |
Easy |
Go |
70 |
Climbing Stairs |
Easy |
Go |
71 |
Simplify Path |
Medium |
|
72 |
Edit Distance |
Hard |
|
73 |
Set Matrix Zeroes |
Medium |
Go |
74 |
Search a 2D Matrix |
Medium |
|
75 |
Sort Colors |
Medium |
Go |
76 |
Minimum Window Substring |
Hard |
Go |
77 |
Combinations |
Medium |
|
78 |
Subsets |
Medium |
Go |
79 |
Word Search |
Medium |
Go |
80 |
Remove Duplicates from Sorted Array II |
Medium |
|
81 |
Search in Rotated Sorted Array II |
Medium |
|
82 |
Remove Duplicates from Sorted List II |
Medium |
|
83 |
Remove Duplicates from Sorted List |
Easy |
|
84 |
Largest Rectangle in Histogram |
Hard |
Go |
85 |
Maximal Rectangle |
Hard |
|
86 |
Partition List |
Medium |
Go |
87 |
Scramble String |
Hard |
|
88 |
Merge Sorted Array |
Easy |
Go |
89 |
Gray Code |
Medium |
|
90 |
Subsets II |
Medium |
|
91 |
Decode Ways |
Medium |
Go |
92 |
Reverse Linked List II |
Medium |
|
93 |
Restore IP Addresses |
Medium |
|
94 |
Binary Tree Inorder Traversal |
Medium |
Go |
95 |
Unique Binary Search Trees II |
Medium |
Go |
96 |
Unique Binary Search Trees |
Medium |
Go |
97 |
Interleaving String |
Hard |
|
98 |
Validate Binary Search Tree |
Medium |
Go |
99 |
Recover Binary Search Tree |
Hard |
Go |
100 |
Same Tree |
Easy |
Go |
101 |
Symmetric Tree |
Easy |
Go |
102 |
Binary Tree Level Order Traversal |
Medium |
Go |
103 |
Binary Tree Zigzag Level Order Traversal |
Medium |
Go |
104 |
Maximum Depth of Binary Tree |
Easy |
Go |
105 |
Construct Binary Tree from Preorder and Inorder Traversal |
Medium |
Go |
106 |
Construct Binary Tree from Inorder and Postorder Traversal |
Medium |
Go |
107 |
Binary Tree Level Order Traversal II |
Medium |
Go |
108 |
Convert Sorted Array to Binary Search Tree |
Easy |
Go |
109 |
Convert Sorted List to Binary Search Tree |
Medium |
|
110 |
Balanced Binary Tree |
Easy |
Go |
111 |
Minimum Depth of Binary Tree |
Easy |
Go |
112 |
Path Sum |
Easy |
Go |
113 |
Path Sum II |
Medium |
Go |
114 |
Flatten Binary Tree to Linked List |
Medium |
Go |
115 |
Distinct Subsequences |
Hard |
|
116 |
Populating Next Right Pointers in Each Node |
Medium |
Go |
117 |
Populating Next Right Pointers in Each Node II |
Medium |
Go |
118 |
Pascal's Triangle |
Easy |
Go |
119 |
Pascal's Triangle II |
Easy |
|
120 |
Triangle |
Medium |
|
121 |
Best Time to Buy and Sell Stock |
Easy |
Go |
122 |
Best Time to Buy and Sell Stock II |
Easy |
Go |
123 |
Best Time to Buy and Sell Stock III |
Hard |
|
124 |
Binary Tree Maximum Path Sum |
Hard |
Go |
125 |
Valid Palindrome |
Easy |
Go |
126 |
Word Ladder II |
Hard |
|
127 |
Word Ladder |
Hard |
Go |
128 |
Longest Consecutive Sequence |
Medium |
Go |
129 |
Sum Root to Leaf Numbers |
Medium |
Go |
130 |
Surrounded Regions |
Medium |
Go |
131 |
Palindrome Partitioning |
Medium |
Go |
132 |
Palindrome Partitioning II |
Hard |
|
133 |
Clone Graph |
Medium |
|
134 |
Gas Station |
Medium |
Go |
135 |
Candy |
Hard |
|
136 |
Single Number |
Easy |
Go |
137 |
Single Number II |
Medium |
|
138 |
Copy List with Random Pointer |
Medium |
Go |
139 |
Word Break |
Medium |
Go |
140 |
Word Break II |
Hard |
|
141 |
Linked List Cycle |
Easy |
Go |
142 |
Linked List Cycle II |
Medium |
|
143 |
Reorder List |
Medium |
|
144 |
Binary Tree Preorder Traversal |
Medium |
Go |
145 |
Binary Tree Postorder Traversal |
Medium |
Go |
146 |
LRU Cache |
Medium |
Go |
147 |
Insertion Sort List |
Medium |
|
148 |
Sort List |
Medium |
Go |
149 |
Max Points on a Line |
Hard |
|
150 |
Evaluate Reverse Polish Notation |
Medium |
Go |
151 |
Reverse Words in a String |
Medium |
|
152 |
Maximum Product Subarray |
Medium |
Go |
153 |
Find Minimum in Rotated Sorted Array |
Medium |
|
154 |
Find Minimum in Rotated Sorted Array II |
Hard |
|
155 |
Min Stack |
Easy |
Go |
160 |
Intersection of Two Linked Lists |
Easy |
Go |
162 |
Find Peak Element |
Medium |
Go |
164 |
Maximum Gap |
Hard |
|
165 |
Compare Version Numbers |
Medium |
|
166 |
Fraction to Recurring Decimal |
Medium |
|
167 |
Two Sum II - Input array is sorted |
Easy |
|
168 |
Excel Sheet Column Title |
Easy |
|
169 |
Majority Element |
Easy |
Go |
171 |
Excel Sheet Column Number |
Easy |
Go |
172 |
Factorial Trailing Zeroes |
Easy |
Go |
173 |
Binary Search Tree Iterator |
Medium |
Go |
174 |
Dungeon Game |
Hard |
|
175 |
Combine Two Tables |
Easy |
|
176 |
Second Highest Salary |
Easy |
|
177 |
Nth Highest Salary |
Medium |
|
178 |
Rank Scores |
Medium |
|
179 |
Largest Number |
Medium |
Go |
180 |
Consecutive Numbers |
Medium |
|
181 |
Employees Earning More Than Their Managers |
Easy |
|
182 |
Duplicate Emails |
Easy |
|
183 |
Customers Who Never Order |
Easy |
|
184 |
Department Highest Salary |
Medium |
|
185 |
Department Top Three Salaries |
Hard |
|
187 |
Repeated DNA Sequences |
Medium |
|
188 |
Best Time to Buy and Sell Stock IV |
Hard |
|
189 |
Rotate Array |
Medium |
Go |
190 |
Reverse Bits |
Easy |
Go |
191 |
Number of 1 Bits |
Easy |
Go |
192 |
Word Frequency |
Medium |
|
193 |
Valid Phone Numbers |
Easy |
|
194 |
Transpose File |
Medium |
|
195 |
Tenth Line |
Easy |
|
196 |
Delete Duplicate Emails |
Easy |
|
197 |
Rising Temperature |
Easy |
|
198 |
House Robber |
Medium |
Go |
199 |
Binary Tree Right Side View |
Medium |
Go |
200 |
Number of Islands |
Medium |
Go |
201 |
Bitwise AND of Numbers Range |
Medium |
|
202 |
Happy Number |
Easy |
Go |
203 |
Remove Linked List Elements |
Easy |
|
204 |
Count Primes |
Easy |
Go |
205 |
Isomorphic Strings |
Easy |
|
206 |
Reverse Linked List |
Easy |
Go |
207 |
Course Schedule |
Medium |
|
208 |
Implement Trie (Prefix Tree) |
Medium |
|
209 |
Minimum Size Subarray Sum |
Medium |
|
210 |
Course Schedule II |
Medium |
|
211 |
Design Add and Search Words Data Structure |
Medium |
|
212 |
Word Search II |
Hard |
|
213 |
House Robber II |
Medium |
Go |
214 |
Shortest Palindrome |
Hard |
|
215 |
Kth Largest Element in an Array |
Medium |
|
216 |
Combination Sum III |
Medium |
|
217 |
Contains Duplicate |
Easy |
|
218 |
The Skyline Problem |
Hard |
|
219 |
Contains Duplicate II |
Easy |
|
220 |
Contains Duplicate III |
Medium |
|
221 |
Maximal Square |
Medium |
|
222 |
Count Complete Tree Nodes |
Medium |
Go |
223 |
Rectangle Area |
Medium |
|
224 |
Basic Calculator |
Hard |
|
225 |
Implement Stack using Queues |
Easy |
|
226 |
Invert Binary Tree |
Easy |
Go |
227 |
Basic Calculator II |
Medium |
|
228 |
Summary Ranges |
Easy |
|
229 |
Majority Element II |
Medium |
|
230 |
Kth Smallest Element in a BST |
Medium |
Go |
231 |
Power of Two |
Easy |
|
232 |
Implement Queue using Stacks |
Easy |
|
233 |
Number of Digit One |
Hard |
|
234 |
Palindrome Linked List |
Easy |
|
235 |
Lowest Common Ancestor of a Binary Search Tree |
Easy |
Go |
236 |
Lowest Common Ancestor of a Binary Tree |
Medium |
Go |
237 |
Delete Node in a Linked List |
Easy |
|
238 |
Product of Array Except Self |
Medium |
|
239 |
Sliding Window Maximum |
Hard |
|
240 |
Search a 2D Matrix II |
Medium |
|
241 |
Different Ways to Add Parentheses |
Medium |
|
242 |
Valid Anagram |
Easy |
|
257 |
Binary Tree Paths |
Easy |
Go |
258 |
Add Digits |
Easy |
|
260 |
Single Number III |
Medium |
|
262 |
Trips and Users |
Hard |
|
263 |
Ugly Number |
Easy |
Go |
264 |
Ugly Number II |
Medium |
Go |
268 |
Missing Number |
Easy |
|
273 |
Integer to English Words |
Hard |
|
274 |
H-Index |
Medium |
|
275 |
H-Index II |
Medium |
|
278 |
First Bad Version |
Easy |
|
279 |
Perfect Squares |
Medium |
|
282 |
Expression Add Operators |
Hard |
Go |
283 |
Move Zeroes |
Easy |
|
284 |
Peeking Iterator |
Medium |
|
287 |
Find the Duplicate Number |
Medium |
|
289 |
Game of Life |
Medium |
|
290 |
Word Pattern |
Easy |
|
292 |
Nim Game |
Easy |
|
295 |
Find Median from Data Stream |
Hard |
|
297 |
Serialize and Deserialize Binary Tree |
Hard |
Go |
299 |
Bulls and Cows |
Medium |
|
300 |
Longest Increasing Subsequence |
Medium |
|
301 |
Remove Invalid Parentheses |
Hard |
|
303 |
Range Sum Query - Immutable |
Easy |
|
304 |
Range Sum Query 2D - Immutable |
Medium |
|
306 |
Additive Number |
Medium |
|
307 |
Range Sum Query - Mutable |
Medium |
|
309 |
Best Time to Buy and Sell Stock with Cooldown |
Medium |
|
310 |
Minimum Height Trees |
Medium |
|
312 |
Burst Balloons |
Hard |
|
313 |
Super Ugly Number |
Medium |
|
315 |
Count of Smaller Numbers After Self |
Hard |
|
316 |
Remove Duplicate Letters |
Medium |
|
318 |
Maximum Product of Word Lengths |
Medium |
|
319 |
Bulb Switcher |
Medium |
|
321 |
Create Maximum Number |
Hard |
|
322 |
Coin Change |
Medium |
|
324 |
Wiggle Sort II |
Medium |
|
326 |
Power of Three |
Easy |
|
327 |
Count of Range Sum |
Hard |
|
328 |
Odd Even Linked List |
Medium |
|
329 |
Longest Increasing Path in a Matrix |
Hard |
|
330 |
Patching Array |
Hard |
|
331 |
Verify Preorder Serialization of a Binary Tree |
Medium |
|
332 |
Reconstruct Itinerary |
Medium |
|
334 |
Increasing Triplet Subsequence |
Medium |
|
335 |
Self Crossing |
Hard |
|
336 |
Palindrome Pairs |
Hard |
|
337 |
House Robber III |
Medium |
Go |
338 |
Counting Bits |
Medium |
|
341 |
Flatten Nested List Iterator |
Medium |
|
342 |
Power of Four |
Easy |
|
343 |
Integer Break |
Medium |
|
344 |
Reverse String |
Easy |
|
345 |
Reverse Vowels of a String |
Easy |
|
347 |
Top K Frequent Elements |
Medium |
|
349 |
Intersection of Two Arrays |
Easy |
Go |
350 |
Intersection of Two Arrays II |
Easy |
Go |
352 |
Data Stream as Disjoint Intervals |
Hard |
|
354 |
Russian Doll Envelopes |
Hard |
|
355 |
Design Twitter |
Medium |
|
357 |
Count Numbers with Unique Digits |
Medium |
|
363 |
Max Sum of Rectangle No Larger Than K |
Hard |
|
365 |
Water and Jug Problem |
Medium |
|
367 |
Valid Perfect Square |
Easy |
|
368 |
Largest Divisible Subset |
Medium |
|
371 |
Sum of Two Integers |
Medium |
|
372 |
Super Pow |
Medium |
|
373 |
Find K Pairs with Smallest Sums |
Medium |
|
374 |
Guess Number Higher or Lower |
Easy |
|
375 |
Guess Number Higher or Lower II |
Medium |
|
376 |
Wiggle Subsequence |
Medium |
|
377 |
Combination Sum IV |
Medium |
|
378 |
Kth Smallest Element in a Sorted Matrix |
Medium |
|
380 |
Insert Delete GetRandom O(1) |
Medium |
|
381 |
Insert Delete GetRandom O(1) - Duplicates allowed |
Hard |
|
382 |
Linked List Random Node |
Medium |
|
383 |
Ransom Note |
Easy |
|
384 |
Shuffle an Array |
Medium |
|
385 |
Mini Parser |
Medium |
|
386 |
Lexicographical Numbers |
Medium |
|
387 |
First Unique Character in a String |
Easy |
|
388 |
Longest Absolute File Path |
Medium |
|
389 |
Find the Difference |
Easy |
|
390 |
Elimination Game |
Medium |
|
391 |
Perfect Rectangle |
Hard |
|
392 |
Is Subsequence |
Easy |
|
393 |
UTF-8 Validation |
Medium |
|
394 |
Decode String |
Medium |
|
395 |
Longest Substring with At Least K Repeating Characters |
Medium |
|
396 |
Rotate Function |
Medium |
|
397 |
Integer Replacement |
Medium |
|
398 |
Random Pick Index |
Medium |
|
399 |
Evaluate Division |
Medium |
|
400 |
Nth Digit |
Medium |
|
401 |
Binary Watch |
Easy |
|
402 |
Remove K Digits |
Medium |
|
403 |
Frog Jump |
Hard |
|
404 |
Sum of Left Leaves |
Easy |
Go |
405 |
Convert a Number to Hexadecimal |
Easy |
|
406 |
Queue Reconstruction by Height |
Medium |
|
407 |
Trapping Rain Water II |
Hard |
|
409 |
Longest Palindrome |
Easy |
|
410 |
Split Array Largest Sum |
Hard |
|
412 |
Fizz Buzz |
Easy |
|
413 |
Arithmetic Slices |
Medium |
|
414 |
Third Maximum Number |
Easy |
|
415 |
Add Strings |
Easy |
Go |
416 |
Partition Equal Subset Sum |
Medium |
|
417 |
Pacific Atlantic Water Flow |
Medium |
|
419 |
Battleships in a Board |
Medium |
|
420 |
Strong Password Checker |
Hard |
|
421 |
Maximum XOR of Two Numbers in an Array |
Medium |
|
423 |
Reconstruct Original Digits from English |
Medium |
|
424 |
Longest Repeating Character Replacement |
Medium |
|
429 |
N-ary Tree Level Order Traversal |
Medium |
Go |
432 |
All O`one Data Structure |
Hard |
|
433 |
Minimum Genetic Mutation |
Medium |
|
434 |
Number of Segments in a String |
Easy |
|
435 |
Non-overlapping Intervals |
Medium |
|
436 |
Find Right Interval |
Medium |
|
437 |
Path Sum III |
Medium |
Go |
438 |
Find All Anagrams in a String |
Medium |
|
440 |
K-th Smallest in Lexicographical Order |
Hard |
|
441 |
Arranging Coins |
Easy |
|
442 |
Find All Duplicates in an Array |
Medium |
|
443 |
String Compression |
Medium |
|
445 |
Add Two Numbers II |
Medium |
|
446 |
Arithmetic Slices II - Subsequence |
Hard |
|
447 |
Number of Boomerangs |
Medium |
|
448 |
Find All Numbers Disappeared in an Array |
Easy |
|
449 |
Serialize and Deserialize BST |
Medium |
|
450 |
Delete Node in a BST |
Medium |
|
451 |
Sort Characters By Frequency |
Medium |
|
452 |
Minimum Number of Arrows to Burst Balloons |
Medium |
|
453 |
Minimum Moves to Equal Array Elements |
Easy |
|
454 |
4Sum II |
Medium |
|
455 |
Assign Cookies |
Easy |
|
456 |
132 Pattern |
Medium |
|
457 |
Circular Array Loop |
Medium |
|
458 |
Poor Pigs |
Hard |
|
459 |
Repeated Substring Pattern |
Easy |
|
460 |
LFU Cache |
Hard |
|
461 |
Hamming Distance |
Easy |
|
462 |
Minimum Moves to Equal Array Elements II |
Medium |
|
463 |
Island Perimeter |
Easy |
|
464 |
Can I Win |
Medium |
|
466 |
Count The Repetitions |
Hard |
|
467 |
Unique Substrings in Wraparound String |
Medium |
|
468 |
Validate IP Address |
Medium |
|
472 |
Concatenated Words |
Hard |
|
473 |
Matchsticks to Square |
Medium |
|
474 |
Ones and Zeroes |
Medium |
|
475 |
Heaters |
Medium |
|
476 |
Number Complement |
Easy |
|
477 |
Total Hamming Distance |
Medium |
|
479 |
Largest Palindrome Product |
Hard |
|
480 |
Sliding Window Median |
Hard |
|
481 |
Magical String |
Medium |
|
482 |
License Key Formatting |
Easy |
|
483 |
Smallest Good Base |
Hard |
|
485 |
Max Consecutive Ones |
Easy |
|
486 |
Predict the Winner |
Medium |
|
488 |
Zuma Game |
Hard |
|
489 |
Kth Smallest Instructions |
Hard |
|
491 |
Increasing Subsequences |
Medium |
|
492 |
Construct the Rectangle |
Easy |
|
493 |
Reverse Pairs |
Hard |
|
494 |
Target Sum |
Medium |
|
495 |
Teemo Attacking |
Medium |
|
496 |
Next Greater Element I |
Easy |
|
498 |
Diagonal Traverse |
Medium |
|
500 |
Keyboard Row |
Easy |
|
501 |
Find Mode in Binary Search Tree |
Easy |
|
502 |
IPO |
Hard |
|
503 |
Next Greater Element II |
Medium |
|
504 |
Base 7 |
Easy |
|
506 |
Relative Ranks |
Easy |
|
507 |
Perfect Number |
Easy |
|
508 |
Most Frequent Subtree Sum |
Medium |
|
513 |
Find Bottom Left Tree Value |
Medium |
|
514 |
Freedom Trail |
Hard |
|
515 |
Find Largest Value in Each Tree Row |
Medium |
|
516 |
Longest Palindromic Subsequence |
Medium |
|
517 |
Super Washing Machines |
Hard |
|
518 |
Coin Change 2 |
Medium |
|
520 |
Detect Capital |
Easy |
|
521 |
Longest Uncommon Subsequence I |
Easy |
|
522 |
Longest Uncommon Subsequence II |
Medium |
|
523 |
Continuous Subarray Sum |
Medium |
|
524 |
Longest Word in Dictionary through Deleting |
Medium |
Go |
525 |
Contiguous Array |
Medium |
|
526 |
Beautiful Arrangement |
Medium |
|
528 |
Swapping Nodes in a Linked List |
Medium |
|
529 |
Minesweeper |
Medium |
|
530 |
Minimum Absolute Difference in BST |
Easy |
|
532 |
K-diff Pairs in an Array |
Medium |
|
535 |
Encode and Decode TinyURL |
Medium |
|
537 |
Complex Number Multiplication |
Medium |
|
538 |
Convert BST to Greater Tree |
Medium |
|
539 |
Minimum Time Difference |
Medium |
|
540 |
Single Element in a Sorted Array |
Medium |
|
541 |
Reverse String II |
Easy |
|
542 |
01 Matrix |
Medium |
|
543 |
Diameter of Binary Tree |
Easy |
|
546 |
Remove Boxes |
Hard |
|
547 |
Number of Provinces |
Medium |
|
551 |
Student Attendance Record I |
Easy |
|
552 |
Student Attendance Record II |
Hard |
|
553 |
Optimal Division |
Medium |
|
554 |
Brick Wall |
Medium |
|
556 |
Next Greater Element III |
Medium |
|
557 |
Reverse Words in a String III |
Easy |
|
560 |
Subarray Sum Equals K |
Medium |
|
561 |
Array Partition I |
Easy |
|
563 |
Binary Tree Tilt |
Easy |
|
564 |
Find the Closest Palindrome |
Hard |
|
565 |
Array Nesting |
Medium |
|
566 |
Reshape the Matrix |
Easy |
|
567 |
Permutation in String |
Medium |
|
572 |
Subtree of Another Tree |
Easy |
|
575 |
Distribute Candies |
Easy |
|
576 |
Out of Boundary Paths |
Medium |
|
581 |
Shortest Unsorted Continuous Subarray |
Medium |
|
583 |
Delete Operation for Two Strings |
Medium |
|
587 |
Erect the Fence |
Hard |
|
590 |
N-ary Tree Postorder Traversal |
Easy |
Go |
591 |
Tag Validator |
Hard |
|
592 |
Fraction Addition and Subtraction |
Medium |
|
593 |
Valid Square |
Medium |
|
594 |
Longest Harmonious Subsequence |
Easy |
|
595 |
Big Countries |
Easy |
|
596 |
Classes More Than 5 Students |
Easy |
|
598 |
Range Addition II |
Easy |
|
599 |
Minimum Index Sum of Two Lists |
Easy |
|
600 |
Non-negative Integers without Consecutive Ones |
Hard |
|
601 |
Human Traffic of Stadium |
Hard |
|
605 |
Can Place Flowers |
Easy |
|
606 |
Construct String from Binary Tree |
Easy |
|
609 |
Find Duplicate File in System |
Medium |
|
611 |
Valid Triangle Number |
Medium |
|
617 |
Merge Two Binary Trees |
Easy |
|
620 |
Not Boring Movies |
Easy |
|
621 |
Task Scheduler |
Medium |
|
623 |
Add One Row to Tree |
Medium |
|
626 |
Exchange Seats |
Medium |
|
627 |
Swap Salary |
Easy |
|
628 |
Maximum Product of Three Numbers |
Easy |
|
629 |
K Inverse Pairs Array |
Hard |
|
630 |
Course Schedule III |
Hard |
|
632 |
Smallest Range Covering Elements from K Lists |
Hard |
|
633 |
Sum of Square Numbers |
Medium |
|
636 |
Exclusive Time of Functions |
Medium |
|
637 |
Average of Levels in Binary Tree |
Easy |
|
638 |
Shopping Offers |
Medium |
|
639 |
Decode Ways II |
Hard |
|
640 |
Solve the Equation |
Medium |
|
643 |
Maximum Average Subarray I |
Easy |
|
645 |
Set Mismatch |
Easy |
|
646 |
Maximum Length of Pair Chain |
Medium |
|
647 |
Palindromic Substrings |
Medium |
|
648 |
Replace Words |
Medium |
|
649 |
Dota2 Senate |
Medium |
|
650 |
2 Keys Keyboard |
Medium |
|
652 |
Find Duplicate Subtrees |
Medium |
|
653 |
Two Sum IV - Input is a BST |
Easy |
|
654 |
Maximum Binary Tree |
Medium |
|
655 |
Print Binary Tree |
Medium |
|
657 |
Robot Return to Origin |
Easy |
|
658 |
Find K Closest Elements |
Medium |
|
659 |
Split Array into Consecutive Subsequences |
Medium |
|
661 |
Image Smoother |
Easy |
|
662 |
Maximum Width of Binary Tree |
Medium |
|
664 |
Strange Printer |
Hard |
|
665 |
Non-decreasing Array |
Medium |
|
667 |
Beautiful Arrangement II |
Medium |
|
668 |
Kth Smallest Number in Multiplication Table |
Hard |
|
669 |
Trim a Binary Search Tree |
Medium |
|
670 |
Maximum Swap |
Medium |
|
671 |
Second Minimum Node In a Binary Tree |
Easy |
|
672 |
Bulb Switcher II |
Medium |
|
673 |
Number of Longest Increasing Subsequence |
Medium |
|
674 |
Longest Continuous Increasing Subsequence |
Easy |
|
675 |
Cut Off Trees for Golf Event |
Hard |
|
676 |
Implement Magic Dictionary |
Medium |
|
677 |
Map Sum Pairs |
Medium |
|
678 |
Valid Parenthesis String |
Medium |
|
679 |
24 Game |
Hard |
|
680 |
Valid Palindrome II |
Easy |
|
682 |
Baseball Game |
Easy |
|
684 |
Redundant Connection |
Medium |
|
685 |
Redundant Connection II |
Hard |
|
686 |
Repeated String Match |
Medium |
|
687 |
Longest Univalue Path |
Medium |
|
688 |
Knight Probability in Chessboard |
Medium |
|
689 |
Maximum Sum of 3 Non-Overlapping Subarrays |
Hard |
|
690 |
Employee Importance |
Easy |
|
691 |
Stickers to Spell Word |
Hard |
|
692 |
Top K Frequent Words |
Medium |
|
693 |
Binary Number with Alternating Bits |
Easy |
|
695 |
Max Area of Island |
Medium |
|
696 |
Count Binary Substrings |
Easy |
|
697 |
Degree of an Array |
Easy |
|
698 |
Partition to K Equal Sum Subsets |
Medium |
|
699 |
Falling Squares |
Hard |
|
712 |
Minimum ASCII Delete Sum for Two Strings |
Medium |
|
713 |
Subarray Product Less Than K |
Medium |
|
714 |
Best Time to Buy and Sell Stock with Transaction Fee |
Medium |
|
715 |
Range Module |
Hard |
|
717 |
1-bit and 2-bit Characters |
Easy |
|
718 |
Maximum Length of Repeated Subarray |
Medium |
|
719 |
Find K-th Smallest Pair Distance |
Hard |
|
720 |
Longest Word in Dictionary |
Easy |
|
721 |
Accounts Merge |
Medium |
|
722 |
Remove Comments |
Medium |
|
724 |
Find Pivot Index |
Easy |
|
725 |
Split Linked List in Parts |
Medium |
|
726 |
Number of Atoms |
Hard |
|
728 |
Self Dividing Numbers |
Easy |
|
729 |
My Calendar I |
Medium |
|
730 |
Count Different Palindromic Subsequences |
Hard |
|
731 |
My Calendar II |
Medium |
|
732 |
My Calendar III |
Hard |
|
733 |
Flood Fill |
Easy |
|
735 |
Asteroid Collision |
Medium |
|
736 |
Parse Lisp Expression |
Hard |
|
738 |
Monotone Increasing Digits |
Medium |
|
739 |
Daily Temperatures |
Medium |
|
740 |
Delete and Earn |
Medium |
|
741 |
Cherry Pickup |
Hard |
|
742 |
To Lower Case |
Easy |
|
744 |
Network Delay Time |
Medium |
|
745 |
Find Smallest Letter Greater Than Target |
Easy |
|
746 |
Prefix and Suffix Search |
Hard |
|
747 |
Min Cost Climbing Stairs |
Easy |
|
748 |
Largest Number At Least Twice of Others |
Easy |
|
749 |
Shortest Completing Word |
Easy |
|
750 |
Contain Virus |
Hard |
|
753 |
Open the Lock |
Medium |
|
754 |
Cracking the Safe |
Hard |
|
755 |
Reach a Number |
Medium |
|
757 |
Pyramid Transition Matrix |
Medium |
|
759 |
Set Intersection Size At Least Two |
Hard |
|
763 |
Special Binary String |
Hard |
|
764 |
N-ary Tree Level Order Traversal |
Medium |
|
766 |
Flatten a Multilevel Doubly Linked List |
Medium |
|
767 |
Prime Number of Set Bits in Binary Representation |
Easy |
|
768 |
Partition Labels |
Medium |
|
769 |
Largest Plus Sign |
Medium |
|
770 |
Couples Holding Hands |
Hard |
|
772 |
Construct Quad Tree |
Medium |
|
773 |
Logical OR of Two Binary Grids Represented as Quad-Trees |
Medium |
|
774 |
Maximum Depth of N-ary Tree |
Easy |
|
775 |
N-ary Tree Preorder Traversal |
Easy |
|
776 |
N-ary Tree Postorder Traversal |
Easy |
|
777 |
Toeplitz Matrix |
Easy |
|
778 |
Reorganize String |
Medium |
|
779 |
Max Chunks To Make Sorted II |
Hard |
|
780 |
Max Chunks To Make Sorted |
Medium |
|
781 |
Basic Calculator IV |
Hard |
|
782 |
Jewels and Stones |
Easy |
|
783 |
Search in a Binary Search Tree |
Easy |
|
784 |
Insert into a Binary Search Tree |
Medium |
|
787 |
Sliding Puzzle |
Hard |
|
789 |
Kth Largest Element in a Stream |
Easy |
|
790 |
Global and Local Inversions |
Medium |
|
792 |
Binary Search |
Easy |
|
793 |
Swap Adjacent in LR String |
Medium |
|
794 |
Swim in Rising Water |
Hard |
|
795 |
K-th Symbol in Grammar |
Medium |
|
796 |
Reaching Points |
Hard |
|
797 |
Rabbits in Forest |
Medium |
|
798 |
Transform to Chessboard |
Hard |
|
799 |
Minimum Distance Between BST Nodes |
Easy |
|
800 |
Letter Case Permutation |
Medium |
|
801 |
Is Graph Bipartite? |
Medium |
|
802 |
K-th Smallest Prime Fraction |
Hard |
|
803 |
Cheapest Flights Within K Stops |
Medium |
|
804 |
Rotated Digits |
Easy |
|
805 |
Escape The Ghosts |
Medium |
|
806 |
Domino and Tromino Tiling |
Medium |
|
807 |
Custom Sort String |
Medium |
|
808 |
Number of Matching Subsequences |
Medium |
|
809 |
Preimage Size of Factorial Zeroes Function |
Hard |
|
810 |
Valid Tic-Tac-Toe State |
Medium |
|
811 |
Number of Subarrays with Bounded Maximum |
Medium |
|
812 |
Rotate String |
Easy |
|
813 |
All Paths From Source to Target |
Medium |
|
814 |
Smallest Rotation with Highest Score |
Hard |
|
815 |
Champagne Tower |
Medium |
|
816 |
Design HashSet |
Easy |
|
817 |
Design HashMap |
Easy |
|
819 |
Minimum Swaps To Make Sequences Increasing |
Medium |
|
820 |
Find Eventual Safe States |
Medium |
|
821 |
Bricks Falling When Hit |
Hard |
|
822 |
Unique Morse Code Words |
Easy |
|
823 |
Split Array With Same Average |
Hard |
|
824 |
Number of Lines To Write String |
Easy |
|
825 |
Max Increase to Keep City Skyline |
Medium |
|
826 |
Soup Servings |
Medium |
|
827 |
Expressive Words |
Medium |
|
828 |
Chalkboard XOR Game |
Hard |
|
829 |
Subdomain Visit Count |
Easy |
|
830 |
Largest Triangle Area |
Easy |
|
831 |
Largest Sum of Averages |
Medium |
|
832 |
Binary Tree Pruning |
Medium |
|
833 |
Bus Routes |
Hard |
|
834 |
Ambiguous Coordinates |
Medium |
|
835 |
Linked List Components |
Medium |
|
836 |
Race Car |
Hard |
|
837 |
Most Common Word |
Easy |
|
838 |
Design Linked List |
Medium |
|
839 |
Short Encoding of Words |
Medium |
|
841 |
Shortest Distance to a Character |
Easy |
|
842 |
Card Flipping Game |
Medium |
|
843 |
Binary Trees With Factors |
Medium |
|
851 |
Goat Latin |
Easy |
|
852 |
Friends Of Appropriate Ages |
Medium |
|
853 |
Most Profit Assigning Work |
Medium |
|
854 |
Making A Large Island |
Hard |
|
855 |
Count Unique Characters of All Substrings of a Given String |
Hard |
|
856 |
Consecutive Numbers Sum |
Hard |
|
857 |
Positions of Large Groups |
Easy |
|
858 |
Masking Personal Information |
Medium |
|
859 |
Design Circular Deque |
Medium |
|
860 |
Design Circular Queue |
Medium |
|
861 |
Flipping an Image |
Easy |
|
862 |
Find And Replace in String |
Medium |
|
863 |
Sum of Distances in Tree |
Hard |
|
864 |
Image Overlap |
Medium |
|
866 |
Rectangle Overlap |
Easy |
|
867 |
New 21 Game |
Medium |
|
868 |
Push Dominoes |
Medium |
|
869 |
Similar String Groups |
Hard |
|
870 |
Magic Squares In Grid |
Medium |
|
871 |
Keys and Rooms |
Medium |
|
872 |
Split Array into Fibonacci Sequence |
Medium |
|
873 |
Guess the Word |
Hard |
|
874 |
Backspace String Compare |
Easy |
|
875 |
Longest Mountain in Array |
Medium |
|
876 |
Hand of Straights |
Medium |
|
877 |
Shortest Path Visiting All Nodes |
Hard |
|
878 |
Shifting Letters |
Medium |
|
879 |
Maximize Distance to Closest Person |
Medium |
|
880 |
Rectangle Area II |
Hard |
|
881 |
Loud and Rich |
Medium |
|
882 |
Peak Index in a Mountain Array |
Easy |
|
883 |
Car Fleet |
Medium |
|
884 |
K-Similar Strings |
Hard |
|
885 |
Exam Room |
Medium |
|
886 |
Score of Parentheses |
Medium |
|
887 |
Minimum Cost to Hire K Workers |
Hard |
|
888 |
Mirror Reflection |
Medium |
|
889 |
Buddy Strings |
Easy |
|
890 |
Lemonade Change |
Easy |
|
891 |
Score After Flipping Matrix |
Medium |
|
892 |
Shortest Subarray with Sum at Least K |
Hard |
|
893 |
All Nodes Distance K in Binary Tree |
Medium |
|
894 |
Random Pick with Blacklist |
Hard |
|
895 |
Shortest Path to Get All Keys |
Hard |
|
896 |
Smallest Subtree with all the Deepest Nodes |
Medium |
|
897 |
Prime Palindrome |
Medium |
|
898 |
Transpose Matrix |
Easy |
|
899 |
Binary Gap |
Easy |
|
900 |
Reordered Power of 2 |
Medium |
|
901 |
Advantage Shuffle |
Medium |
|
902 |
Minimum Number of Refueling Stops |
Hard |
|
903 |
Implement Rand10() Using Rand7() |
Medium |
|
904 |
Leaf-Similar Trees |
Easy |
|
905 |
Length of Longest Fibonacci Subsequence |
Medium |
|
906 |
Walking Robot Simulation |
Easy |
|
907 |
Koko Eating Bananas |
Medium |
|
908 |
Middle of the Linked List |
Easy |
|
909 |
Stone Game |
Medium |
|
910 |
Nth Magical Number |
Hard |
|
911 |
Profitable Schemes |
Hard |
|
912 |
Random Pick with Weight |
Medium |
|
913 |
Random Flip Matrix |
Medium |
|
914 |
Random Point in Non-overlapping Rectangles |
Medium |
|
915 |
Generate Random Point in a Circle |
Medium |
|
916 |
Decoded String at Index |
Medium |
|
917 |
Boats to Save People |
Medium |
|
918 |
Reachable Nodes In Subdivided Graph |
Hard |
|
919 |
Projection Area of 3D Shapes |
Easy |
|
920 |
Uncommon Words from Two Sentences |
Easy |
|
921 |
Spiral Matrix III |
Medium |
|
922 |
Possible Bipartition |
Medium |
|
923 |
Super Egg Drop |
Hard |
|
924 |
Fair Candy Swap |
Easy |
|
925 |
Construct Binary Tree from Preorder and Postorder Traversal |
Medium |
|
926 |
Find and Replace Pattern |
Medium |
|
927 |
Sum of Subsequence Widths |
Hard |
|
928 |
Surface Area of 3D Shapes |
Easy |
|
929 |
Groups of Special-Equivalent Strings |
Easy |
|
930 |
All Possible Full Binary Trees |
Medium |
|
931 |
Maximum Frequency Stack |
Hard |
|
932 |
Monotonic Array |
Easy |
|
933 |
Increasing Order Search Tree |
Easy |
|
934 |
Bitwise ORs of Subarrays |
Medium |
|
935 |
Orderly Queue |
Hard |
|
936 |
RLE Iterator |
Medium |
|
937 |
Online Stock Span |
Medium |
|
938 |
Numbers At Most N Given Digit Set |
Hard |
|
939 |
Valid Permutations for DI Sequence |
Hard |
|
940 |
Fruit Into Baskets |
Medium |
Go |
941 |
Sort Array By Parity |
Easy |
|
942 |
Super Palindromes |
Hard |
|
943 |
Sum of Subarray Minimums |
Medium |
|
944 |
Smallest Range I |
Easy |
|
945 |
Snakes and Ladders |
Medium |
|
946 |
Smallest Range II |
Medium |
|
947 |
Online Election |
Medium |
|
948 |
Sort an Array |
Medium |
|
949 |
Cat and Mouse |
Hard |
|
950 |
X of a Kind in a Deck of Cards |
Easy |
|
951 |
Partition Array into Disjoint Intervals |
Medium |
|
952 |
Word Subsets |
Medium |
|
953 |
Reverse Only Letters |
Easy |
|
954 |
Maximum Sum Circular Subarray |
Medium |
|
955 |
Complete Binary Tree Inserter |
Medium |
|
956 |
Number of Music Playlists |
Hard |
|
957 |
Minimum Add to Make Parentheses Valid |
Medium |
|
958 |
Sort Array By Parity II |
Easy |
|
959 |
3Sum With Multiplicity |
Medium |
|
960 |
Minimize Malware Spread |
Hard |
|
961 |
Long Pressed Name |
Easy |
|
962 |
Flip String to Monotone Increasing |
Medium |
|
963 |
Three Equal Parts |
Hard |
|
964 |
Minimize Malware Spread II |
Hard |
|
965 |
Unique Email Addresses |
Easy |
|
966 |
Binary Subarrays With Sum |
Medium |
|
967 |
Minimum Falling Path Sum |
Medium |
|
968 |
Beautiful Array |
Medium |
|
969 |
Number of Recent Calls |
Easy |
|
971 |
Shortest Bridge |
Medium |
|
972 |
Knight Dialer |
Medium |
|
973 |
Stamping The Sequence |
Hard |
|
974 |
Reorder Data in Log Files |
Easy |
|
975 |
Range Sum of BST |
Easy |
|
976 |
Minimum Area Rectangle |
Medium |
|
977 |
Distinct Subsequences II |
Hard |
|
978 |
Valid Mountain Array |
Easy |
|
979 |
DI String Match |
Easy |
|
980 |
Find the Shortest Superstring |
Hard |
|
981 |
Delete Columns to Make Sorted |
Easy |
|
982 |
Minimum Increment to Make Array Unique |
Medium |
|
983 |
Validate Stack Sequences |
Medium |
|
984 |
Most Stones Removed with Same Row or Column |
Medium |
|
985 |
Bag of Tokens |
Medium |
|
986 |
Largest Time for Given Digits |
Medium |
|
987 |
Reveal Cards In Increasing Order |
Medium |
|
988 |
Flip Equivalent Binary Trees |
Medium |
|
989 |
Largest Component Size by Common Factor |
Hard |
|
990 |
Verifying an Alien Dictionary |
Easy |
|
991 |
Array of Doubled Pairs |
Medium |
|
992 |
Delete Columns to Make Sorted II |
Medium |
|
993 |
Tallest Billboard |
Hard |
|
994 |
Prison Cells After N Days |
Medium |
|
998 |
Check Completeness of a Binary Tree |
Medium |
|
999 |
Regions Cut By Slashes |
Medium |
|
1000 |
Delete Columns to Make Sorted III |
Hard |
|
1001 |
N-Repeated Element in Size 2N Array |
Easy |
|
1002 |
Maximum Width Ramp |
Medium |
|
1003 |
Minimum Area Rectangle II |
Medium |
|
1004 |
Least Operators to Express Number |
Hard |
|
1005 |
Univalued Binary Tree |
Easy |
|
1006 |
Vowel Spellchecker |
Medium |
|
1007 |
Numbers With Same Consecutive Differences |
Medium |
|
1008 |
Binary Tree Cameras |
Hard |
|
1009 |
Pancake Sorting |
Medium |
|
1010 |
Powerful Integers |
Medium |
|
1011 |
Flip Binary Tree To Match Preorder Traversal |
Medium |
|
1012 |
Equal Rational Numbers |
Hard |
|
1013 |
Fibonacci Number |
Easy |
|
1014 |
K Closest Points to Origin |
Medium |
|
1016 |
Subarray Sums Divisible by K |
Medium |
|
1017 |
Odd Even Jump |
Hard |
|
1018 |
Largest Perimeter Triangle |
Easy |
|
1019 |
Squares of a Sorted Array |
Easy |
|
1020 |
Longest Turbulent Subarray |
Medium |
|
1021 |
Distribute Coins in Binary Tree |
Medium |
|
1022 |
Unique Paths III |
Hard |
|
1023 |
Time Based Key-Value Store |
Medium |
|
1024 |
Triples with Bitwise AND Equal To Zero |
Hard |
|
1025 |
Minimum Cost For Tickets |
Medium |
|
1026 |
String Without AAA or BBB |
Medium |
|
1027 |
Sum of Even Numbers After Queries |
Easy |
|
1028 |
Interval List Intersections |
Medium |
|
1029 |
Vertical Order Traversal of a Binary Tree |
Hard |
|
1030 |
Smallest String Starting From Leaf |
Medium |
|
1031 |
Add to Array-Form of Integer |
Easy |
|
1032 |
Satisfiability of Equality Equations |
Medium |
|
1033 |
Broken Calculator |
Medium |
|
1034 |
Subarrays with K Different Integers |
Hard |
|
1035 |
Cousins in Binary Tree |
Easy |
|
1036 |
Rotting Oranges |
Medium |
|
1037 |
Minimum Number of K Consecutive Bit Flips |
Hard |
|
1038 |
Number of Squareful Arrays |
Hard |
|
1039 |
Find the Town Judge |
Easy |
|
1040 |
Maximum Binary Tree II |
Medium |
|
1041 |
Available Captures for Rook |
Easy |
|
1042 |
Minimum Cost to Merge Stones |
Hard |
|
1043 |
Grid Illumination |
Hard |
|
1044 |
Find Common Characters |
Easy |
|
1045 |
Check If Word Is Valid After Substitutions |
Medium |
|
1046 |
Max Consecutive Ones III |
Medium |
|
1047 |
Maximize Sum Of Array After K Negations |
Easy |
|
1048 |
Clumsy Factorial |
Medium |
|
1049 |
Minimum Domino Rotations For Equal Row |
Medium |
|
1050 |
Construct Binary Search Tree from Preorder Traversal |
Medium |
|
1054 |
Complement of Base 10 Integer |
Easy |
|
1055 |
Pairs of Songs With Total Durations Divisible by 60 |
Medium |
|
1056 |
Capacity To Ship Packages Within D Days |
Medium |
|
1057 |
Numbers With Repeated Digits |
Hard |
|
1062 |
Partition Array Into Three Parts With Equal Sum |
Easy |
|
1063 |
Best Sightseeing Pair |
Medium |
|
1064 |
Smallest Integer Divisible by K |
Medium |
|
1065 |
Binary String With Substrings Representing 1 To N |
Medium |
|
1070 |
Convert to Base -2 |
Medium |
|
1071 |
Binary Prefix Divisible By 5 |
Easy |
|
1072 |
Next Greater Node In Linked List |
Medium |
|
1073 |
Number of Enclaves |
Medium |
|
1078 |
Remove Outermost Parentheses |
Easy |
|
1079 |
Sum of Root To Leaf Binary Numbers |
Easy |
|
1080 |
Camelcase Matching |
Medium |
|
1081 |
Video Stitching |
Medium |
|
1086 |
Divisor Game |
Easy |
|
1087 |
Longest Arithmetic Subsequence |
Medium |
|
1092 |
Maximum Difference Between Node and Ancestor |
Medium |
|
1093 |
Recover a Tree From Preorder Traversal |
Hard |
|
1094 |
Matrix Cells in Distance Order |
Easy |
|
1095 |
Two City Scheduling |
Medium |
|
1096 |
Maximum Sum of Two Non-Overlapping Subarrays |
Medium |
|
1097 |
Stream of Characters |
Hard |
|
1103 |
Moving Stones Until Consecutive |
Easy |
|
1104 |
Coloring A Border |
Medium |
|
1105 |
Uncrossed Lines |
Medium |
|
1106 |
Escape a Large Maze |
Hard |
|
1111 |
Minimum Score Triangulation of Polygon |
Medium |
|
1112 |
Find Words That Can Be Formed by Characters |
Easy |
|
1113 |
Moving Stones Until Consecutive II |
Medium |
|
1114 |
Binary Search Tree to Greater Sum Tree |
Medium |
|
1115 |
Valid Boomerang |
Easy |
|
1116 |
Maximum Level Sum of a Binary Tree |
Medium |
|
1117 |
As Far from Land as Possible |
Medium |
|
1119 |
Robot Bounded In Circle |
Medium |
|
1120 |
Flower Planting With No Adjacent |
Medium |
|
1121 |
Partition Array for Maximum Sum |
Medium |
|
1122 |
Longest Duplicate Substring |
Hard |
|
1127 |
Last Stone Weight |
Easy |
|
1128 |
Remove All Adjacent Duplicates In String |
Easy |
|
1129 |
Longest String Chain |
Medium |
|
1130 |
Last Stone Weight II |
Medium |
|
1133 |
Last Substring in Lexicographical Order |
Hard |
|
1137 |
Height Checker |
Easy |
|
1138 |
Grumpy Bookstore Owner |
Medium |
|
1139 |
Previous Permutation With One Swap |
Medium |
|
1140 |
Distant Barcodes |
Medium |
|
1145 |
Number of Submatrices That Sum to Target |
Hard |
|
1146 |
Greatest Common Divisor of Strings |
Easy |
|
1147 |
Flip Columns For Maximum Number of Equal Rows |
Medium |
|
1148 |
Adding Two Negabinary Numbers |
Medium |
|
1156 |
Occurrences After Bigram |
Easy |
|
1157 |
Insufficient Nodes in Root to Leaf Paths |
Medium |
|
1159 |
Smallest Subsequence of Distinct Characters |
Medium |
|
1160 |
Letter Tile Possibilities |
Medium |
|
1168 |
Duplicate Zeros |
Easy |
|
1169 |
Largest Values From Labels |
Medium |
|
1170 |
Shortest Common Supersequence |
Hard |
|
1171 |
Shortest Path in Binary Matrix |
Medium |
|
1183 |
Statistics from a Large Sample |
Medium |
|
1184 |
Car Pooling |
Medium |
|
1185 |
Find in Mountain Array |
Hard |
|
1186 |
Building H2O |
Medium |
|
1187 |
Print FooBar Alternately |
Medium |
|
1188 |
Brace Expansion II |
Hard |
|
1194 |
Path In Zigzag Labelled Binary Tree |
Medium |
|
1195 |
Distribute Candies to People |
Easy |
|
1196 |
Filling Bookcase Shelves |
Medium |
|
1197 |
Parsing A Boolean Expression |
Hard |
|
1203 |
Print in Order |
Easy |
|
1205 |
Defanging an IP Address |
Easy |
|
1206 |
Corporate Flight Bookings |
Medium |
|
1207 |
Delete Nodes And Return Forest |
Medium |
|
1208 |
Maximum Nesting Depth of Two Valid Parentheses Strings |
Medium |
|
1210 |
Mean of Array After Removing Some Elements |
Easy |
|
1211 |
Iterator for Combination |
Medium |
|
1212 |
Sequential Digits |
Medium |
|
1216 |
Print Zero Even Odd |
Medium |
|
1217 |
Relative Sort Array |
Easy |
|
1218 |
Lowest Common Ancestor of Deepest Leaves |
Medium |
|
1219 |
Longest Well-Performing Interval |
Medium |
|
1220 |
Smallest Sufficient Team |
Hard |
|
1221 |
Element Appearing More Than 25% In Sorted Array |
Easy |
|
1222 |
Remove Covered Intervals |
Medium |
|
1223 |
Graph Connectivity With Threshold |
Hard |
|
1224 |
Minimum Falling Path Sum II |
Hard |
|
1227 |
Number of Equivalent Domino Pairs |
Easy |
|
1228 |
Minimum Cost Tree From Leaf Values |
Medium |
|
1229 |
Shortest Path with Alternating Colors |
Medium |
|
1230 |
Maximum of Absolute Value Expression |
Medium |
|
1231 |
Replace Elements with Greatest Element on Right Side |
Easy |
|
1232 |
Sum of Mutated Array Closest to Target |
Medium |
|
1234 |
Number of Paths with Max Score |
Hard |
|
1236 |
N-th Tribonacci Number |
Easy |
|
1238 |
Alphabet Board Path |
Medium |
|
1239 |
Largest 1-Bordered Square |
Medium |
|
1240 |
Stone Game II |
Medium |
|
1241 |
Decompress Run-Length Encoded List |
Easy |
|
1242 |
Matrix Block Sum |
Medium |
|
1243 |
Sum of Nodes with Even-Valued Grandparent |
Medium |
|
1244 |
Distinct Echo Substrings |
Hard |
|
1247 |
Decrease Elements To Make Array Zigzag |
Medium |
|
1248 |
Binary Tree Coloring Game |
Medium |
|
1249 |
Snapshot Array |
Medium |
|
1250 |
Longest Common Subsequence |
Medium |
|
1251 |
Longest Chunked Palindrome Decomposition |
Hard |
|
1252 |
Break a Palindrome |
Medium |
|
1253 |
Sort the Matrix Diagonally |
Medium |
|
1254 |
Deepest Leaves Sum |
Medium |
|
1255 |
Reverse Subarray To Maximize Array Value |
Hard |
|
1256 |
Rank Transform of an Array |
Easy |
|
1257 |
Rank Transform of a Matrix |
Hard |
|
1260 |
Day of the Year |
Easy |
|
1261 |
Swap For Longest Repeated Character Substring |
Medium |
|
1262 |
Online Majority Element In Subarray |
Hard |
|
1263 |
Number of Dice Rolls With Target Sum |
Medium |
|
1267 |
Remove Zero Sum Consecutive Nodes from Linked List |
Medium |
|
1270 |
Dinner Plate Stacks |
Hard |
|
1272 |
Invalid Transactions |
Medium |
|
1273 |
Compare Strings by Frequency of the Smallest Character |
Medium |
|
1274 |
Number of Days Between Two Dates |
Easy |
|
1275 |
Validate Binary Tree Nodes |
Medium |
|
1276 |
Closest Divisors |
Medium |
|
1277 |
Largest Multiple of Three |
Hard |
|
1279 |
Prime Arrangements |
Easy |
|
1281 |
Can Make Palindrome from Substring |
Medium |
|
1282 |
Number of Valid Words for Each Puzzle |
Hard |
|
1283 |
Reformat Date |
Easy |
|
1284 |
Four Divisors |
Medium |
|
1285 |
Balance a Binary Search Tree |
Medium |
|
1286 |
Constrained Subsequence Sum |
Hard |
|
1287 |
Distance Between Bus Stops |
Easy |
|
1288 |
Maximum Subarray Sum with One Deletion |
Medium |
|
1289 |
Day of the Week |
Easy |
|
1290 |
Make Array Strictly Increasing |
Hard |
|
1293 |
Three Consecutive Odds |
Easy |
|
1296 |
Kth Ancestor of a Tree Node |
Hard |
|
1297 |
Maximum Number of Balloons |
Easy |
|
1298 |
Reverse Substrings Between Each Pair of Parentheses |
Medium |
|
1299 |
K-Concatenation Maximum Sum |
Medium |
|
1300 |
Critical Connections in a Network |
Hard |
|
1301 |
Reformat Department Table |
Easy |
|
1304 |
Longest Happy String |
Medium |
|
1306 |
Minimum Absolute Difference |
Easy |
|
1307 |
Ugly Number III |
Medium |
|
1308 |
Smallest String With Swaps |
Medium |
|
1309 |
Sort Items by Groups Respecting Dependencies |
Hard |
|
1316 |
Fizz Buzz Multithreaded |
Medium |
|
1319 |
Unique Number of Occurrences |
Easy |
|
1320 |
Remove All Adjacent Duplicates in String II |
Medium |
|
1321 |
Get Equal Substrings Within Budget |
Medium |
|
1322 |
Minimum Moves to Reach Target with Rotations |
Hard |
|
1324 |
Where Will the Ball Fall |
Medium |
|
1325 |
Path with Maximum Probability |
Medium |
|
1329 |
Minimum Cost to Move Chips to The Same Position |
Easy |
|
1330 |
Longest Arithmetic Subsequence of Given Difference |
Medium |
|
1331 |
Path with Maximum Gold |
Medium |
|
1332 |
Count Vowels Permutation |
Hard |
|
1337 |
Design Skiplist |
Hard |
|
1340 |
The Dining Philosophers |
Medium |
|
1341 |
Split a String in Balanced Strings |
Easy |
|
1342 |
Queens That Can Attack the King |
Medium |
|
1343 |
Dice Roll Simulation |
Hard |
|
1344 |
Maximum Equal Frequency |
Hard |
|
1349 |
Check If It Is a Straight Line |
Easy |
|
1350 |
Remove Sub-Folders from the Filesystem |
Medium |
|
1351 |
Replace the Substring for Balanced String |
Medium |
|
1352 |
Maximum Profit in Job Scheduling |
Hard |
|
1358 |
Find Positive Integer Solution for a Given Equation |
Medium |
|
1359 |
Circular Permutation in Binary Representation |
Medium |
|
1360 |
Maximum Length of a Concatenated String with Unique Characters |
Medium |
|
1361 |
Tiling a Rectangle with the Fewest Squares |
Hard |
|
1362 |
Airplane Seat Assignment Probability |
Medium |
|
1364 |
Tuple with Same Product |
Medium |
|
1367 |
Maximum Height by Stacking Cuboids |
Hard |
|
1369 |
Minimum Swaps to Make Strings Equal |
Medium |
|
1370 |
Count Number of Nice Subarrays |
Medium |
|
1371 |
Minimum Remove to Make Valid Parentheses |
Medium |
|
1372 |
Check If It Is a Good Array |
Hard |
|
1378 |
Cells with Odd Values in a Matrix |
Easy |
|
1379 |
Reconstruct a 2-Row Binary Matrix |
Medium |
|
1380 |
Number of Closed Islands |
Medium |
|
1381 |
Maximum Score Words Formed by Letters |
Hard |
|
1386 |
Shift 2D Grid |
Easy |
|
1387 |
Find Elements in a Contaminated Binary Tree |
Medium |
|
1388 |
Greatest Sum Divisible by Three |
Medium |
|
1389 |
Minimum Moves to Move a Box to Their Target Location |
Hard |
|
1395 |
Minimum Time Visiting All Points |
Easy |
|
1396 |
Count Servers that Communicate |
Medium |
|
1397 |
Search Suggestions System |
Medium |
|
1398 |
Number of Ways to Stay in the Same Place After Some Steps |
Hard |
|
1400 |
Find Winner on a Tic Tac Toe Game |
Easy |
|
1401 |
Number of Burgers with No Waste of Ingredients |
Medium |
|
1402 |
Count Square Submatrices with All Ones |
Medium |
|
1403 |
Palindrome Partitioning III |
Hard |
|
1406 |
Subtract the Product and Sum of Digits of an Integer |
Easy |
|
1407 |
Group the People Given the Group Size They Belong To |
Medium |
|
1408 |
Find the Smallest Divisor Given a Threshold |
Medium |
|
1409 |
Minimum Number of Flips to Convert Binary Matrix to Zero Matrix |
Hard |
|
1411 |
Convert Binary Number in a Linked List to Integer |
Easy |
|
1413 |
Maximum Side Length of a Square with Sum Less than or Equal to Threshold |
Medium |
|
1414 |
Shortest Path in a Grid with Obstacles Elimination |
Hard |
|
1421 |
Find Numbers with Even Number of Digits |
Easy |
|
1422 |
Divide Array in Sets of K Consecutive Numbers |
Medium |
|
1423 |
Maximum Number of Occurrences of a Substring |
Medium |
|
1424 |
Maximum Candies You Can Get from Boxes |
Hard |
|
1426 |
Find N Unique Integers Sum up to Zero |
Easy |
|
1427 |
All Elements in Two Binary Search Trees |
Medium |
|
1428 |
Jump Game III |
Medium |
|
1429 |
Verbal Arithmetic Puzzle |
Hard |
|
1434 |
Decrypt String from Alphabet to Integer Mapping |
Easy |
|
1435 |
XOR Queries of a Subarray |
Medium |
|
1436 |
Get Watched Videos by Your Friends |
Medium |
|
1437 |
Minimum Insertion Steps to Make a String Palindrome |
Hard |
|
1440 |
Convert Integer to the Sum of Two No-Zero Integers |
Easy |
|
1441 |
Minimum Flips to Make a OR b Equal to c |
Medium |
|
1442 |
Number of Operations to Make Network Connected |
Medium |
|
1443 |
Minimum Distance to Type a Word Using Two Fingers |
Hard |
|
1444 |
Number of Steps to Reduce a Number to Zero |
Easy |
|
1445 |
Number of Sub-arrays of Size K and Average Greater than or Equal to Threshold |
Medium |
|
1446 |
Angle Between Hands of a Clock |
Medium |
|
1447 |
Jump Game IV |
Hard |
|
1448 |
Maximum 69 Number |
Easy |
|
1449 |
Print Words Vertically |
Medium |
|
1450 |
Delete Leaves With a Given Value |
Medium |
|
1451 |
Minimum Number of Taps to Open to Water a Garden |
Hard |
|
1454 |
Remove Palindromic Subsequences |
Easy |
|
1455 |
Filter Restaurants by Vegan-Friendly, Price and Distance |
Medium |
|
1456 |
Find the City With the Smallest Number of Neighbors at a Threshold Distance |
Medium |
|
1457 |
Minimum Difficulty of a Job Schedule |
Hard |
|
1458 |
Sort Integers by The Number of 1 Bits |
Easy |
|
1459 |
Apply Discount Every n Orders |
Medium |
|
1460 |
Number of Substrings Containing All Three Characters |
Medium |
|
1461 |
Count All Valid Pickup and Delivery Options |
Hard |
|
1463 |
The K Weakest Rows in a Matrix |
Easy |
|
1464 |
Reduce Array Size to The Half |
Medium |
|
1465 |
Maximum Product of Splitted Binary Tree |
Medium |
|
1466 |
Jump Game V |
Hard |
|
1468 |
Check If N and Its Double Exist |
Easy |
|
1469 |
Minimum Number of Steps to Make Two Strings Anagram |
Medium |
|
1470 |
Tweet Counts Per Frequency |
Medium |
|
1471 |
Maximum Students Taking Exam |
Hard |
|
1472 |
Increasing Decreasing String |
Easy |
|
1473 |
Find the Longest Substring Containing Vowels in Even Counts |
Medium |
|
1474 |
Longest ZigZag Path in a Binary Tree |
Medium |
|
1475 |
Maximum Sum BST in Binary Tree |
Hard |
|
1476 |
Count Negative Numbers in a Sorted Matrix |
Easy |
|
1477 |
Product of the Last K Numbers |
Medium |
|
1478 |
Maximum Number of Events That Can Be Attended |
Medium |
|
1479 |
Construct Target Array With Multiple Sums |
Hard |
|
1482 |
How Many Numbers Are Smaller Than the Current Number |
Easy |
|
1483 |
Rank Teams by Votes |
Medium |
|
1484 |
Linked List in Binary Tree |
Medium |
|
1485 |
Minimum Cost to Make at Least One Valid Path in a Grid |
Hard |
|
1486 |
Find the Distance Value Between Two Arrays |
Easy |
|
1487 |
Cinema Seat Allocation |
Medium |
|
1488 |
Sort Integers by The Power Value |
Medium |
|
1489 |
Pizza With 3n Slices |
Hard |
|
1490 |
Generate a String With Characters That Have Odd Counts |
Easy |
|
1491 |
Bulb Switcher III |
Medium |
|
1492 |
Time Needed to Inform All Employees |
Medium |
|
1493 |
Frog Position After T Seconds |
Hard |
|
1496 |
Lucky Numbers in a Matrix |
Easy |
|
1497 |
Design a Stack With Increment Operation |
Medium |
|
1498 |
Find a Corresponding Node of a Binary Tree in a Clone of That Tree |
Medium |
|
1499 |
Maximum Performance of a Team |
Hard |
|
1500 |
Count Largest Group |
Easy |
|
1501 |
Circle and Rectangle Overlapping |
Medium |
|
1502 |
Construct K Palindrome Strings |
Medium |
|
1503 |
Reducing Dishes |
Hard |
|
1505 |
Create Target Array in the Given Order |
Easy |
|
1507 |
Check if There is a Valid Path in a Grid |
Medium |
|
1508 |
Longest Happy Prefix |
Hard |
|
1510 |
Find Lucky Integer in an Array |
Easy |
|
1511 |
Count Number of Teams |
Medium |
|
1512 |
Design Underground System |
Medium |
|
1513 |
Find All Good Strings |
Hard |
|
1514 |
Minimum Value to Get Positive Step by Step Sum |
Easy |
|
1515 |
Find the Minimum Number of Fibonacci Numbers Whose Sum Is K |
Medium |
|
1516 |
The k-th Lexicographical String of All Happy Strings of Length n |
Medium |
|
1517 |
Restore The Array |
Hard |
|
1519 |
Minimum Subsequence in Non-Increasing Order |
Easy |
|
1520 |
Number of Steps to Reduce a Number in Binary Representation to One |
Medium |
|
1522 |
Stone Game III |
Hard |
|
1524 |
String Matching in an Array |
Easy |
|
1525 |
Queries on a Permutation With Key |
Medium |
|
1526 |
HTML Entity Parser |
Medium |
|
1527 |
Number of Ways to Paint N Γ 3 Grid |
Hard |
|
1528 |
Kids With the Greatest Number of Candies |
Easy |
|
1529 |
Max Difference You Can Get From Changing an Integer |
Medium |
|
1530 |
Check If a String Can Break Another String |
Medium |
|
1531 |
Number of Ways to Wear Different Hats to Each Other |
Hard |
|
1532 |
Reformat The String |
Easy |
|
1533 |
Display Table of Food Orders in a Restaurant |
Medium |
|
1534 |
Minimum Number of Frogs Croaking |
Medium |
|
1535 |
Build Array Where You Can Find The Maximum Exactly K Comparisons |
Hard |
|
1537 |
Maximum Score After Splitting a String |
Easy |
|
1538 |
Maximum Points You Can Obtain from Cards |
Medium |
|
1539 |
Diagonal Traverse II |
Medium |
|
1542 |
Consecutive Characters |
Easy |
|
1543 |
Simplified Fractions |
Medium |
|
1544 |
Count Good Nodes in Binary Tree |
Medium |
|
1545 |
Form Largest Integer With Digits That Add up to Target |
Hard |
|
1547 |
Destination City |
Easy |
|
1548 |
Check If All 1's Are at Least Length K Places Away |
Easy |
|
1549 |
Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit |
Medium |
|
1550 |
Find the Kth Smallest Sum of a Matrix With Sorted Rows |
Hard |
|
1552 |
Build an Array With Stack Operations |
Easy |
|
1553 |
Count Triplets That Can Form Two Arrays of Equal XOR |
Medium |
|
1554 |
Minimum Time to Collect All Apples in a Tree |
Medium |
|
1555 |
Number of Ways of Cutting a Pizza |
Hard |
|
1556 |
Make Two Arrays Equal by Reversing Sub-arrays |
Easy |
|
1557 |
Check If a String Contains All Binary Codes of Size K |
Medium |
|
1558 |
Course Schedule IV |
Medium |
|
1559 |
Cherry Pickup II |
Hard |
|
1560 |
Number of Students Doing Homework at a Given Time |
Easy |
|
1561 |
Rearrange Words in a Sentence |
Medium |
|
1562 |
People Whose List of Favorite Companies Is Not a Subset of Another List |
Medium |
|
1563 |
Maximum Number of Darts Inside of a Circular Dartboard |
Hard |
|
1566 |
Check If a Word Occurs As a Prefix of Any Word in a Sentence |
Easy |
|
1567 |
Maximum Number of Vowels in a Substring of Given Length |
Medium |
|
1568 |
Pseudo-Palindromic Paths in a Binary Tree |
Medium |
|
1569 |
Max Dot Product of Two Subsequences |
Hard |
|
1570 |
Final Prices With a Special Discount in a Shop |
Easy |
|
1571 |
Allocate Mailboxes |
Hard |
|
1572 |
Subrectangle Queries |
Medium |
|
1573 |
Find Two Non-overlapping Sub-arrays Each With Target Sum |
Medium |
|
1574 |
Maximum Product of Two Elements in an Array |
Easy |
|
1575 |
Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts |
Medium |
|
1576 |
Reorder Routes to Make All Paths Lead to the City Zero |
Medium |
|
1577 |
Probability of a Two Boxes Having The Same Number of Distinct Balls |
Hard |
|
1580 |
Shuffle the Array |
Easy |
|
1581 |
The k Strongest Values in an Array |
Medium |
|
1582 |
Design Browser History |
Medium |
|
1583 |
Paint House III |
Hard |
|
1584 |
Average Salary Excluding the Minimum and Maximum Salary |
Easy |
|
1585 |
The kth Factor of n |
Medium |
|
1586 |
Longest Subarray of 1's After Deleting One Element |
Medium |
|
1587 |
Parallel Courses II |
Hard |
|
1603 |
Running Sum of 1d Array |
Easy |
|
1604 |
Least Number of Unique Integers after K Removals |
Medium |
|
1605 |
Minimum Number of Days to Make m Bouquets |
Medium |
|
1610 |
XOR Operation in an Array |
Easy |
|
1611 |
Making File Names Unique |
Medium |
|
1612 |
Avoid Flood in The City |
Medium |
|
1613 |
Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree |
Hard |
|
1615 |
Range Sum of Sorted Subarray Sums |
Medium |
|
1616 |
Minimum Difference Between Largest and Smallest Value in Three Moves |
Medium |
|
1617 |
Stone Game IV |
Hard |
|
1619 |
Path Crossing |
Easy |
|
1620 |
Check If Array Pairs Are Divisible by k |
Medium |
|
1621 |
Number of Subsequences That Satisfy the Given Sum Condition |
Medium |
|
1622 |
Max Value of Equation |
Hard |
|
1626 |
Can Make Arithmetic Progression From Sequence |
Easy |
|
1627 |
Last Moment Before All Ants Fall Out of a Plank |
Medium |
|
1628 |
Count Submatrices With All Ones |
Medium |
|
1629 |
Minimum Possible Integer After at Most K Adjacent Swaps On Digits |
Hard |
|
1630 |
Count Odd Numbers in an Interval Range |
Easy |
|
1631 |
Number of Sub-arrays With Odd Sum |
Medium |
|
1632 |
Number of Good Ways to Split a String |
Medium |
|
1633 |
Minimum Number of Increments on Subarrays to Form a Target Array |
Hard |
|
1635 |
Number of Good Pairs |
Easy |
|
1636 |
Number of Substrings With Only 1s |
Medium |
|
1637 |
String Compression II |
Hard |
|
1638 |
Best Position for a Service Centre |
Hard |
|
1642 |
Water Bottles |
Easy |
|
1643 |
Number of Nodes in the Sub-Tree With the Same Label |
Medium |
|
1644 |
Maximum Number of Non-Overlapping Substrings |
Hard |
|
1645 |
Find a Value of a Mysterious Function Closest to Target |
Hard |
|
1646 |
Kth Missing Positive Number |
Easy |
|
1647 |
Can Convert String in K Moves |
Medium |
|
1648 |
Minimum Insertions to Balance a Parentheses String |
Medium |
|
1649 |
Maximum Number of Non-Overlapping Subarrays With Sum Equals Target |
Medium |
|
1651 |
Shuffle String |
Easy |
|
1652 |
Bulb Switcher IV |
Medium |
|
1653 |
Number of Good Leaf Nodes Pairs |
Medium |
|
1656 |
Count Good Triplets |
Easy |
|
1657 |
Find the Winner of an Array Game |
Medium |
|
1658 |
Minimum Swaps to Arrange a Binary Grid |
Medium |
|
1659 |
Get the Maximum Score |
Hard |
|
1660 |
Thousand Separator |
Easy |
|
1661 |
Minimum Number of Vertices to Reach All Nodes |
Medium |
|
1662 |
Minimum Numbers of Function Calls to Make Target Array |
Medium |
|
1663 |
Detect Cycles in 2D Grid |
Hard |
|
1666 |
Make The String Great |
Easy |
|
1667 |
Find Kth Bit in Nth Binary String |
Medium |
|
1668 |
Find Longest Awesome Substring |
Hard |
|
1669 |
Minimum Cost to Cut a Stick |
Hard |
|
1674 |
Minimum Operations to Make Array Equal |
Medium |
|
1675 |
Magnetic Force Between Two Balls |
Medium |
|
1676 |
Minimum Number of Days to Eat N Oranges |
Hard |
|
1677 |
Matrix Diagonal Sum |
Easy |
|
1678 |
Number of Ways to Split a String |
Medium |
|
1679 |
Shortest Subarray to be Removed to Make Array Sorted |
Medium |
|
1680 |
Count All Possible Routes |
Hard |
|
1682 |
Most Visited Sector in a Circular Track |
Easy |
|
1683 |
Maximum Number of Coins You Can Get |
Medium |
|
1684 |
Find Latest Group of Size M |
Medium |
|
1685 |
Stone Game V |
Hard |
|
1689 |
Detect Pattern of Length M Repeated K or More Times |
Easy |
|
1690 |
Maximum Length of Subarray With Positive Product |
Medium |
|
1691 |
Minimum Number of Days to Disconnect Island |
Hard |
|
1692 |
Number of Ways to Reorder Array to Get Same BST |
Hard |
|
1693 |
Sum of All Odd Length Subarrays |
Easy |
|
1694 |
Make Sum Divisible by P |
Medium |
|
1695 |
Maximum Sum Obtained of Any Permutation |
Medium |
|
1696 |
Strange Printer II |
Hard |
|
1698 |
Replace All ?'s to Avoid Consecutive Repeating Characters |
Easy |
|
1699 |
Number of Ways Where Square of Number Is Equal to Product of Two Numbers |
Medium |
|
1700 |
Minimum Deletion Cost to Avoid Repeating Letters |
Medium |
|
1701 |
Remove Max Number of Edges to Keep Graph Fully Traversable |
Hard |
|
1704 |
Special Positions in a Binary Matrix |
Easy |
|
1705 |
Count Unhappy Friends |
Medium |
|
1706 |
Min Cost to Connect All Points |
Medium |
|
1707 |
Check If String Is Transformable With Substring Sort Operations |
Hard |
|
1708 |
Design Parking System |
Easy |
|
1709 |
Alert Using Same Key-Card Three or More Times in a One Hour Period |
Medium |
|
1710 |
Find Servers That Handled Most Number of Requests |
Hard |
|
1711 |
Find Valid Matrix Given Row and Column Sums |
Medium |
|
1714 |
Rearrange Spaces Between Words |
Easy |
|
1715 |
Split a String Into the Max Number of Unique Substrings |
Medium |
|
1716 |
Maximum Non Negative Product in a Matrix |
Medium |
|
1717 |
Minimum Cost to Connect Two Groups of Points |
Hard |
|
1720 |
Crawler Log Folder |
Easy |
|
1721 |
Maximum Profit of Operating a Centennial Wheel |
Medium |
|
1722 |
Throne Inheritance |
Medium |
|
1723 |
Maximum Number of Achievable Transfer Requests |
Hard |
|
1725 |
Number of Sets of K Non-Overlapping Line Segments |
Medium |
|
1726 |
Coordinate With Maximum Network Quality |
Medium |
|
1727 |
Cat and Mouse II |
Hard |
|
1728 |
Fancy Sequence |
Hard |
|
1730 |
Special Array With X Elements Greater Than or Equal X |
Easy |
|
1731 |
Even Odd Tree |
Medium |
|
1732 |
Minimum One Bit Operations to Make Integers Zero |
Hard |
|
1733 |
Maximum Number of Visible Points |
Hard |
|
1737 |
Maximum Nesting Depth of the Parentheses |
Easy |
|
1738 |
Maximal Network Rank |
Medium |
|
1739 |
Split Two Strings to Make Palindrome |
Medium |
|
1740 |
Count Subtrees With Max Distance Between Cities |
Hard |
|
1741 |
Sort Array by Increasing Frequency |
Easy |
|
1742 |
Widest Vertical Area Between Two Points Containing No Points |
Medium |
|
1743 |
Count Substrings That Differ by One Character |
Medium |
|
1744 |
Number of Ways to Form a Target String Given a Dictionary |
Hard |
|
1746 |
Largest Substring Between Two Equal Characters |
Easy |
|
1747 |
Lexicographically Smallest String After Applying Operations |
Medium |
|
1748 |
Best Team With No Conflicts |
Medium |
|
1751 |
Slowest Key |
Easy |
|
1752 |
Arithmetic Subarrays |
Medium |
|
1753 |
Path With Minimum Effort |
Medium |
|
1755 |
Defuse the Bomb |
Easy |
|
1756 |
Minimum Deletions to Make String Balanced |
Medium |
|
1757 |
Minimum Jumps to Reach Home |
Medium |
|
1758 |
Distribute Repeating Integers |
Hard |
|
1760 |
Check Array Formation Through Concatenation |
Easy |
|
1761 |
Count Sorted Vowel Strings |
Medium |
|
1762 |
Furthest Building You Can Reach |
Medium |
|
1764 |
Maximum Repeating Substring |
Easy |
|
1765 |
Merge In Between Linked Lists |
Medium |
|
1766 |
Minimum Number of Removals to Make Mountain Array |
Hard |
|
1767 |
Design Front Middle Back Queue |
Medium |
|
1769 |
Get Maximum in Generated Array |
Easy |
|
1770 |
Minimum Deletions to Make Character Frequencies Unique |
Medium |
|
1771 |
Sell Diminishing-Valued Colored Balls |
Medium |
|
1772 |
Create Sorted Array through Instructions |
Hard |
|
1775 |
Design an Ordered Stream |
Easy |
|
1776 |
Minimum Operations to Reduce X to Zero |
Medium |
|
1777 |
Determine if Two Strings Are Close |
Medium |
|
1778 |
Maximize Grid Happiness |
Hard |
|
1781 |
Check If Two String Arrays are Equivalent |
Easy |
|
1782 |
Smallest String With A Given Numeric Value |
Medium |
|
1783 |
Ways to Make a Fair Array |
Medium |
|
1784 |
Minimum Initial Energy to Finish Tasks |
Hard |
|
1786 |
Count the Number of Consistent Strings |
Easy |
|
1787 |
Sum of Absolute Differences in a Sorted Array |
Medium |
|
1788 |
Stone Game VI |
Medium |
|
1789 |
Delivering Boxes from Storage to Ports |
Hard |
|
1791 |
Richest Customer Wealth |
Easy |
|
1792 |
Find the Most Competitive Subsequence |
Medium |
|
1793 |
Minimum Moves to Make Array Complementary |
Medium |
|
1794 |
Minimize Deviation in Array |
Hard |
|
1797 |
Goal Parser Interpretation |
Easy |
|
1798 |
Max Number of K-Sum Pairs |
Medium |
|
1799 |
Minimum Incompatibility |
Hard |
|
1800 |
Concatenation of Consecutive Binary Numbers |
Medium |
|
1802 |
Number of Students Unable to Eat Lunch |
Easy |
|
1803 |
Average Waiting Time |
Medium |
|
1804 |
Maximum Binary String After Change |
Medium |
|
1805 |
Minimum Adjacent Swaps for K Consecutive Ones |
Hard |
|
1806 |
Count of Matches in Tournament |
Easy |
|
1807 |
Partitioning Into Minimum Number Of Deci-Binary Numbers |
Medium |
|
1808 |
Stone Game VII |
Medium |
|
1812 |
Reformat Phone Number |
Easy |
|
1813 |
Maximum Erasure Value |
Medium |
|
1814 |
Jump Game VI |
Medium |
|
1815 |
Checking Existence of Edge Length Limited Paths |
Hard |
|
1817 |
Calculate Money in Leetcode Bank |
Easy |
|
1818 |
Maximum Score From Removing Substrings |
Medium |
|
1819 |
Construct the Lexicographically Largest Valid Sequence |
Medium |
|
1820 |
Number Of Ways To Reconstruct A Tree |
Hard |
|
1823 |
Determine if String Halves Are Alike |
Easy |
|
1824 |
Maximum Number of Eaten Apples |
Medium |
|
1825 |
Find Minimum Time to Finish All Jobs |
Hard |
|
1826 |
Maximum XOR With an Element From Array |
Hard |
|
1829 |
Maximum Units on a Truck |
Easy |
|
1830 |
Count Good Meals |
Medium |
|
1831 |
Ways to Split Array Into Three Subarrays |
Medium |
|
1832 |
Minimum Operations to Make a Subsequence |
Hard |
|
1833 |
Find the Highest Altitude |
Easy |
|
1834 |
Minimum Number of People to Teach |
Medium |
|
1835 |
Decode XORed Permutation |
Medium |
|
1836 |
Count Ways to Make Array With Product |
Hard |
|
1839 |
Decode XORed Array |
Easy |
|
1840 |
Minimize Hamming Distance After Swap Operations |
Medium |
|
1843 |
Number Of Rectangles That Can Form The Largest Square |
Easy |
|
1844 |
Maximum Number of Balls in a Box |
Easy |
|
1845 |
Largest Submatrix With Rearrangements |
Medium |
|
1848 |
Sum of Unique Elements |
Easy |
|
1849 |
Maximum Absolute Sum of Any Subarray |
Medium |
|
1850 |
Minimum Length of String After Deleting Similar Ends |
Medium |
|
1851 |
Maximum Number of Events That Can Be Attended II |
Hard |
|
1858 |
Latest Time by Replacing Hidden Digits |
Easy |
|
1859 |
Change Minimum Characters to Satisfy One of Three Conditions |
Medium |
|
1860 |
Find Kth Largest XOR Coordinate Value |
Medium |
|
1861 |
Building Boxes |
Hard |
|
1866 |
Restore the Array From Adjacent Pairs |
Medium |
|
1871 |
Palindrome Partitioning IV |
Hard |
|
1872 |
Can You Eat Your Favorite Candy on Your Favorite Day? |
Medium |
|
1873 |
Longest Nice Substring |
Easy |
|
1874 |
Form Array by Concatenating Subarrays of Another Array |
Medium |
|
1875 |
Tree of Coprimes |
Hard |
|
1876 |
Map of Highest Peak |
Medium |
|
1878 |
Check if Array Is Sorted and Rotated |
Easy |
|
1879 |
Maximum Score From Removing Stones |
Medium |
|
1880 |
Largest Merge Of Two Strings |
Medium |
|
1881 |
Closest Subsequence Sum |
Hard |
|
1884 |
Minimum Changes To Make Alternating Binary String |
Easy |
|
1885 |
Count Number of Homogenous Substrings |
Medium |
|
1886 |
Minimum Limit of Balls in a Bag |
Medium |
|
1887 |
Minimum Degree of a Connected Trio in a Graph |
Hard |
|
1894 |
Merge Strings Alternately |
Easy |
|
1895 |
Minimum Number of Operations to Move All Balls to Each Box |
Medium |
|
1896 |
Maximum Score from Performing Multiplication Operations |
Medium |
|
1897 |
Maximize Palindrome Length From Subsequences |
Hard |
|