| 1 |
01 Matrix |
| 2 |
132 Pattern |
| 3 |
3Sum Closest |
| 4 |
3Sum Smaller |
| 5 |
3Sum With Multiplicity |
| 6 |
3Sum |
| 7 |
4 Keys Keyboard |
| 8 |
4 Sum II |
| 9 |
4Sum II |
| 10 |
4Sum |
| 11 |
Accounts Merge |
| 12 |
Add Bold Tag in String |
| 13 |
Add Minimum Number of Rungs |
| 14 |
Add One Row to Tree |
| 15 |
Add Two Numbers II |
| 16 |
Add Two Numbers |
| 17 |
Adding Spaces to a String |
| 18 |
Adding Two Negabinary Numbers |
| 19 |
Advantage Shuffle |
| 20 |
Alert Using Same Key-Card Three or More Times in a One Hour Period |
| 21 |
All Ancestors of a Node in a Directed Acyclic Graph |
| 22 |
All Divisions With the Highest Score of a Binary Array |
| 23 |
All Elements in Two Binary Search Trees |
| 24 |
All Nodes Distance K in Binary Tree |
| 25 |
All Paths From Source to Target |
| 26 |
All Paths from Source Lead to Destination |
| 27 |
All Possible Full Binary Trees |
| 28 |
Analyze User Website Visit Pattern |
| 29 |
Angle Between Hands of a Clock |
| 30 |
Append Characters to String to Make Subsequence |
| 31 |
Append K Integers With Minimal Sum |
| 32 |
Apply Discount Every n Orders |
| 33 |
Apply Discount to Prices |
| 34 |
Arithmetic Slices |
| 35 |
Arithmetic Subarrays |
| 36 |
Array Circular Loop |
| 37 |
Array Nesting |
| 38 |
As Far from Land as Possible |
| 39 |
Asteroid Collision |
| 40 |
Average Waiting Time |
| 41 |
Bag of Tokens |
| 42 |
Balance a Binary Search Tree |
| 43 |
Basic Calculator II |
| 44 |
Battleships in a board |
| 45 |
Best Time to Buy and Sell Stock II |
| 46 |
Best Time to Buy and Sell Stock with Cooldown |
| 47 |
Binary Search Tree Iterator II |
| 48 |
Binary Search Tree Iterator |
| 49 |
Binary Search Tree to Greater Sum Tree |
| 50 |
Binary Tree Coloring Game |
| 51 |
Binary Tree Level Order Traversal |
| 52 |
Binary Tree Longest Consecutive Sequence II |
| 53 |
Binary Tree Longest Consecutive Sequence |
| 54 |
Binary Tree Preorder Traversal |
| 55 |
Binary Tree Pruning |
| 56 |
Binary Tree Right Side View |
| 57 |
Binary Tree Upside Down |
| 58 |
Binary Tree Vertical Order Traversal |
| 59 |
Binary Tree Zigzag Level Order Traversal |
| 60 |
Binary Trees With Factors |
| 61 |
Bitwise AND of Numbers Range |
| 62 |
Boats to Save People |
| 63 |
Bold Words in String |
| 64 |
Bomb Enemy |
| 65 |
Boundary of Binary Tree |
| 66 |
Brace Expansion |
| 67 |
Break a Palindrome |
| 68 |
Broken Calculator |
| 69 |
Buildings With an Ocean View |
| 70 |
Bulb Switcher |
| 71 |
Camelcase Matching |
| 72 |
Campus Bikes II |
| 73 |
Campus Bikes |
| 74 |
Can Convert String in K Moves |
| 75 |
Can Make Palindrome from Substring |
| 76 |
Candy Crush |
| 77 |
Capacity To Ship Packages Within D Days |
| 78 |
Car Pooling |
| 79 |
Champagne Tower |
| 80 |
Cheapest Flights Within K Stops |
| 81 |
Check Completeness of a Binary Tree |
| 82 |
Check If All 1's Are at Least Length K Places Away |
| 83 |
Check If a String Can Break Another String |
| 84 |
Check If a String Contains All Binary Codes of Size K |
| 85 |
Check If a String Is a Valid Sequence from Root to Leaves Path in a Binary Tree |
| 86 |
Check if There is a Valid Path in a Grid |
| 87 |
Cinema Seat Allocation |
| 88 |
Clone Binary Tree With Random Pointer |
| 89 |
Clone Graph |
| 90 |
Clone N-ary Tree |
| 91 |
Closest Nodes Queries in a Binary Search Tree |
| 92 |
Coin Change 2 |
| 93 |
Coin Change |
| 94 |
Combination Sum II |
| 95 |
Combination Sum III |
| 96 |
Combination Sum IV |
| 97 |
Combination Sum |
| 98 |
Combinations |
| 99 |
Compare Version Numbers |
| 100 |
Complete Binary Tree Insertor |
| 101 |
Complex Number Multiplication |
| 102 |
Concatenation of Consecutive Binary Numbers |
| 103 |
Connecting Cities With Minimum Cost |
| 104 |
Construct Binary Search Tree from Preorder Traversal |
| 105 |
Construct Binary Tree from Inorder and Postorder Traversal |
| 106 |
Construct Binary Tree from Preorder and Inorder Traversal |
| 107 |
Construct K Palindrome Strings |
| 108 |
Construct Quad Tree |
| 109 |
Construct String With Repeat Limit |
| 110 |
Container With Most Water |
| 111 |
Contains Duplicate III |
| 112 |
Contiguous Array |
| 113 |
Continuous Subarray Sum |
| 114 |
Convert Binary Search Tree to Sorted Doubly Linked List |
| 115 |
Convert Sorted List to Binary Search Tree |
| 116 |
Convert an Array Into a 2D Array With Conditions |
| 117 |
Copy List with Random Pointer |
| 118 |
Corporate Flight Bookings |
| 119 |
Count Collisions on a Road |
| 120 |
Count Complete Tree Nodes |
| 121 |
Count Good Nodes in Binary Tree |
| 122 |
Count Nodes Equal to Average of Subtree |
| 123 |
Count Nodes Equal to Sum of Descendants |
| 124 |
Count Number of Bad Pairs |
| 125 |
Count Number of Distinct Integers After Reverse Operations |
| 126 |
Count Number of Homogenous Substrings |
| 127 |
Count Number of Teams |
| 128 |
Count Numbers With Unique Digits |
| 129 |
Count Servers That Communicate |
| 130 |
Count Sorted Vowel Strings |
| 131 |
Count Square Submatrices with All Ones |
| 132 |
Count Sub Islands |
| 133 |
Count Submatrices With All Ones |
| 134 |
Count Univalue Subtrees |
| 135 |
Count Unreachable Pairs of Nodes in an Undirected Graph |
| 136 |
Count Vowel Strings in Ranges |
| 137 |
Count and Say |
| 138 |
Course Schedule II |
| 139 |
Course Schedule |
| 140 |
Create Binary Tree From Descriptions |
| 141 |
Custom Sort String |
| 142 |
Daily Temperatures |
| 143 |
Decode String |
| 144 |
Decode Ways |
| 145 |
Decrease Elements To Make Array Zigzag |
| 146 |
Deepest Leaves Sum |
| 147 |
Delete Leaves With a Given Value |
| 148 |
Delete Node in a BST |
| 149 |
Delete Nodes And Return Forest |
| 150 |
Delete Operation for Two Strings |
| 151 |
Delete Tree Nodes |
| 152 |
Delete the Middle Node of a Linked List |
| 153 |
Design A Leaderboard |
| 154 |
Design Add and Search Words Data Structure |
| 155 |
Design Authentication Manager |
| 156 |
Design Browser History |
| 157 |
Design Circular Deque |
| 158 |
Design Circular Queue |
| 159 |
Design File System |
| 160 |
Design Front Middle Back Queue |
| 161 |
Design Hit Counter |
| 162 |
Design Log Storage System |
| 163 |
Design Phone Directory |
| 164 |
Design SQL |
| 165 |
Design Snake Game |
| 166 |
Design Tic-Tac-Toe |
| 167 |
Design Twitter |
| 168 |
Design Underground System |
| 169 |
Design a File Sharing System |
| 170 |
Design a Stack With Increment Operation |
| 171 |
Design an ATM Machine |
| 172 |
Design an Expression Tree With Evaluate Function |
| 173 |
Determine if Two Strings Are Close |
| 174 |
Diagonal Traverse |
| 175 |
Diameter of N-ary Tree |
| 176 |
Display Table of Food Orders in a Restaurant |
| 177 |
Distribute Coins in Binary Tree |
| 178 |
Divide Array in Sets of K Consecutive Numbers |
| 179 |
Divide Players Into Teams of Equal Skill |
| 180 |
Divide Two Integers |
| 181 |
Dot Product of Two Sparse Vectors |
| 182 |
Encode and Decode Strings |
| 183 |
Encode and Decode TinyURL |
| 184 |
Equal Row and Column Pairs |
| 185 |
Escape The Ghosts |
| 186 |
Evaluate Division |
| 187 |
Evaluate Reverse Polish Notation |
| 188 |
Evaluate the Bracket Pairs of a String |
| 189 |
Even Odd Tree |
| 190 |
Exclusive Time of Functions |
| 191 |
Execution of All Suffix Instructions Staying in a Grid |
| 192 |
Expressive Words |
| 193 |
Fair Distribution of Cookies |
| 194 |
Filter Restaurants by Vegan-Friendly, Price and Distance |
| 195 |
Find All Anagrams in a String |
| 196 |
Find All Lonely Numbers in the Array |
| 197 |
Find All Possible Recipes from Given Supplies |
| 198 |
Find Bottom Left Tree Value |
| 199 |
Find Center of Star Graph |
| 200 |
Find Closest Node to Given Two Nodes |
| 201 |
Find Consecutive Integers from a Data Stream |
| 202 |
Find Distance in a Binary Tree |
| 203 |
Find Duplicate File in System |
| 204 |
Find Duplicate Subtrees |
| 205 |
Find Elements in a Contaminated Binary Tree |
| 206 |
Find First and Last Position of Element in Sorted Array |
| 207 |
Find K Closest Elements |
| 208 |
Find K Pairs with Smallest Sums |
| 209 |
Find K-Length Substrings With No Repeated Characters |
| 210 |
Find Largest Value in Each Tree Row |
| 211 |
Find Leaves of Binary Tree |
| 212 |
Find Minimum in Rotated Sorted Array |
| 213 |
Find Missing Observations |
| 214 |
Find Nearest Right Node in Binary Tree |
| 215 |
Find Original Array From Doubled Array |
| 216 |
Find Peak Element |
| 217 |
Find Permutation |
| 218 |
Find Players With Zero or One Losses |
| 219 |
Find Right Interval |
| 220 |
Find Root of N-Ary Tree |
| 221 |
Find Smallest Common Element in All Rows |
| 222 |
Find The Original Array of Prefix Xor |
| 223 |
Find Triangular Sum of an Array |
| 224 |
Find a Corresponding Node of a Binary Tree in a Clone of That Tree |
| 225 |
Find all Duplicates in an Array |
| 226 |
Find and Replace Pattern |
| 227 |
Find and Replace in String |
| 228 |
Find the Celebrity |
| 229 |
Find the City With the Smallest Number of Neighbors at a Threshold Distance |
| 230 |
Find the Duplicate Number |
| 231 |
Find the Index of the First Occurrence in a String |
| 232 |
Find the Index of the Large Integer |
| 233 |
Find the Kth Largest Integer in the Array |
| 234 |
Find the Maximum Divisibility Score |
| 235 |
Find the Minimum and Maximum Number of Nodes Between Critical Points |
| 236 |
Find the Score of All Prefixes of an Array |
| 237 |
Find the Student that Will Replace the Chalk |
| 238 |
Find the Substring With Maximum Cost |
| 239 |
Find the Winner of an Array Game |
| 240 |
Finding the Users Active Minutes |
| 241 |
First Unique Number |
| 242 |
Flatten 2D Vector |
| 243 |
Flatten Binary Tree to Linked List |
| 244 |
Flatten Nested List Iterator |
| 245 |
Flatten a Multilevel Doubly Linked List |
| 246 |
Flip Equivalent Binary Trees |
| 247 |
Four Divisors |
| 248 |
Fraction to Recurring Decimal |
| 249 |
Friend Circles |
| 250 |
Friends Of Appropriate Ages |
| 251 |
Fruit Into Baskets |
| 252 |
Furthest Building You Can Reach |
| 253 |
Game of Life |
| 254 |
Gas Station |
| 255 |
Generate Parentheses |
| 256 |
Graph Valid Tree |
| 257 |
Gray Code |
| 258 |
Group Anagrams |
| 259 |
Group Shifted Strings |
| 260 |
Group the People Given the Group Size They Belong To |
| 261 |
Grumpy Bookstore Owner |
| 262 |
Guess Number Higher or Lower II |
| 263 |
H-Index II |
| 264 |
H-Index |
| 265 |
HTML Entity Parser |
| 266 |
Hand of Straights |
| 267 |
House Robber II |
| 268 |
House Robber III |
| 269 |
House Robber |
| 270 |
Image Overlap |
| 271 |
Implement Magic Dictionary |
| 272 |
Implement Rand10() Using Rand7() |
| 273 |
Implement Trie (Prefix Tree) |
| 274 |
Implement Trie II (Prefix Tree) |
| 275 |
Increasing Subsequences |
| 276 |
Increasing Triplet Subsequence |
| 277 |
Incremental Memory Leak |
| 278 |
Inorder Successor in BST II |
| 279 |
Inorder Successor in BST |
| 280 |
Insert Delete GetRandom O(1) |
| 281 |
Insert Interval |
| 282 |
Insert Into a Cyclic Sorted List |
| 283 |
Insert into a Binary Search Tree |
| 284 |
Insert into a Sorted Circular Linked List |
| 285 |
Insertion Sort List |
| 286 |
Insufficient Nodes in Root to Leaf Paths |
| 287 |
Integer To Roman |
| 288 |
Interleaving String |
| 289 |
Interval List Intersections |
| 290 |
Invalid Transactions |
| 291 |
Is Graph Bipartite |
| 292 |
Iterator for Combination |
| 293 |
Jump Game II |
| 294 |
Jump Game III |
| 295 |
Jump Game VI |
| 296 |
Jump Game |
| 297 |
K Closest Points to Origin |
| 298 |
K Radius Subarray Averages |
| 299 |
Keys and Rooms |
| 300 |
Kill Process |
| 301 |
Knight Dialer |
| 302 |
Knight Probability in Chessboard |
| 303 |
Koko Eating Bananas |
| 304 |
Kth Largest Element in an Array |
| 305 |
Kth Largest Sum in a Binary Tree |
| 306 |
Kth Smallest Element in a BST |
| 307 |
Kth Smallest Element in a Sorted Matrix |
| 308 |
LRU Cache |
| 309 |
Large Divisble Subset |
| 310 |
Largest BST Subtree |
| 311 |
Largest Number |
| 312 |
Largest Time for Given Digits |
| 313 |
Last Moment Before All Ants Fall Out of a Plank |
| 314 |
Last Stone Weight II |
| 315 |
Least Number of Unique Integers after K Removals |
| 316 |
Leftmost Column with at Least a One |
| 317 |
Length of the Longest Alphabetical Continuous Substring |
| 318 |
Letter Combinations of a Phone Number |
| 319 |
Letter Tiles Possibilities |
| 320 |
Lexicographical Numbers |
| 321 |
Lexicographically Smallest Equivalent String |
| 322 |
Line Reflection |
| 323 |
Linked List Components |
| 324 |
Linked List Cycle II |
| 325 |
Linked List Random Node |
| 326 |
Linked List in Binary Tree |
| 327 |
Lonely Pixel I |
| 328 |
Longest Absolute File Path |
| 329 |
Longest Arithmetic Sequence |
| 330 |
Longest Arithmetic Subsequence |
| 331 |
Longest Consecutive Sequence |
| 332 |
Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit |
| 333 |
Longest Happy String |
| 334 |
Longest Increasing Subsequence |
| 335 |
Longest Line of Consecutive One in Matrix |
| 336 |
Longest Palindromic Subsequence |
| 337 |
Longest Palindromic Substring |
| 338 |
Longest String Chain |
| 339 |
Longest Substring Without Repeating Characters |
| 340 |
Longest Substring with At Most K Distinct Characters |
| 341 |
Longest Substring with At Most Two Distinct Characters |
| 342 |
Longest Uploaded Prefix |
| 343 |
Longest Well-Performing Interval |
| 344 |
Longest Word With All Prefixes |
| 345 |
Longest Word in Dictionary through Deleting |
| 346 |
Longest ZigZag Path in a Binary Tree |
| 347 |
Lowest Common Ancestor of Deepest Leaves |
| 348 |
Lowest Common Ancestor of a Binary Tree III |
| 349 |
Lowest Common Ancestor of a Binary Tree |
| 350 |
Majority Element II |
| 351 |
Making File Names Unique |
| 352 |
Map Sum Pairs |
| 353 |
Masking Personal Information |
| 354 |
Matchsticks to Square |
| 355 |
Max Area of Island |
| 356 |
Max Chunks To Make Sorted |
| 357 |
Max Consecutives Ones II |
| 358 |
Max Increase to Keep City Skyline |
| 359 |
Max Number of K-Sum Pairs |
| 360 |
Max Sum of a Pair With Equal Sum of Digits |
| 361 |
Maximal Network Rank |
| 362 |
Maximal Score After Applying K Operations |
| 363 |
Maximize Distance to Closest Person |
| 364 |
Maximize Number of Subsequences in a String |
| 365 |
Maximize the Topmost Element After K Moves |
| 366 |
Maximum Absolute Sum of Any Subarray |
| 367 |
Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts |
| 368 |
Maximum Average Subtree |
| 369 |
Maximum Bags With Full Capacity of Rocks |
| 370 |
Maximum Binary Tree II |
| 371 |
Maximum Binary Tree |
| 372 |
Maximum Consecutive Floors Without Special Floors |
| 373 |
Maximum Difference Between Node and Ancestor |
| 374 |
Maximum Distance Between a Pair of Values |
| 375 |
Maximum Erasure Value |
| 376 |
Maximum Ice Cream Bars |
| 377 |
Maximum Length of Pair Chain |
| 378 |
Maximum Length of Repeated Subarray |
| 379 |
Maximum Length of Subarray With Positive Product |
| 380 |
Maximum Level Sum of a Binary Tree |
| 381 |
Maximum Matching of Players With Trainers |
| 382 |
Maximum Nesting Depth of Two Valid Parentheses Strings |
| 383 |
Maximum Number of Coins You Can Get |
| 384 |
Maximum Number of Events That Can Be Attended |
| 385 |
Maximum Number of Groups Entering a Competition |
| 386 |
Maximum Number of Integers to Choose From a Range I |
| 387 |
Maximum Number of Non-Overlapping Subarrays With Sum Equals Target |
| 388 |
Maximum Number of Occurrences of a Substring |
| 389 |
Maximum Number of Vowels in a Substring of Given Length |
| 390 |
Maximum Points You Can Obtain from Cards |
| 391 |
Maximum Product Subarray |
| 392 |
Maximum Product of Splitted Binary Tree |
| 393 |
Maximum Product of Word Lengths |
| 394 |
Maximum Score From Removing Stones |
| 395 |
Maximum Score from Performing Multiplication Operations |
| 396 |
Maximum Size Subarray Sum Equals k |
| 397 |
Maximum Star Sum of a Graph |
| 398 |
Maximum Subarray |
| 399 |
Maximum Sum of Distinct Subarrays With Length K |
| 400 |
Maximum Sum of an Hourglass |
| 401 |
Maximum Swap |
| 402 |
Maximum Total Importance of Roads |
| 403 |
Maximum Twin Sum of a Linked List |
| 404 |
Maximum Value after Insertion |
| 405 |
Maximum Width Ramp |
| 406 |
Maximum Width of Binary Tree |
| 407 |
Maximum XOR of Two Numbers in an Array |
| 408 |
Maximum of Absolute Value Expression |
| 409 |
Meeting Rooms II |
| 410 |
Meeting Scheduler |
| 411 |
Merge In Between Linked Lists |
| 412 |
Merge Intervals |
| 413 |
Merge Nodes in Between Zeros |
| 414 |
Min Cost to Connect All Points |
| 415 |
Min Stack |
| 416 |
Minesweeper |
| 417 |
Mini Parser |
| 418 |
Minimize Maximum Pair Sum in Array |
| 419 |
Minimize Maximum of Array |
| 420 |
Minimize Product Sum of Two Arrays |
| 421 |
Minimum Add to Make Parentheses Valid |
| 422 |
Minimum Amount of Time to Collect Garbage |
| 423 |
Minimum Area Rectangle |
| 424 |
Minimum Average Difference |
| 425 |
Minimum Consecutive Cards to Pick Up |
| 426 |
Minimum Cost For Tickets |
| 427 |
Minimum Cost to Connect Sticks |
| 428 |
Minimum Deletion Cost to Avoid Repeating Letters |
| 429 |
Minimum Deletions to Make Array Beautiful |
| 430 |
Minimum Deletions to Make Character Frequencies Unique |
| 431 |
Minimum Domino Rotations For Equal Row |
| 432 |
Minimum Falling Path Sum |
| 433 |
Minimum Fuel Cost to Report to the Capital |
| 434 |
Minimum Genetic Mutation |
| 435 |
Minimum Health to Beat Game |
| 436 |
Minimum Height Trees |
| 437 |
Minimum Knight Moves |
| 438 |
Minimum Moves to Equal Array Elements II |
| 439 |
Minimum Moves to Equal Array Elements |
| 440 |
Minimum Moves to Reach Target Score |
| 441 |
Minimum Number of Arrows to Burst Balloons |
| 442 |
Minimum Number of Steps to Make Two Strings Anagram II |
| 443 |
Minimum Number of Steps to Make Two Strings Anagram |
| 444 |
Minimum Number of Vertices to Reach All Nodes |
| 445 |
Minimum Operations to Make Array Equal |
| 446 |
Minimum Operations to Reduce X to Zero |
| 447 |
Minimum Path Sum |
| 448 |
Minimum Remove to Make Valid Parentheses |
| 449 |
Minimum Rounds to Complete All Tasks |
| 450 |
Minimum Score Triangulation of Polygon |
| 451 |
Minimum Score of a Path Between Two Cities |
| 452 |
Minimum Size Subarray Sum |
| 453 |
Minimum Swaps to Group All 1's Together |
| 454 |
Minimum Time Difference |
| 455 |
Minimum Time to Collect All Apples in a Tree |
| 456 |
Minimum Time to Complete Trips |
| 457 |
Minimum Time to Make Rope Colorful |
| 458 |
Mirror Reflection |
| 459 |
Missing Element in Sorted Array |
| 460 |
Most Frequent Subtree Sum |
| 461 |
Most Popular Video Creator |
| 462 |
Most Profit Assigning Work |
| 463 |
Most Stones Removed with Same Row or Column |
| 464 |
Multiply Strings |
| 465 |
My Calendar I |
| 466 |
My Calendar II |
| 467 |
N-ary Tree Level Order Traversal |
| 468 |
Nearest Exit from Entrance in Maze |
| 469 |
Nested List Weight Sum II |
| 470 |
Network Delay Time |
| 471 |
Next Closest Time |
| 472 |
Next Greater Element II |
| 473 |
Next Greater Element III |
| 474 |
Next Greater Node In Linked List |
| 475 |
Next Greater Numerically Balanced Number |
| 476 |
Next Permutation |
| 477 |
Node With Highest Edge Score |
| 478 |
Non Overlapping Intervals |
| 479 |
Non-decreasing Array |
| 480 |
Number of Burgers with No Waste of Ingredients |
| 481 |
Number of Closed Islands |
| 482 |
Number of Connected Components in an Undirected Graph |
| 483 |
Number of Dice Rolls With Target Sum |
| 484 |
Number of Distinct Islands |
| 485 |
Number of Distinct Substrings in a String |
| 486 |
Number of Enclaves |
| 487 |
Number of Islands |
| 488 |
Number of Laser Beams in a Bank |
| 489 |
Number of Longest Increasing Subsequence |
| 490 |
Number of Matching Subsequence |
| 491 |
Number of Matching Subsequences |
| 492 |
Number of Nodes in the Sub-Tree With the Same Label |
| 493 |
Number of Operations to Make Network Connected |
| 494 |
Number of Pairs of Interchangeable Rectangles |
| 495 |
Number of Pairs of Strings With Concatenation Equal to Target |
| 496 |
Number of Provinces |
| 497 |
Number of Smooth Descent Periods of a Stock |
| 498 |
Number of Sub-arrays of Size K and Average Greater than or Equal to Threshold |
| 499 |
Number of Subarrays with Bounded Maximum |
| 500 |
Number of Substrings Containing All Three Characters |
| 501 |
Number of Substrings With Only 1s |
| 502 |
Number of Ways to Split Array |
| 503 |
Number of Zero-Filled Subarrays |
| 504 |
Numbers With Same Consecutive Differences |
| 505 |
Odd Even Linked Lists |
| 506 |
One Edit Distance |
| 507 |
Ones and Zeroes |
| 508 |
Online Election |
| 509 |
Online Stock Span |
| 510 |
Open The Lock |
| 511 |
Optimal Division |
| 512 |
Optimal Partition of String |
| 513 |
Out of Boundary Paths |
| 514 |
Output Contest Matches |
| 515 |
Pacific Atlantic Water Flow |
| 516 |
Palindrome Partitioning |
| 517 |
Palindromic Substrings |
| 518 |
Pancake Sorting |
| 519 |
Parallel Courses |
| 520 |
Partition Array According to Given Pivot |
| 521 |
Partition Equal Subset Sum |
| 522 |
Partition Labels |
| 523 |
Partition List |
| 524 |
Partitioning Into Minimum Number Of Deci-Binary Numbers |
| 525 |
Path Sum II |
| 526 |
Path Sum III |
| 527 |
Path With Maximum Minimum Value |
| 528 |
Path With Minimum Effort |
| 529 |
Path with Maximum Gold |
| 530 |
Path with Maximum Probability |
| 531 |
Peeking Iterator |
| 532 |
People Whose List of Favorite Companies Is Not a Subset of Another List |
| 533 |
Perfect Squares |
| 534 |
Permutation in String |
| 535 |
Permutations II |
| 536 |
Permutations |
| 537 |
Plus One Linked List |
| 538 |
Populating Next Right Pointers in Each Node II |
| 539 |
Populating Next Right Pointers in Each Node |
| 540 |
Possible Bipartition |
| 541 |
Pour Water |
| 542 |
Pow(x, n) |
| 543 |
Pow |
| 544 |
Prime Palindrome |
| 545 |
Print Binary Tree |
| 546 |
Print Immutable Linked List in Reverse |
| 547 |
Print Words Vertically |
| 548 |
Prison Cells After N Days |
| 549 |
Product of Array Except self |
| 550 |
Product of Two Run-Length Encoded Arrays |
| 551 |
Product of the Last K Numbers |
| 552 |
Pseudo-Palindromic Paths in a Binary Tree |
| 553 |
Push Dominoes |
| 554 |
Put Boxes Into the Warehouse I |
| 555 |
Queries on a Permutation With Key |
| 556 |
Queue Reconstruction By Height |
| 557 |
RLE Iterator |
| 558 |
Rabbits in Forest |
| 559 |
Random Pick Index |
| 560 |
Random Pick With Weight |
| 561 |
Range Addition |
| 562 |
Range Sum Query - Mutable |
| 563 |
Range Sum Query 2D-Immutable |
| 564 |
Range Sum of Sorted Subarray Sums |
| 565 |
Rank Teams by Votes |
| 566 |
Reachable Nodes With Restrictions |
| 567 |
Rearrange Array Elements by Sign |
| 568 |
Rearrange Array to Maximize Prefix Score |
| 569 |
Reconstruct Original Digits from English |
| 570 |
Recover Binary Search Tree |
| 571 |
Rectangle Area |
| 572 |
Reduce Array Size to The Half |
| 573 |
Reduction Operations to Make the Array Elements Equal |
| 574 |
Remove All Adjacent Duplicates in String II |
| 575 |
Remove All Occurrences of a Substring |
| 576 |
Remove All Ones With Row and Column Flips II |
| 577 |
Remove Comments |
| 578 |
Remove Covered Intervals |
| 579 |
Remove Duplicate Letters |
| 580 |
Remove Duplicates From Sorted Array II |
| 581 |
Remove Duplicates From an Unsorted Linked List |
| 582 |
Remove Duplicates from Sorted List II |
| 583 |
Remove Interval |
| 584 |
Remove K Digits |
| 585 |
Remove Nodes From Linked List |
| 586 |
Remove Nth Node From End of List |
| 587 |
Remove Sub-Folders from the Filesystem |
| 588 |
Remove Zero Sum Consecutive Nodes from Linked List |
| 589 |
Removing Stars From a String |
| 590 |
Reorder Data in Log Files |
| 591 |
Reorder List |
| 592 |
Reorder Routes to Make All Paths Lead to the City Zero |
| 593 |
Reordered Power of 2 |
| 594 |
Reorganize String |
| 595 |
Repeated DNA Sequences |
| 596 |
Replace Elements in an Array |
| 597 |
Replace Words |
| 598 |
Restore IP Address |
| 599 |
Restore the Array From Adjacent Pairs |
| 600 |
Reverse Integer |
| 601 |
Reverse Linked List II |
| 602 |
Reverse Nodes in Even Length Groups |
| 603 |
Reverse Odd Levels of Binary Tree |
| 604 |
Reverse Substrings Between Each Pair of Parentheses |
| 605 |
Reverse Words in a String II |
| 606 |
Reverse Words in a String |
| 607 |
Robot Bounded In Circle |
| 608 |
Rotate Array |
| 609 |
Rotate Function |
| 610 |
Rotate Image |
| 611 |
Rotate List |
| 612 |
Rotated Digits |
| 613 |
Rotting Oranges |
| 614 |
Satisfiability of Equality Equations |
| 615 |
Satisfisbility of Equality Equations |
| 616 |
Score After Flipping Matrix |
| 617 |
Score of Parentheses |
| 618 |
Search Suggestions System |
| 619 |
Search a 2D Matrix II |
| 620 |
Search a 2D Matrix |
| 621 |
Search for a range |
| 622 |
Search in Rotated Sorted Array II |
| 623 |
Search in Rotated Sorted Array |
| 624 |
Search in a Sorted Array of Unknown Size |
| 625 |
Seat Reservation Manager |
| 626 |
Self Dividing Numbers |
| 627 |
Sender With Largest Word Count |
| 628 |
Sentence Similarity II |
| 629 |
Sentence Similarity III |
| 630 |
Sequential Digits |
| 631 |
Serialize and Deserialize BST |
| 632 |
Set Matrix Zeroes |
| 633 |
Shifting Letters |
| 634 |
Short Encoding of Words |
| 635 |
Shortest Completing Word |
| 636 |
Shortest Path in Binary Matrix |
| 637 |
Shortest Path with Alternating Colors |
| 638 |
Shortest Unsorted Continuous Subarray |
| 639 |
Shortest Way to Form String |
| 640 |
Shortest Word Distance II |
| 641 |
Shortest Word Distance III |
| 642 |
Shuffle an Array |
| 643 |
Simple Bank System |
| 644 |
Simplify Path |
| 645 |
Single Element in a Sorted Array |
| 646 |
Single Number II |
| 647 |
Single Number III |
| 648 |
Smallest Integer Divisible by K |
| 649 |
Smallest Number in Infinite Set |
| 650 |
Smallest String Starting From Leaf |
| 651 |
Smallest String With A Given Numeric Value |
| 652 |
Smallest String With Swaps |
| 653 |
Smallest Subtree with all the Deepest Nodes |
| 654 |
Smallest Value of the Rearranged Number |
| 655 |
Snakes and Ladders |
| 656 |
Snapshot Array |
| 657 |
Solve the Equation |
| 658 |
Sort An Array |
| 659 |
Sort Characters By Frequency |
| 660 |
Sort Colors |
| 661 |
Sort Integers by The Power Value |
| 662 |
Sort List |
| 663 |
Sort Transformed Array |
| 664 |
Sort the Jumbled Numbers |
| 665 |
Sort the Matrix Diagonally |
| 666 |
Sort the Students by Their Kth Score |
| 667 |
Sparse Matrix Multiplication |
| 668 |
Spiral Matrix II |
| 669 |
Spiral Matrix |
| 670 |
Split Array into Consecutive Subsequences |
| 671 |
Split BST |
| 672 |
Split Linked List in Parts |
| 673 |
Statistics from a Large Sample |
| 674 |
Step-By-Step Directions From a Binary Tree Node to Another |
| 675 |
Stock Price Fluctuation |
| 676 |
Strictly Palindromic Number |
| 677 |
String Compression |
| 678 |
String to Integer (atoi) |
| 679 |
Subarray Product Less Than K |
| 680 |
Subarray Sum Equals K |
| 681 |
Subarray Sums Divisible by K |
| 682 |
Subdomain Visit Count |
| 683 |
Subrectangle Queries |
| 684 |
Subsets II |
| 685 |
Subsets |
| 686 |
Successful Pairs of Spells and Potions |
| 687 |
Sum Multiples |
| 688 |
Sum Root to Leaf Numbers |
| 689 |
Sum of Absolute Differences in a Sorted Array |
| 690 |
Sum of Beauty of All Substrings |
| 691 |
Sum of Even Numbers After Queries |
| 692 |
Sum of Nodes with Even-Valued Grandparent |
| 693 |
Sum of Numbers With Units Digit K |
| 694 |
Sum of Subarray Minimums |
| 695 |
Super Ugly Number |
| 696 |
Surrounded Regions |
| 697 |
Swap For Longest Repeated Character Substring |
| 698 |
Swap Nodes in Pairs |
| 699 |
Swapping Nodes in a Linked List |
| 700 |
Synonymous Sentences |
| 701 |
Target Sum |
| 702 |
Task Scheduler |
| 703 |
Ternary Expression Parser |
| 704 |
The Earliest Moment When Everyone Become Friends |
| 705 |
The Number of Full Rounds You Have Played |
| 706 |
The Number of Weak Characters in the Game |
| 707 |
The k Strongest Values in an Array |
| 708 |
The kth Factor of n |
| 709 |
Throne Inheritence |
| 710 |
Time Based Key-Value Store |
| 711 |
Time Needed to Inform All Employees |
| 712 |
Time Needed to Rearrange a Binary String |
| 713 |
Top K Frequent Elements |
| 714 |
Top K Frequent Words |
| 715 |
Total Hamming Distance |
| 716 |
Tree Diameter |
| 717 |
Triangle |
| 718 |
Trim a Binary Search Tree |
| 719 |
Tuple With Same Product |
| 720 |
Tweet Counts Per Frequency |
| 721 |
Two City Scheduling |
| 722 |
Two Sum BSTs |
| 723 |
Two Sum II - Input Array Is Sorted |
| 724 |
UTF-8 Validation |
| 725 |
Ugly Number II |
| 726 |
Uncrossed Lines |
| 727 |
Unique Binary Search Trees |
| 728 |
Unique Paths II |
| 729 |
Unique Paths |
| 730 |
Unique Word Abbrevation |
| 731 |
Valid Parenthesis String |
| 732 |
Valid Square |
| 733 |
Valid Sudoku |
| 734 |
Valid Tic-Tac-Toe State |
| 735 |
Valid Triangle Number |
| 736 |
Validate Binary Search Tree |
| 737 |
Validate IP Address |
| 738 |
Validate Stack Sequences |
| 739 |
Verify Preorder Serialization of a Binary Tree |
| 740 |
Vowel Spellchecker |
| 741 |
Vowels of All Substrings |
| 742 |
Walls and Gates |
| 743 |
Water & Jug Problem |
| 744 |
Watering Plants |
| 745 |
Web Crawler |
| 746 |
Wiggle Sort |
| 747 |
Wiggle Subsequence |
| 748 |
Word Break |
| 749 |
Word Ladder |
| 750 |
Word Search |
| 751 |
Word Subsets |
| 752 |
ZigZag Conversion |
| 753 |
Zigzag Iterator |