1 | Two Sum |
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 |
21 | Merge Two Sorted Lists |
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 |
27 | Remove Element |
28 | Find the Index of the First Occurrence in a String |
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 |
43 | Multiply Strings |
44 | Wildcard Matching |
45 | Jump Game II |
46 | Permutations |
47 | Permutations II |
48 | Rotate Image |
49 | Group Anagrams |
50 | Pow(x, 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 |
60 | Permutation Sequence |
61 | Rotate List |
62 | Unique Paths |
63 | Unique Paths II |
64 | Minimum Path Sum |
65 | Valid Number |
66 | Plus One |
67 | Add Binary |
68 | Text Justification |
69 | Sqrt(x) |
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 |
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 |
92 | Reverse Linked List II |
93 | Restore IP Addresses |
94 | Binary Tree Inorder Traversal |
95 | Unique Binary Search Trees II |
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 |
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 | Pascal’s 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 |
126 | Word Ladder II |
127 | Word Ladder |
128 | Longest Consecutive Sequence |
130 | Surrounded Regions |
131 | Palindrome Partitioning |
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 |
146 | LRU Cache |
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 |
158 | Read N Characters Given read4 II - Call Multiple Times |
159 | Longest Substring with At Most Two Distinct Characters |
161 | One Edit Distance |
162 | Find Peak Element |
163 | Missing Ranges |
164 | Maximum Gap |
166 | Fraction to Recurring Decimal |
167 | Two Sum II - Input Array Is Sorted |
168 | Excel Sheet Column Title |
169 | Majority Element |
171 | Excel Sheet Column Number |
173 | Binary Search Tree Iterator |
175 | Combine Two Tables |
176 | Second Highest Salary |
178 | Rank Scores |
179 | Largest Number |
181 | Employees Earning More Than Their Managers |
184 | Department Highest Salary |
185 | Department Top Three Salaries |
187 | Repeated DNA Sequences |
188 | Best Time to Buy and Sell Stock IV |
189 | Rotate Array |
190 | Reverse Bits |
191 | Number of 1 Bits |
193 | Valid Phone Numbers |
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 |
207 | Course Schedule |
208 | Implement Trie (Prefix Tree) |
209 | Minimum Size Subarray Sum |
210 | Course Schedule II |
211 | Design Add and Search Words Data Structure |
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 |
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 |
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 |
237 | Delete Node in a Linked List |
238 | Product of Array Except Self |
239 | Sliding Window Maximum |
240 | Search a 2D Matrix II |
241 | Different Ways to Add Parentheses |
242 | Valid Anagram |
244 | Shortest Word Distance II |
246 | Strobogrammatic Number |
247 | Strobogrammatic Number II |
249 | Group Shifted Strings |
250 | Count Univalue Subtrees |
251 | Flatten 2D Vector |
252 | Meeting Rooms |
253 | Meeting Rooms II |
257 | Binary Tree Paths |
258 | Add Digits |
259 | 3Sum Smaller |
261 | Graph Valid Tree |
264 | Ugly Number 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 |
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 |
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 |
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 |
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 |
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 |
320 | Generalized Abbreviation |
321 | Create Maximum Number |
322 | Coin Change |
323 | Number of Connected Components in an Undirected Graph |
324 | Wiggle Sort II |
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 |
334 | Increasing Triplet Subsequence |
336 | Palindrome Pairs |
337 | House Robber III |
338 | Counting Bits |
340 | Longest Substring with At Most K Distinct Characters |
341 | Flatten Nested List Iterator |
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 |
351 | Android Unlock Patterns |
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 |
365 | Water and Jug Problem |
366 | Find Leaves of Binary Tree |
367 | Valid Perfect Square |
368 | Largest Divisible Subset |
369 | Plus One Linked List |
370 | Range Addition |
373 | Find K Pairs with Smallest Sums |
374 | Guess Number Higher or Lower |
375 | Guess Number Higher or Lower II |
377 | Combination Sum IV |
378 | Kth Smallest Element in a Sorted Matrix |
379 | Design Phone Directory |
380 | Insert Delete GetRandom O(1) |
381 | Insert Delete GetRandom O(1) - Duplicates allowed |
382 | Linked List Random Node |
383 | Ransom Note |
384 | Shuffle an Array |
387 | First Unique Character in a String |
388 | Longest Absolute File Path |
389 | Find the Difference |
391 | Perfect Rectangle |
392 | Is Subsequence |
393 | UTF-8 Validation |
394 | Decode String |
395 | Longest Substring with At Least K Repeating Characters |
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 |
410 | Split Array Largest Sum |
411 | Minimum Unique Word Abbreviation |
412 | Fizz Buzz |
413 | Arithmetic Slices |
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 |
424 | Longest Repeating Character Replacement |
425 | Word Squares |
432 | All O`one Data Structure |
435 | Non-overlapping Intervals |
437 | Path Sum III |
438 | Find All Anagrams in a String |
441 | Arranging Coins |
442 | Find All Duplicates in an Array |
443 | String Compression |
444 | Sequence Reconstruction |
447 | Number of Boomerangs |
448 | Find All Numbers Disappeared in an Array |
450 | Delete Node in a BST |
451 | Sort Characters By Frequency |
452 | Minimum Number of Arrows to Burst Balloons |
454 | 4Sum II |
458 | Poor Pigs |
459 | Repeated Substring Pattern |
460 | LFU Cache |
463 | Island Perimeter |
465 | Optimal Account Balancing |
469 | Convex Polygon |
471 | Encode String with Shortest Length |
473 | Matchsticks to Square |
474 | Ones and Zeroes |
475 | Heaters |
476 | Number Complement |
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 |
490 | The Maze |
493 | Reverse Pairs |
494 | Target Sum |
496 | Next Greater Element I |
498 | Diagonal Traverse |
499 | The Maze III |
501 | Find Mode in Binary Search Tree |
503 | Next Greater Element II |
505 | The Maze II |
506 | Relative Ranks |
507 | Perfect Number |
510 | Count Subarrays With More Ones Than Zeros |
511 | All Paths from Source Lead to Destination |
514 | Freedom Trail |
516 | Longest Palindromic Subsequence |
518 | Coin Change II |
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 |
530 | Minimum Absolute Difference in BST |
531 | Lonely Pixel I |
532 | K-diff Pairs in an Array |
533 | Lonely Pixel II |
535 | Encode and Decode TinyURL |
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 |
547 | Number of Provinces |
549 | Binary Tree Longest Consecutive Sequence II |
550 | Shortest Path to Get Food |
551 | Student Attendance Record I |
552 | Student Attendance Record II |
554 | Brick Wall |
556 | Next Greater Element III |
557 | Reverse Words in a String III |
560 | Subarray Sum Equals K |
562 | Longest Line of Consecutive One in Matrix |
564 | Find the Closest Palindrome |
567 | Permutation in String |
568 | Maximum Vacation Days |
569 | Median Employee Salary |
572 | Subtree of Another Tree |
577 | Employee Bonus |
581 | Shortest Unsorted Continuous Subarray |
583 | Delete Operation for Two Strings |
584 | Find Customer Referee |
586 | Customer Placing the Largest Number of Orders |
587 | Erect the Fence |
588 | Design In-Memory File System |
593 | Valid Square |
595 | Big Countries |
604 | Design Compressed String Iterator |
605 | Can Place Flowers |
609 | Find Duplicate File in System |
616 | Add Bold Tag in String |
621 | Task Scheduler |
629 | K Inverse Pairs Array |
630 | Course Schedule III |
631 | Design Excel Sum Formula |
632 | Smallest Range Covering Elements from K Lists |
636 | Exclusive Time of Functions |
638 | Shopping Offers |
642 | Design Search Autocomplete System |
643 | Maximum Average Subarray I |
644 | Maximum Average Subarray II |
647 | Palindromic Substrings |
648 | Replace Words |
651 | 4 Keys Keyboard |
652 | Find Duplicate Subtrees |
653 | Two Sum IV - Input is a BST |
656 | Coin Path |
657 | Robot Return to Origin |
658 | Find K Closest Elements |
659 | Split Array into Consecutive Subsequences |
662 | Maximum Width of Binary Tree |
664 | Strange Printer |
665 | Non-decreasing Array |
667 | Beautiful Arrangement II |
668 | Kth Smallest Number in Multiplication Table |
670 | Maximum Swap |
673 | Number of Longest Increasing Subsequence |
674 | Longest Continuous Increasing Subsequence |
676 | Implement Magic Dictionary |
678 | Valid Parenthesis String |
679 | 24 Game |
680 | Valid Palindrome II |
681 | Next Closest Time |
683 | K Empty Slots |
684 | Redundant Connection |
685 | Redundant Connection II |
686 | Repeated String Match |
687 | Longest Univalue Path |
689 | Maximum Sum of 3 Non-Overlapping Subarrays |
690 | Employee Importance |
691 | Stickers to Spell Word |
692 | Top K Frequent Words |
695 | Max Area of Island |
696 | Count Binary Substrings |
697 | Degree of an Array |
715 | Range Module |
718 | Maximum Length of Repeated Subarray |
719 | Find K-th Smallest Pair Distance |
720 | Longest Word in Dictionary |
721 | Accounts Merge |
722 | Remove Comments |
724 | Find Pivot Index |
726 | Number of Atoms |
727 | Minimum Window Subsequence |
729 | My Calendar I |
731 | My Calendar II |
732 | My Calendar III |
733 | Flood Fill |
734 | Sentence Similarity |
735 | Asteroid Collision |
737 | Sentence Similarity II |
739 | Daily Temperatures |
740 | Delete and Earn |
741 | Cherry Pickup |
744 | Network Delay Time |
746 | Prefix and Suffix Search |
747 | Min Cost Climbing Stairs |
748 | Largest Number At Least Twice of Others |
749 | Shortest Completing Word |
753 | Open the Lock |
754 | Cracking the Safe |
757 | Pyramid Transition Matrix |
760 | Bold Words in String |
761 | Employee Free Time |
762 | Find Anagram Mappings |
765 | Serialize and Deserialize N-ary Tree |
766 | Flatten a Multilevel Doubly Linked List |
768 | Partition Labels |
770 | Couples Holding Hands |
772 | Construct Quad Tree |
775 | N-ary Tree Preorder Traversal |
777 | Toeplitz Matrix |
778 | Reorganize String |
779 | Max Chunks To Make Sorted II |
780 | Max Chunks To Make Sorted |
785 | Basic Calculator III |
786 | Search in a Sorted Array of Unknown Size |
788 | Minimize Max Distance to Gas Station |
789 | Kth Largest Element in a Stream |
791 | Split BST |
792 | Binary Search |
793 | Swap Adjacent in LR String |
794 | Swim in Rising Water |
795 | K-th Symbol in Grammar |
796 | Reaching Points |
798 | Transform to Chessboard |
799 | Minimum Distance Between BST Nodes |
801 | Is Graph Bipartite? |
803 | Cheapest Flights Within K Stops |
804 | Rotated Digits |
805 | Escape The Ghosts |
806 | Domino and Tromino Tiling |
807 | Custom Sort String |
808 | Number of Matching Subsequences |
810 | Valid Tic-Tac-Toe State |
813 | All Paths From Source to Target |
815 | Champagne Tower |
816 | Design HashSet |
817 | Design HashMap |
818 | Similar RGB Color |
820 | Find Eventual Safe States |
821 | Bricks Falling When Hit |
822 | Unique Morse Code Words |
825 | Max Increase to Keep City Skyline |
826 | Soup Servings |
827 | Expressive Words |
830 | Largest Triangle Area |
831 | Largest Sum of Averages |
833 | Bus Routes |
834 | Ambiguous Coordinates |
835 | Linked List Components |
836 | Race Car |
838 | Design Linked List |
843 | Binary Trees With Factors |
850 | Insert into a Sorted Circular Linked List |
854 | Making A Large Island |
855 | Count Unique Characters of All Substrings of a Given String |
857 | Positions of Large Groups |
860 | Design Circular Queue |
861 | Flipping an Image |
862 | Find And Replace in String |
863 | Sum of Distances in Tree |
864 | Image Overlap |
865 | Robot Room Cleaner |
867 | New 21 Game |
868 | Push Dominoes |
869 | Similar String Groups |
870 | Magic Squares In Grid |
871 | Keys and Rooms |
873 | Guess the Word |
874 | Backspace String Compare |
875 | Longest Mountain in Array |
876 | Hand of Straights |
877 | Shortest Path Visiting All Nodes |
879 | Maximize Distance to Closest Person |
882 | Peak Index in a Mountain Array |
883 | Car Fleet |
884 | K-Similar Strings |
885 | Exam Room |
886 | Score of Parentheses |
887 | Minimum Cost to Hire K Workers |
889 | Buddy Strings |
892 | Shortest Subarray with Sum at Least K |
893 | All Nodes Distance K in Binary Tree |
894 | Random Pick with Blacklist |
895 | Shortest Path to Get All Keys |
900 | Reordered Power of 2 |
902 | Minimum Number of Refueling Stops |
903 | Implement Rand10() Using Rand7() |
907 | Koko Eating Bananas |
908 | Middle of the Linked List |
911 | Profitable Schemes |
912 | Random Pick with Weight |
913 | Random Flip Matrix |
914 | Random Point in Non-overlapping Rectangles |
917 | Boats to Save People |
922 | Possible Bipartition |
923 | Super Egg Drop |
925 | Construct Binary Tree from Preorder and Postorder Traversal |
926 | Find and Replace Pattern |
930 | All Possible Full Binary Trees |
932 | Monotonic Array |
933 | Increasing Order Search Tree |
936 | RLE Iterator |
937 | Online Stock Span |
940 | Fruit Into Baskets |
942 | Super Palindromes |
945 | Snakes and Ladders |
947 | Online Election |
948 | Sort an Array |
949 | Cat and Mouse |
950 | X of a Kind in a Deck of Cards |
952 | Word Subsets |
953 | Reverse Only Letters |
954 | Maximum Sum Circular Subarray |
955 | Complete Binary Tree Inserter |
956 | Number of Music Playlists |
957 | Minimum Add to Make Parentheses Valid |
960 | Minimize Malware Spread |
962 | Flip String to Monotone Increasing |
965 | Unique Email Addresses |
966 | Binary Subarrays With Sum |
967 | Minimum Falling Path Sum |
968 | Beautiful Array |
969 | Number of Recent Calls |
971 | Shortest Bridge |
972 | Knight Dialer |
975 | Range Sum of BST |
976 | Minimum Area Rectangle |
977 | Distinct Subsequences II |
978 | Valid Mountain Array |
979 | DI String Match |
981 | Delete Columns to Make Sorted |
983 | Validate Stack Sequences |
984 | Most Stones Removed with Same Row or Column |
985 | Bag of Tokens |
986 | Largest Time for Given Digits |
988 | Flip Equivalent Binary Trees |
989 | Largest Component Size by Common Factor |
991 | Array of Doubled Pairs |
992 | Delete Columns to Make Sorted II |
998 | Check Completeness of a Binary Tree |
999 | Regions Cut By Slashes |
1000 | Delete Columns to Make Sorted III |
1002 | Maximum Width Ramp |
1003 | Minimum Area Rectangle II |
1005 | Univalued Binary Tree |
1007 | Numbers With Same Consecutive Differences |
1008 | Binary Tree Cameras |
1013 | Fibonacci Number |
1014 | K Closest Points to Origin |
1016 | Subarray Sums Divisible by K |
1017 | Odd Even Jump |
1019 | Squares of a Sorted Array |
1021 | Distribute Coins in Binary Tree |
1022 | Unique Paths III |
1023 | Time Based Key-Value Store |
1025 | Minimum Cost For Tickets |
1028 | Interval List Intersections |
1029 | Vertical Order Traversal of a Binary Tree |
1030 | Smallest String Starting From Leaf |
1032 | Satisfiability of Equality Equations |
1034 | Subarrays with K Different Integers |
1036 | Rotting Oranges |
1039 | Find the Town Judge |
1042 | Minimum Cost to Merge Stones |
1046 | Max Consecutive Ones III |
1049 | Minimum Domino Rotations For Equal Row |
1051 | Shortest Way to Form String |
1052 | Campus Bikes |
1054 | Complement of Base 10 Integer |
1055 | Pairs of Songs With Total Durations Divisible by 60 |
1056 | Capacity To Ship Packages Within D Days |
1057 | Numbers With Repeated Digits |
1060 | Longest Repeating Substring |
1063 | Best Sightseeing Pair |
1064 | Smallest Integer Divisible by K |
1065 | Binary String With Substrings Representing 1 To N |
1067 | Campus Bikes II |
1069 | Confusing Number |
1073 | Number of Enclaves |
1076 | Brace Expansion |
1077 | Confusing Number II |
1078 | Remove Outermost Parentheses |
1080 | Camelcase Matching |
1081 | Video Stitching |
1085 | The Earliest Moment When Everyone Become Friends |
1087 | Longest Arithmetic Subsequence |
1092 | Maximum Difference Between Node and Ancestor |
1097 | Stream of Characters |
1099 | Path With Maximum Minimum Value |
1101 | Parallel Courses |
1106 | Escape a Large Maze |
1112 | Find Words That Can Be Formed by Characters |
1115 | Valid Boomerang |
1116 | Maximum Level Sum of a Binary Tree |
1117 | As Far from Land as Possible |
1118 | Divide Array Into Increasing Sequences |
1120 | Flower Planting With No Adjacent |
1122 | Longest Duplicate Substring |
1123 | Single-Row Keyboard |
1124 | String Transforms Into Another String |
1126 | Minimum Cost to Connect Sticks |
1127 | Last Stone Weight |
1128 | Remove All Adjacent Duplicates In String |
1129 | Longest String Chain |
1134 | Shortest Distance to Target Color |
1138 | Grumpy Bookstore Owner |
1142 | Minimum Knight Moves |
1144 | Optimize Water Distribution in a Village |
1145 | Number of Submatrices That Sum to Target |
1153 | Product Sales Analysis I |
1156 | Occurrences After Bigram |
1159 | Smallest Subsequence of Distinct Characters |
1160 | Letter Tile Possibilities |
1165 | Meeting Scheduler |
1167 | Minimum Time to Build Blocks |
1168 | Duplicate Zeros |
1169 | Largest Values From Labels |
1170 | Shortest Common Supersequence |
1171 | Shortest Path in Binary Matrix |
1176 | Design A Leaderboard |
1177 | Tree Diameter |
1184 | Car Pooling |
1185 | Find in Mountain Array |
1188 | Brace Expansion II |
1192 | Divide Chocolate |
1196 | Filling Bookcase Shelves |
1197 | Parsing A Boolean Expression |
1200 | Remove Interval |
1203 | Print in Order |
1205 | Defanging an IP Address |
1207 | Delete Nodes And Return Forest |
1210 | Mean of Array After Removing Some Elements |
1211 | Iterator for Combination |
1217 | Relative Sort Array |
1221 | Element Appearing More Than 25% In Sorted Array |
1222 | Remove Covered Intervals |
1224 | Minimum Falling Path Sum II |
1228 | Minimum Cost Tree From Leaf Values |
1229 | Shortest Path with Alternating Colors |
1232 | Sum of Mutated Array Closest to Target |
1238 | Alphabet Board Path |
1241 | Decompress Run-Length Encoded List |
1242 | Matrix Block Sum |
1244 | Distinct Echo Substrings |
1247 | Decrease Elements To Make Array Zigzag |
1248 | Binary Tree Coloring Game |
1249 | Snapshot Array |
1250 | Longest Common Subsequence |
1251 | Longest Chunked Palindrome Decomposition |
1254 | Deepest Leaves Sum |
1256 | Rank Transform of an Array |
1257 | Rank Transform of a Matrix |
1258 | Article Views I |
1263 | Number of Dice Rolls With Target Sum |
1267 | Remove Zero Sum Consecutive Nodes from Linked List |
1273 | Compare Strings by Frequency of the Smallest Character |
1274 | Number of Days Between Two Dates |
1275 | Validate Binary Tree Nodes |
1277 | Largest Multiple of Three |
1278 | Product Price at a Given Date |
1286 | Constrained Subsequence Sum |
1287 | Distance Between Bus Stops |
1296 | Kth Ancestor of a Tree Node |
1305 | Number of Visible People in a Queue |
1308 | Smallest String With Swaps |
1310 | Watering Plants |
1319 | Unique Number of Occurrences |
1324 | Where Will the Ball Fall |
1325 | Path with Maximum Probability |
1330 | Longest Arithmetic Subsequence of Given Difference |
1331 | Path with Maximum Gold |
1332 | Count Vowels Permutation |
1335 | Maximum Candies Allocated to K Children |
1337 | Design Skiplist |
1350 | Remove Sub-Folders from the Filesystem |
1352 | Maximum Profit in Job Scheduling |
1358 | Find Positive Integer Solution for a Given Equation |
1361 | Tiling a Rectangle with the Fewest Squares |
1364 | Tuple with Same Product |
1371 | Minimum Remove to Make Valid Parentheses |
1374 | Leftmost Column with at Least a One |
1380 | Number of Closed Islands |
1381 | Maximum Score Words Formed by Letters |
1384 | Maximum Font to Fit a Sentence in a Screen |
1387 | Find Elements in a Contaminated Binary Tree |
1389 | Minimum Moves to Move a Box to Their Target Location |
1392 | Find the Difference of Two Arrays |
1393 | Maximum Value of K Coins From Piles |
1394 | Minimum Path Cost in a Grid |
1396 | Count Servers that Communicate |
1397 | Search Suggestions System |
1398 | Number of Ways to Stay in the Same Place After Some Steps |
1400 | Find Winner on a Tic Tac Toe Game |
1402 | Count Square Submatrices with All Ones |
1405 | All People Report to the Given Manager |
1406 | Subtract the Product and Sum of Digits of an Integer |
1409 | Minimum Number of Flips to Convert Binary Matrix to Zero Matrix |
1413 | Maximum Side Length of a Square with Sum Less than or Equal to Threshold |
1414 | Shortest Path in a Grid with Obstacles Elimination |
1418 | Fair Distribution of Cookies |
1422 | Divide Array in Sets of K Consecutive Numbers |
1427 | All Elements in Two Binary Search Trees |
1428 | Jump Game III |
1431 | All Ancestors of a Node in a Directed Acyclic Graph |
1437 | Minimum Insertion Steps to Make a String Palindrome |
1443 | Minimum Distance to Type a Word Using Two Fingers |
1447 | Jump Game IV |
1456 | Find the City With the Smallest Number of Neighbors at a Threshold Distance |
1461 | Count All Valid Pickup and Delivery Options |
1463 | The K Weakest Rows in a Matrix |
1468 | Check If N and Its Double Exist |
1477 | Product of the Last K Numbers |
1478 | Maximum Number of Events That Can Be Attended |
1482 | How Many Numbers Are Smaller Than the Current Number |
1483 | Rank Teams by Votes |
1485 | Minimum Cost to Make at Least One Valid Path in a Grid |
1487 | Cinema Seat Allocation |
1488 | Sort Integers by The Power Value |
1489 | Pizza With 3n Slices |
1492 | Time Needed to Inform All Employees |
1493 | Frog Position After T Seconds |
1499 | Maximum Performance of a Team |
1501 | Circle and Rectangle Overlapping |
1508 | Longest Happy Prefix |
1509 | Replace Employee ID With The Unique Identifier |
1513 | Find All Good Strings |
1515 | Find the Minimum Number of Fibonacci Numbers Whose Sum Is K |
1522 | Stone Game III |
1528 | Kids With the Greatest Number of Candies |
1537 | Maximum Score After Splitting a String |
1538 | Maximum Points You Can Obtain from Cards |
1539 | Diagonal Traverse II |
1543 | Simplified Fractions |
1544 | Count Good Nodes in Binary Tree |
1545 | Form Largest Integer With Digits That Add up to Target |
1549 | Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit |
1552 | Build an Array With Stack Operations |
1555 | Number of Ways of Cutting a Pizza |
1557 | Check If a String Contains All Binary Codes of Size K |
1559 | Cherry Pickup II |
1562 | People Whose List of Favorite Companies Is Not a Subset of Another List |
1573 | Find Two Non-overlapping Sub-arrays Each With Target Sum |
1580 | Shuffle the Array |
1581 | The k Strongest Values in an Array |
1582 | Design Browser History |
1583 | Paint House III |
1584 | Average Salary Excluding the Minimum and Maximum Salary |
1587 | Parallel Courses II |
1603 | Running Sum of 1d Array |
1605 | Minimum Number of Days to Make m Bouquets |
1612 | Avoid Flood in The City |
1615 | Range Sum of Sorted Subarray Sums |
1616 | Minimum Difference Between Largest and Smallest Value in Three Moves |
1621 | Number of Subsequences That Satisfy the Given Sum Condition |
1622 | Max Value of Equation |
1627 | Last Moment Before All Ants Fall Out of a Plank |
1628 | Count Submatrices With All Ones |
1630 | Count Odd Numbers in an Interval Range |
1632 | Number of Good Ways to Split a String |
1633 | Minimum Number of Increments on Subarrays to Form a Target Array |
1635 | Number of Good Pairs |
1636 | Number of Substrings With Only 1s |
1646 | Kth Missing Positive Number |
1649 | Maximum Number of Non-Overlapping Subarrays With Sum Equals Target |
1650 | Find Root of N-Ary Tree |
1651 | Shuffle String |
1653 | Number of Good Leaf Nodes Pairs |
1655 | Move Sub-Tree of N-Ary Tree |
1656 | Count Good Triplets |
1661 | Minimum Number of Vertices to Reach All Nodes |
1666 | Make The String Great |
1669 | Minimum Cost to Cut a Stick |
1676 | Minimum Number of Days to Eat N Oranges |
1677 | Matrix Diagonal Sum |
1681 | Guess the Majority in a Hidden Array |
1684 | Find Latest Group of Size M |
1687 | The Most Similar Path in a Graph |
1692 | Number of Ways to Reorder Array to Get Same BST |
1696 | Strange Printer II |
1697 | Strings Differ by One Character |
1701 | Remove Max Number of Edges to Keep Graph Fully Traversable |
1703 | Put Boxes Into the Warehouse I |
1704 | Special Positions in a Binary Matrix |
1707 | Check If String Is Transformable With Substring Sort Operations |
1710 | Find Servers That Handled Most Number of Requests |
1711 | Find Valid Matrix Given Row and Column Sums |
1713 | Dot Product of Two Sparse Vectors |
1714 | Rearrange Spaces Between Words |
1715 | Split a String Into the Max Number of Unique Substrings |
1716 | Maximum Non Negative Product in a Matrix |
1717 | Minimum Cost to Connect Two Groups of Points |
1719 | Put Boxes Into the Warehouse II |
1722 | Throne Inheritance |
1723 | Maximum Number of Achievable Transfer Requests |
1727 | Cat and Mouse II |
1728 | Fancy Sequence |
1730 | Special Array With X Elements Greater Than or Equal X |
1733 | Maximum Number of Visible Points |
1736 | Build Binary Expression Tree From Infix Expression |
1739 | Split Two Strings to Make Palindrome |
1741 | Sort Array by Increasing Frequency |
1744 | Number of Ways to Form a Target String Given a Dictionary |
1745 | Find Nearest Right Node in Binary Tree |
1746 | Largest Substring Between Two Equal Characters |
1750 | Check If Two Expression Trees are Equivalent |
1752 | Arithmetic Subarrays |
1753 | Path With Minimum Effort |
1758 | Distribute Repeating Integers |
1762 | Furthest Building You Can Reach |
1765 | Merge In Between Linked Lists |
1768 | Design an Expression Tree With Evaluate Function |
1770 | Minimum Deletions to Make Character Frequencies Unique |
1776 | Minimum Operations to Reduce X to Zero |
1777 | Determine if Two Strings Are Close |
1791 | Richest Customer Wealth |
1792 | Find the Most Competitive Subsequence |
1796 | Correct a Binary Tree |
1798 | Max Number of K-Sum Pairs |
1801 | Average Time of Process per Machine |
1805 | Minimum Adjacent Swaps for K Consecutive Ones |
1810 | Change the Root of a Binary Tree |
1814 | Jump Game VI |
1815 | Checking Existence of Edge Length Limited Paths |
1818 | Maximum Score From Removing Substrings |
1826 | Maximum XOR With an Element From Array |
1828 | Count Ways to Distribute Candies |
1829 | Maximum Units on a Truck |
1832 | Minimum Operations to Make a Subsequence |
1839 | Decode XORed Array |
1840 | Minimize Hamming Distance After Swap Operations |
1845 | Largest Submatrix With Rearrangements |
1847 | Largest Subarray Length K |
1858 | Latest Time by Replacing Hidden Digits |
1859 | Change Minimum Characters to Satisfy One of Three Conditions |
1860 | Find Kth Largest XOR Coordinate Value |
1865 | Checking Existence of Edge Length Limited Paths II |
1873 | Longest Nice Substring |
1875 | Tree of Coprimes |
1876 | Map of Highest Peak |
1878 | Check if Array Is Sorted and Rotated |
1879 | Maximum Score From Removing Stones |
1883 | Find Distance in a Binary Tree |
1890 | Sum of Beauty of All Substrings |
1894 | Merge Strings Alternately |
1895 | Minimum Number of Operations to Move All Balls to Each Box |
1896 | Maximum Score from Performing Multiplication Operations |
1900 | Closest Dessert Cost |
1902 | Car Fleet II |
1903 | Design Most Recently Used Queue |
1907 | Count Pairs With XOR in a Range |
1908 | Recyclable and Low Fat Products |
1912 | Number of Restricted Paths From First to Last Node |
1914 | Find the Subtasks That Did Not Execute |
1918 | Maximum Score of a Good Subarray |
1923 | Sentence Similarity III |
1924 | Maximum Number of Groups Getting Fresh Donuts |
1934 | Evaluate the Bracket Pairs of a String |
1935 | Minimum Number of Operations to Reinitialize a Permutation |
1939 | Queries on Number of Points Inside a Circle |
1943 | Count Pairs of Equal Substrings With Minimum Difference |
1949 | Implement Trie II (Prefix Tree) |
1950 | Sign of the Product of an Array |
1951 | Find the Winner of the Circular Game |
1953 | Finding MK Average |
1954 | Replace All Digits with Characters |
1959 | Minimum Path Cost in a Hidden Grid |
1960 | Check if the Sentence Is Pangram |
1962 | Single-Threaded CPU |
1966 | Frequency of the Most Frequent Element |
1969 | Maximum Number of Accepted Invitations |
1974 | Find Customers With Positive Revenue this Year |
1977 | Minimum Interval to Include Each Query |
1978 | Minimum Adjacent Swaps to Reach the Kth Smallest Number |
1983 | Maximum Population Year |
1984 | Maximum Distance Between a Pair of Values |
1986 | Largest Color Value in a Directed Graph |
1996 | Number of Ways to Rearrange Sticks With K Sticks Visible |
2000 | Minimum Speed to Arrive on Time |
2001 | Jump Game VII |
2008 | Minimum Cost to Change the Final Value of Expression |
2009 | Longest Word With All Prefixes |
2012 | Process Tasks Using Servers |
2013 | Minimum Skips to Arrive at Meeting On Time |
2017 | Minimum Number of Flips to Make the Binary String Alternating |
2018 | Minimum Space Wasted From Packaging |
2026 | Merge Triplets to Form Target Triplet |
2028 | The Earliest and Latest Rounds Where Players Compete |
2029 | Minimize Product Sum of Two Arrays |
2034 | Minimum Absolute Difference Queries |
2036 | Count Pairs in Two Arrays |
2038 | Nearest Exit from Entrance in Maze |
2044 | Number of Wonderful Substrings |
2045 | Cutting Ribbons |
2047 | Find a Peak Element II |
2048 | Build Array from Permutation |
2049 | Eliminate Maximum Number of Monsters |
2050 | Count Good Numbers |
2055 | Describe the Painting |
2058 | Concatenation of Array |
2059 | Unique Length-3 Palindromic Subsequences |
2061 | Painting a Grid With Three Different Colors |
2067 | Maximum Number of Points with Cost |
2069 | Kth Smallest Subarray Sum |
2071 | Longest Common Subsequence Between Sorted Arrays |
2074 | Erect the Fence II |
2079 | Delete Duplicate Folders in System |
2101 | Last Day Where You Can Still Cross |
2104 | Operations on Tree |
2107 | Find Unique Binary String |
2111 | Binary Searchable Numbers in an Unsorted Array |
2114 | Minimum Number of Work Sessions to Finish the Tasks |
2115 | Number of Unique Good Subsequences |
2117 | Find Original Array From Doubled Array |
2121 | Find if Path Exists in Graph |
2123 | The Number of Weak Characters in the Game |
2132 | Convert 1D Array Into 2D Array |
2135 | Maximum Number of Ways to Partition an Array |
2139 | Detect Squares |
2146 | Check if Word Can Be Placed In Crossword |
2161 | Stock Price Fluctuation |
2162 | Partition Array Into Two Arrays to Minimize Sum Difference |
2176 | Parallel Courses III |
2181 | Smallest Index With Equal Value |
2183 | Minimum Operations to Convert Number |
2193 | Count Fertile Pyramids in a Land |
2198 | Process Restricted Friend Requests |
2200 | Stamping the Grid |
2206 | Detonate the Maximum Bombs |
2210 | Find Target Indices After Sorting Array |
2212 | Removing Minimum and Maximum From Array |
2213 | Find All People With Secret |
2217 | Step-By-Step Directions From a Binary Tree Node to Another |
2218 | Paths in Maze That Lead to Same Room |
2219 | Maximum Number of Words Found in Sentences |
2220 | Find All Possible Recipes from Given Supplies |
2221 | Check if a Parentheses String Can Be Valid |
2226 | Rings and Rods |
2228 | Watering Plants II |
2237 | Longest Palindrome by Concatenating Two Letter Words |
2241 | Recover the Original Array |
2245 | Destroying Asteroids |
2246 | Maximum Employees to Be Invited to a Meeting |
2251 | Number of Ways to Divide a Long Corridor |
2256 | Count Words Obtained After Adding a Letter |
2261 | All Divisions With the Highest Score of a Binary Array |
2264 | Minimum Sum of Four Digit Number After Splitting Digits |
2265 | Partition Array According to Given Pivot |
2266 | Minimum Cost to Set Cooking Time |
2268 | Remove All Ones With Row and Column Flips |
2270 | Find All Lonely Numbers in the Array |
2279 | Maximum Split of Positive Even Integers |
2286 | Minimum Time to Remove All Cars Containing Illegal Goods |
2290 | Removing Minimum Number of Magic Beans |
2291 | Maximum AND Sum of Array |
2292 | Counting Words With a Given Prefix |
2294 | Minimum Time to Complete Trips |
2295 | Minimum Time to Finish the Race |
2297 | Amount of New Area Painted Each Day |
2306 | Create Binary Tree From Descriptions |
2311 | Minimum White Tiles After Covering With Carpets |
2312 | Most Frequent Number Following Key In an Array |
2314 | Remove All Ones With Row and Column Flips II |
2320 | Find All K-Distant Indices in an Array |
2321 | Minimum Weighted Subgraph With the Required Paths |
2322 | Number of Ways to Build Sturdy Brick Wall |
2333 | Count Number of Rectangles Containing Each Point |
2334 | Number of Flowers in Full Bloom |
2338 | Minimum Consecutive Cards to Pick Up |
2341 | Count Prefixes of a Given String |
2344 | Escape the Spreading Fire |
2345 | Minimum Number of Operations to Convert Time |
2347 | Count Nodes Equal to Average of Subtree |
2349 | Check if There Is a Valid Parentheses String Path |
2350 | Find Closest Number to Zero |
2352 | Design an ATM Machine |
2353 | Maximum Score of a Node Sequence |
2357 | Count Integers in Intervals |
2359 | Maximum White Tiles Covered by a Carpet |
2367 | Minimum Lines to Represent a Line Chart |
2375 | Minimum Obstacle Removal to Reach Corner |
2377 | Check if Number Has Equal Digit Count and Digit Value |
2378 | Sender With Largest Word Count |
2380 | Booking Concert Tickets in Groups |
2383 | Add Two Integers |
2385 | Count Positions on Street With Required Brightness |
2389 | Design a Text Editor |
2394 | Count Subarrays With Score Less Than K |
2395 | Longest Binary Subsequence Less Than or Equal to K |
2396 | Design Video Sharing Platform |
2399 | Minimum Flips in Binary Tree to Get Result |
2401 | Count Asterisks |
2403 | Count Unreachable Pairs of Nodes in an Undirected Graph |
2413 | Smallest Number in Infinite Set |
2414 | Move Pieces to Obtain a String |
2416 | Evaluate Boolean Binary Tree |
2417 | The Latest Time to Catch a Bus |
2419 | Subarray With Elements Greater Than Varying Threshold |
2420 | Closest Node to Path in Tree |
2427 | First Letter to Appear Twice |
2432 | Number of Zero-Filled Subarrays |
2434 | Design a Number Container System |
2435 | Shortest Impossible Sequence of Rolls |
2443 | Check if There is a Valid Partition For The Array |
2447 | Merge Similar Items |
2448 | Count Number of Bad Pairs |
2450 | Minimum Replacements to Sort the Array |
2454 | Largest Local Values in a Matrix |
2472 | Build a Matrix With Conditions |
2479 | Meeting Rooms III |
2481 | Strictly Palindromic Number |
2485 | Finding the Number of Visible Mountains |
2489 | Sort Array by Moving Items to Empty Space |
2494 | Sum of Prefix Scores of Strings |
2505 | Number of Good Paths |
2506 | Minimize Maximum Value in a Grid |
2512 | Longest Uploaded Prefix |
2513 | Number of Pairs Satisfying Inequality |
2521 | Paths in Matrix Whose Sum Is Divisible by K |
2525 | Count Number of Distinct Integers After Reverse Operations |
2526 | Longest Increasing Subsequence II |
2528 | Number of Valid Clock Times |
2536 | Determine if Two Events Have Conflict |
2538 | Minimum Cost to Make Array Equal |
2545 | Height of Binary Tree After Subtree Removal Queries |
2550 | Words Within Two Edits of Dictionary |
2564 | Most Profitable Path in a Tree |
2567 | Closest Nodes Queries in a Binary Search Tree |
2569 | Number of Beautiful Partitions |
2574 | Count Subarrays With Median K |
2591 | Frog Jump II |
2615 | Make Number of Distinct Characters Equal |
2625 | Increment Submatrices by One |
2641 | Disconnect Path in a Binary Matrix by at Most One Flip |
2653 | Check if There is a Path With Equal Number of 0’s And 1’s |
2687 | Lexicographically Smallest Beautiful String |
2707 | Merge Two 2D Arrays by Summing Values |
2716 | Prime Subtraction Operation |
2732 | Counter |
2734 | Array Prototype Last |
2747 | Apply Transform Over Each Element in Array |
2774 | Differences Between Two Objects |
2809 | Create Hello World Function |
2818 | Maximum Strictly Increasing Cells in a Matrix |
2843 | Extract Kth Character From The Rope Tree |
2849 | Sum of Imbalance Numbers of All Subarrays |
2868 | Continuous Subarrays |
2875 | Count Houses in a Circular Street |
2891 | Maximum Beauty of an Array After Applying Operation |
2914 | Find the Safest Path in a Grid |
2953 | Count Pairs of Points With Distance k |
3000 | Minimum Absolute Difference Between Elements With Constraint |
3024 | String Transformation |
3056 | Determine if a Cell Is Reachable at a Given Time |
3057 | Count K-Subsequences of a String With Maximum Beauty |
3058 | Maximum Number of K-Divisible Components |
3158 | Maximum Length of Semi-Decreasing Subarrays |
3178 | Minimum Increment Operations to Make Array Beautiful |
3188 | Find Champion I |
3189 | Find Champion II |
3191 | Maximum Score After Applying Operations on a Tree |
3212 | Count the Number of Good Partitions |
3218 | Find Number of Coins to Place in Tree Nodes |
3222 | Number of Equal Numbers Blocks |
3229 | Minimum Cost to Make Array Equalindromic |
3241 | Divide Array Into Arrays With Max Difference |