-
Notifications
You must be signed in to change notification settings - Fork 49
LeetCode Questions
chubbysingh edited this page May 23, 2017
·
127 revisions
https://github.com/chubbysingh/coding/tree/master/src/Leetcode
π - Unlocked & Done π - Locked & Done π - Locked & Not Done [] - Not yet Done
| Status | Number | Title | Difficulty | Companies | Top Interview Question |
|---|---|---|---|---|---|
| π | 1 | Two Sum | Easy | LinkedIn, Uber, Airbnb, Facebook | Top Interview Question |
| π | 2 | Add Two Numbers | Medium | Airbnb | Top Interview Question |
| π | 3 | Longest Substring Without Repeating Characters | Medium | C | Top Interview Question |
| π | 4 | Median of Two Sorted Arrays | Hard | Top Interview Question | |
| π | 5 | Longest Palindromic Substring | Medium | Top Interview Question | |
| π | 6 | ZigZag Conversion | Medium | ||
| π | 7 | Reverse Integer | Easy | Top Interview Question | |
| π | 8 | String to Integer (atoi) | Medium | Uber | Top Interview Question |
| π | 9 | Palindrome Number | Easy | ||
| π | 10 | Regular Expression Matching | Hard | Google, Uber, Airbnb, Facebook | Top Interview Question |
| π | 11 | Container With Most Water | Medium | Top Interview Question | |
| π | 12 | Integer to Roman | Medium | ||
| π | 13 | Roman to Integer | Easy | Uber, Facebook | Top Interview Question |
| π | 14 | Longest Common Prefix | Easy | Top Interview Question | |
| π | 15 | 3Sum | Medium | Top Interview Question | |
| π | 16 | 3Sum Closest | Medium | ||
| π | 17 | Letter Combinations of a Phone Number | Medium | Google, Uber, Facebook | Top Interview Question |
| π | 18 | 4Sum | Medium | ||
| π | 19 | Remove Nth Node From End of List | Medium | Top Interview Question | |
| π | 20 | Valid Parentheses | Easy | Google, Airbnb, Facebook | Top Interview Question |
| π | 21 | Merge Two Sorted Lists | Easy | Top Interview Question | |
| π | 22 | Generate Parentheses | Medium | Google, Uber | Top Interview Question |
| π | 23 | Merge k Sorted Lists | Hard | LinkedIn, Google, Uber, Airbnb, Facebook | Top Interview Question |
| π | 24 | Swap Nodes in Pairs | Medium | Uber | |
| π | 25 | Reverse Nodes in k-Group | Hard | ||
| π | 26 | Remove Duplicates from Sorted Array | Easy | Top Interview Question | |
| π | 27 | Remove Element | Easy | ||
| π | 28 | Implement strStr() | Easy | Top Interview Question | |
| π | 29 | Divide Two Integers | Medium | Top Interview Question | |
| π | 30 | Substring with Concatenation of All Words | Hard | ||
| π | 31 | Next Permutation | Medium | ||
| π | 32 | Longest Valid Parentheses | Hard | ||
| π | 33 | Search in Rotated Sorted Array | Medium | LinkedIn, Uber, Facebook | Top Interview Question |
| π | 34 | Search for a Range | Medium | Top Interview Question | |
| π | 35 | Search Insert Position | Easy | ||
| π | 36 | Valid Sudoku | Medium | Uber | Top Interview Question |
| π | 37 | Sudoku Solver | Hard | Uber | |
| π | 38 | Count and Say | Easy | Top Interview Question | |
| π | 39 | Combination Sum | Medium | Uber | |
| π | 40 | Combination Sum II | Medium | ||
| π | 41 | First Missing Positive | Hard | Top Interview Question | |
| π | 42 | Trapping Rain Water | Hard | Top Interview Question | |
| π | 43 | Multiply Strings | Medium | ||
| π | 44 | Wildcard Matching | Hard | Google, Facebook | Top Interview Question |
| π | 45 | Jump Game II | Hard | ||
| π | 46 | Permutations | Medium | Top Interview Question | |
| π | 47 | Permutations II | Medium | ||
| π | 48 | Rotate Image | Medium | Top Interview Question | |
| π | 49 | Group Anagrams | Medium | Uber, Facebook | Top Interview Question |
| π | 50 | Pow(x, n) | Medium | LinkedIn, Google, Facebook | Top Interview Question |
| π | 51 | N-Queens | Hard | ||
| π | 52 | N-Queens II | Hard | ||
| π | 53 | Maximum Subarray | Easy | Top Interview Question | |
| π | 54 | Spiral Matrix | Medium | Google, Uber | Top Interview Question |
| π | 55 | Jump Game | Medium | Top Interview Question | |
| π | 56 | Merge Intervals | Medium | LinkedIn, Google, Facebook | Top Interview Question |
| π | 57 | Insert Interval | Hard | LinkedIn, Google, Facebook | |
| π | 58 | Length of Last Word | Easy | ||
| π | 59 | Spiral Matrix II | Medium | ||
| π | 60 | Permutation Sequence | Medium | ||
| π | 61 | Rotate List | Medium | ||
| π | 62 | Unique Paths | Medium | Top Interview Question | |
| π | 63 | Unique Paths II | Medium | ||
| π | 64 | Minimum Path Sum | Medium | ||
| π | 65 | Valid Number | Hard | ||
| π | 66 | Plus One | Easy | Top Interview Question | |
| π | 67 | Add Binary | Easy | ||
| π | 68 | Text Justification | Hard | LinkedIn, Airbnb | |
| π | 69 | Sqrt(x) | Easy | Top Interview Question | |
| π | 70 | Climbing Stairs | Easy | Top Interview Question | |
| π | 71 | Simplify Path | Medium | ||
| π | 72 | Edit Distance | Hard | ||
| π | 73 | Set Matrix Zeroes | Medium | Top Interview Question | |
| π | 74 | Search a 2D Matrix | Medium | ||
| π | 75 | Sort Colors | Medium | Top Interview Question | |
| π | 76 | Minimum Window Substring | Hard | LinkedIn, Uber, Facebook | Top Interview Question |
| π | 77 | Combinations | Medium | ||
| π | 78 | Subsets | Medium | Uber, Facebook | Top Interview Question |
| π | 79 | Word Search | Medium | Top Interview Question | |
| π | 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 | Top Interview Question | |
| π | 85 | Maximal Rectangle | Hard | ||
| π | 86 | Partition List | Medium | ||
| π | 87 | Scramble String | Hard | ||
| π | 88 | Merge Sorted Array | Easy | Top Interview Question | |
| π | 89 | Gray Code | Medium | ||
| π | 90 | Subsets II | Medium | ||
| π | 91 | Decode Ways | Medium | Uber, Facebook | Top Interview Question |
| π | 92 | Reverse Linked List II | Medium | ||
| π | 93 | Restore IP Addresses | Medium | ||
| π | 94 | Binary Tree Inorder Traversal | Medium | Top Interview Question | |
| π | 95 | Unique Binary Search Trees II | Medium | ||
| π | 96 | Unique Binary Search Trees | Medium | ||
| π | 97 | Interleaving String | Hard | ||
| π | 98 | Validate Binary Search Tree | Medium | Top Interview Question | |
| π | 99 | Recover Binary Search Tree | Hard | ||
| π | 100 | Same Tree | Easy | ||
| π | 101 | Symmetric Tree | Easy | Top Interview Question | |
| π | 102 | Binary Tree Level Order Traversal | Medium | LinkedIn, Facebook | Top Interview Question |
| π | 103 | Binary Tree Zigzag Level Order Traversal | Medium | Top Interview Question | |
| π | 104 | Maximum Depth of Binary Tree | Easy | LinkedIn, Uber | Top Interview Question |
| π | 105 | Construct Binary Tree from Preorder and Inorder Traversal | Medium | Top Interview Question | |
| π | 106 | Construct Binary Tree from Inorder and Postorder Traversal | Medium | ||
| π | 107 | Binary Tree Level Order Traversal II | Easy | ||
| π | 108 | Convert Sorted Array to Binary Search Tree | Easy | Airbnb | Top Interview Question |
| π | 109 | Convert Sorted List to Binary Search Tree | Medium | ||
| π | 110 | Balanced Binary Tree | Easy | ||
| π | 111 | Minimum Depth of Binary Tree | Easy | ||
| π | 112 | Path Sum | Easy | ||
| π | 113 | Path Sum II | Medium | ||
| π | 114 | Flatten Binary Tree to Linked List | Medium | ||
| π | 115 | Distinct Subsequences | Hard | ||
| π | 116 | Populating Next Right Pointers in Each Node | Medium | Top Interview Question | |
| π | 117 | Populating Next Right Pointers in Each Node II | Medium | ||
| π | 118 | Pascal's Triangle | Easy | Top Interview Question | |
| π | 119 | Pascal's Triangle II | Easy | ||
| π | 120 | Triangle | Medium | ||
| π | 121 | Best Time to Buy and Sell Stock | Easy | Uber, Facebook | Top Interview Question |
| π | 122 | Best Time to Buy and Sell Stock II | Easy | Top Interview Question | |
| π | 123 | Best Time to Buy and Sell Stock III | Hard | ||
| π | 124 | Binary Tree Maximum Path Sum | Hard | Top Interview Question | |
| π | 125 | Valid Palindrome | Easy | Uber, Facebook | Top Interview Question |
| π | 126 | Word Ladder II | Hard | ||
| π | 127 | Word Ladder | Medium | LinkedIn, Facebook | Top Interview Question |
| π | 128 | Longest Consecutive Sequence | Hard | Google, Facebook | Top Interview Question |
| π | 129 | Sum Root to Leaf Numbers | Medium | ||
| π | 130 | Surrounded Regions | Medium | Top Interview Question | |
| π | 131 | Palindrome Partitioning | Medium | Top Interview Question | |
| π | 132 | Palindrome Partitioning II | Hard | ||
| π | 133 | Clone Graph | Medium | Google, Uber, Facebook | |
| π | 134 | Gas Station | Medium | Top Interview Question | |
| π | 135 | Candy | Hard | ||
| π | 136 | Single Number | Easy | Airbnb | Top Interview Question |
| π | 137 | Single Number II | Medium | ||
| π | 138 | Copy List with Random Pointer | Medium | Uber | Top Interview Question |
| π | 139 | Word Break | Medium | Google, Uber, Facebook | Top Interview Question |
| π | 140 | Word Break II | Hard | Google, Uber | Top Interview Question |
| π | 141 | Linked List Cycle | Easy | Top Interview Question | |
| π | 142 | Linked List Cycle II | Medium | ||
| π | 143 | Reorder List | Medium | ||
| π | 144 | Binary Tree Preorder Traversal | Medium | ||
| π | 145 | Binary Tree Postorder Traversal | Hard | ||
| π | 146 | LRU Cache | Hard | Google, Uber, Facebook | Top Interview Question |
| π | 147 | Insertion Sort List | Medium | ||
| π | 148 | Sort List | Medium | Top Interview Question | |
| π | 149 | Max Points on a Line | Hard | Top Interview Question | |
| π | 150 | Evaluate Reverse Polish Notation | Medium | Top Interview Question | |
| π | 151 | Reverse Words in a String | Medium | ||
| π | 152 | Maximum Product Subarray | Medium | Top Interview Question | |
| π | 153 | Find Minimum in Rotated Sorted Array | Medium | ||
| π | 154 | Find Minimum in Rotated Sorted Array II | Hard | ||
| π | 155 | Min Stack | Easy | Google, Uber | Top Interview Question |
| π | 156 | Binary Tree Upside Down | Medium | ||
| π | 157 | Read N Characters Given Read4 | Easy | ||
| π | 158 | Read N Characters Given Read4 II - Call multiple times | Hard | Google, Facebook | |
| π | 159 | Longest Substring with At Most Two Distinct Characters | Hard | ||
| π | 160 | Intersection of Two Linked Lists | Easy | Airbnb | Top Interview Question |
| π | 161 | One Edit Distance | Medium | Uber, Facebook | |
| π | 162 | Find Peak Element | Medium | Top Interview Question | |
| π | 163 | Missing Ranges | Medium | Top Interview Question | |
| π | 164 | Maximum Gap | Hard | ||
| π | 165 | Compare Version Numbers | Medium | ||
| π | 166 | Fraction to Recurring Decimal | Medium | Top Interview Question | |
| π | 167 | Two Sum II - Input array is sorted | Easy | ||
| π | 168 | Excel Sheet Column Title | Easy | ||
| π | 169 | Majority Element | Easy | Top Interview Question | |
| π | 170 | Two Sum III - Data structure design | Easy | ||
| π | 171 | Excel Sheet Column Number | Easy | Uber | Top Interview Question |
| π | 172 | Factorial Trailing Zeroes | Easy | Top Interview Question | |
| π | 173 | Binary Search Tree Iterator | Medium | LinkedIn, Google, Facebook | |
| π | 174 | Dungeon Game | Hard | ||
| π | 179 | Largest Number | Medium | Top Interview Question | |
| π | 186 | Reverse Words in a String II | Medium | Uber | |
| π | 187 | Repeated DNA Sequences | Medium | ||
| π | 188 | Best Time to Buy and Sell Stock IV | Hard | ||
| π | 189 | Rotate Array | Easy | Top Interview Question | |
| π | 190 | Reverse Bits | Easy | Airbnb | Top Interview Question |
| π | 191 | Number of 1 Bits | Easy | Top Interview Question | |
| π | 198 | House Robber | Easy | LinkedIn, Airbnb | Top Interview Question |
| π | 199 | Binary Tree Right Side View | Medium | ||
| π | 200 | Number of Islands | Medium | Google, Facebook | Top Interview Question |
| π | 201 | Bitwise AND of Numbers Range | Medium | ||
| π | 202 | Happy Number | Easy | Uber, Airbnb | Top Interview Question |
| π | 203 | Remove Linked List Elements | Easy | ||
| π | 204 | Count Primes | Easy | Top Interview Question | |
| π | 205 | Isomorphic Strings | Easy | ||
| π | 206 | Reverse Linked List | Easy | Uber, Facebook | Top Interview Question |
| π | 207 | Course Schedule | Medium | Top Interview Question | |
| π | 208 | Implement Trie (Prefix Tree) | Medium | Google, Uber, Facebook | Top Interview Question |
| π | 209 | Minimum Size Subarray Sum | Medium | ||
| π | 210 | Course Schedule II | Medium | Top Interview Question | |
| π | 211 | Add and Search Word - Data structure design | Medium | ||
| π | 212 | Word Search II | Hard | Google, Airbnb | Top Interview Question |
| π | 213 | House Robber II | Medium | ||
| π | 214 | Shortest Palindrome | Hard | ||
| π | 215 | Kth Largest Element in an Array | Medium | Top Interview Question | |
| π | 216 | Combination Sum III | Medium | ||
| π | 217 | Contains Duplicate | Easy | Airbnb | Top Interview Question |
| π | 218 | The Skyline Problem | Hard | Google, Facebook | Top Interview Question |
| π | 219 | Contains Duplicate II | Easy | Airbnb | |
| π | 220 | Contains Duplicate III | Medium | Airbnb | |
| π | 221 | Maximal Square | Medium | Airbnb, Facebook | |
| π | 222 | Count Complete Tree Nodes | Medium | ||
| π | 223 | Rectangle Area | Medium | ||
| π | 224 | Basic Calculator | Hard | ||
| π | 225 | Implement Stack using Queues | Easy | ||
| π | 226 | Invert Binary Tree | Easy | ||
| π | 227 | Basic Calculator II | Medium | Top Interview Question | |
| π | 228 | Summary Ranges | Medium | ||
| π | 229 | Majority Element II | Medium | ||
| π | 230 | Kth Smallest Element in a BST | Medium | Google, Uber | Top Interview Question |
| π | 231 | Power of Two | Easy | ||
| π | 232 | Implement Queue using Stacks | Easy | ||
| π | 233 | Number of Digit One | Hard | ||
| π | 234 | Palindrome Linked List | Easy | Top Interview Question | |
| π | 235 | Lowest Common Ancestor of a Binary Search Tree | Easy | ||
| π | 236 | Lowest Common Ancestor of a Binary Tree | Medium | LinkedIn, Facebook | Top Interview Question |
| π | 237 | Delete Node in a Linked List | Easy | Top Interview Question | |
| π | 238 | Product of Array Except Self | Medium | LinkedIn, Facebook | Top Interview Question |
| π | 239 | Sliding Window Maximum | Hard | Top Interview Question | |
| π | 240 | Search a 2D Matrix II | Medium | Top Interview Question | |
| π | 241 | Different Ways to Add Parentheses | Medium | ||
| π | 242 | Valid Anagram | Easy | Uber | Top Interview Question |
| π | 243 | Shortest Word Distance | Easy | ||
| π | 244 | Shortest Word Distance II | Medium | ||
| π | 245 | Shortest Word Distance III | Medium | ||
| π | 246 | Strobogrammatic Number | Easy | ||
| π | 247 | Strobogrammatic Number II | Medium | ||
| π | 248 | Strobogrammatic Number III | Hard | ||
| π | 249 | Group Shifted Strings | Medium | Google, Uber | |
| π | 250 | Count Univalue Subtrees | Medium | ||
| π | 251 | Flatten 2D Vector | Medium | Google, Airbnb | Top Interview Question |
| π | 252 | Meeting Rooms | Easy | ||
| π | 253 | Meeting Rooms II | Medium | Google, Facebook | Top Interview Question |
| π | 254 | Factor Combinations | Medium | LinkedIn, Uber | |
| π | 255 | Verify Preorder Sequence in Binary Search Tree | Medium | ||
| π | 256 | Paint House | Easy | ||
| π | 257 | Binary Tree Paths | Easy | Google, Facebook | |
| π | 258 | Add Digits | Easy | ||
| π | 259 | 3Sum Smaller | Medium | ||
| π | 260 | Single Number III | Medium | ||
| π | 261 | Graph Valid Tree | Medium | Google, Facebook | |
| π | 263 | Ugly Number | Easy | ||
| π | 264 | Ugly Number II | Medium | ||
| π | 265 | Paint House II | Hard | ||
| π | 266 | Palindrome Permutation | Easy | Google, Uber | |
| π | 267 | Palindrome Permutation II | Medium | ||
| π | 268 | Missing Number | Easy | Top Interview Question | |
| π | 269 | Alien Dictionary | Hard | Google, Airbnb, Facebook | Top Interview Question |
| π | 270 | Closest Binary Search Tree Value | Easy | ||
| π | 271 | Encode and Decode Strings | Medium | ||
| π | 272 | Closest Binary Search Tree Value II | Hard | ||
| [] | 273 | Integer to English Words | Hard | ||
| π | 274 | H-Index | Medium | Google, Facebook | |
| π | 275 | H-Index II | Medium | ||
| π | 276 | Paint Fence | Easy | ||
| π | 277 | Find the Celebrity | Medium | LinkedIn, Facebook | Top Interview Question |
| π | 278 | First Bad Version | Easy | ||
| π | 279 | Perfect Squares | Medium | Top Interview Question | |
| π | 280 | Wiggle Sort | Medium | ||
| π | 281 | Zigzag Iterator | Medium | ||
| π | 282 | Expression Add Operators | Hard | Google, Facebook | |
| π | 283 | Move Zeroes | Easy | Top Interview Question | |
| π | 284 | Peeking Iterator | Medium | ||
| π | 285 | Inorder Successor in BST | Medium | ||
| π | 286 | Walls and Gates | Medium | Google, Facebook | |
| π | 287 | Find the Duplicate Number | Medium | Top Interview Question | |
| π | 288 | Unique Word Abbreviation | Medium | ||
| π | 289 | Game of Life | Medium | Top Interview Question | |
| π | 290 | Word Pattern | Easy | Uber | |
| π | 291 | Word Pattern II | Hard | Uber | |
| π | 292 | Nim Game | Easy | ||
| π | 293 | Flip Game | Easy | ||
| π | 294 | Flip Game II | Medium | ||
| π | 295 | Find Median from Data Stream | Hard | Top Interview Question | |
| π | 296 | Best Meeting Point | Hard | ||
| π | 297 | Serialize and Deserialize Binary Tree | Hard | LinkedIn, Google, Uber, Facebook | Top Interview Question |
| π | 298 | Binary Tree Longest Consecutive Sequence | Medium | ||
| π | 299 | Bulls and Cows | Medium | ||
| π | 300 | Longest Increasing Subsequence | Medium | Top Interview Question | |
| π | 301 | Remove Invalid Parentheses | Hard | ||
| π | 302 | Smallest Rectangle Enclosing Black Pixels | Hard | ||
| π | 303 | Range Sum Query - Immutable | Easy | ||
| π | 304 | Range Sum Query 2D - Immutable | Medium | ||
| π | 305 | Number of Islands II | Hard | ||
| [] | 306 | Additive Number | Medium | ||
| π | 307 | Range Sum Query - Mutable | Medium | ||
| π | 308 | Range Sum Query 2D - Mutable | Hard | Top Interview Question | |
| π | 309 | Best Time to Buy and Sell Stock with Cooldown | Medium | ||
| [] | 310 | Minimum Height Trees | Medium | ||
| π | 311 | Sparse Matrix Multiplication | Medium | LinkedIn, Facebook | |
| π | 312 | Burst Balloons | Hard | ||
| π | 313 | Super Ugly Number | Medium | ||
| π | 314 | Binary Tree Vertical Order Traversal | Medium | Google, Facebook | |
| π | 315 | Count of Smaller Numbers After Self | Hard | Top Interview Question | |
| [] | 316 | Remove Duplicate Letters | Hard | ||
| π | 317 | Shortest Distance from All Buildings | Hard | ||
| π | 318 | Maximum Product of Word Lengths | Medium | ||
| π | 319 | Bulb Switcher | Medium | ||
| π | 320 | Generalized Abbreviation | Medium | ||
| [] | 321 | Create Maximum Number | Hard | ||
| π | 322 | Coin Change | Medium | Top Interview Question | |
| π | 323 | Number of Connected Components in an Undirected Graph | Medium | ||
| π | 324 | Wiggle Sort II | Medium | Top Interview Question | |
| π | 325 | Maximum Size Subarray Sum Equals k | Medium | ||
| π | 326 | Power of Three | Easy | Top Interview Question | |
| π | 327 | Count of Range Sum | Hard | ||
| π | 328 | Odd Even Linked List | Medium | Top Interview Question | |
| π | 329 | Longest Increasing Path in a Matrix | Hard | Top Interview Question | |
| π | 330 | Patching Array | Hard | ||
| π | 331 | Verify Preorder Serialization of a Binary Tree | Medium | ||
| π | 332 | Reconstruct Itinerary | Medium | ||
| π | 333 | Largest BST Subtree | Medium | ||
| π | 334 | Increasing Triplet Subsequence | Medium | Top Interview Question | |
| π | 335 | Self Crossing | Hard | ||
| π | 336 | Palindrome Pairs | Hard | Google, Airbnb | |
| π | 337 | House Robber III | Medium | Uber | |
| π | 338 | Counting Bits | Medium | ||
| π | 339 | Nested List Weight Sum | Easy | ||
| π | 340 | Longest Substring with At Most K Distinct Characters | Hard | Top Interview Question | |
| π | 341 | Flatten Nested List Iterator | Medium | Top Interview Question | |
| π | 342 | Power of Four | Easy | ||
| π | 343 | Integer Break | Medium | ||
| π | 344 | Reverse String | Easy | C | Top Interview Question |
| π | 345 | Reverse Vowels of a String | Easy | ||
| π | 346 | Moving Average from Data Stream | Easy | ||
| π | 347 | Top K Frequent Elements | Medium | C | Top Interview Question |
| π | 348 | Design Tic-Tac-Toe | Medium | C | Top Interview Question |
| π | 349 | Intersection of Two Arrays | Easy | ||
| π | 350 | Intersection of Two Arrays II | Easy | C | Top Interview Question |
| π | 351 | Android Unlock Patterns | Medium | ||
| π | 352 | Data Stream as Disjoint Intervals | Hard | ||
| π | 353 | Design Snake Game | Medium | ||
| π | 354 | Russian Doll Envelopes | Hard | ||
| π | 355 | Design Twitter | Medium | ||
| π | 356 | Line Reflection | Medium | ||
| π | 357 | Count Numbers with Unique Digits | Medium | ||
| π | 358 | Rearrange String k Distance Apart | Hard | ||
| π | 359 | Logger Rate Limiter | Easy | ||
| π | 360 | Sort Transformed Array | Medium | ||
| π | 361 | Bomb Enemy | Medium | ||
| π | 362 | Design Hit Counter | Medium | ||
| [] | 363 | Max Sum of Rectangle No Larger Than K | Hard | ||
| π | 364 | Nested List Weight Sum II | Medium | ||
| π | 365 | Water and Jug Problem | Medium | ||
| π | 366 | Find Leaves of Binary Tree | Medium | ||
| π | 367 | Valid Perfect Square | Easy | ||
| π | 368 | Largest Divisible Subset | Medium | ||
| π | 369 | Plus One Linked List | Medium | ||
| π | 370 | Range Addition | Medium | ||
| π | 371 | Sum of Two Integers | Easy | C | Top Interview Question |
| π | 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 | C | Top Interview Question |
| π | 379 | Design Phone Directory | Medium | ||
| π | 380 | Insert Delete GetRandom O(1) | Medium | C | Top Interview Question |
| [] | 381 | Insert Delete GetRandom O(1) - Duplicates allowed | Hard | ||
| π | 382 | Linked List Random Node | Medium | ||
| π | 383 | Ransom Note | Easy | ||
| π | 384 | Shuffle an Array | Medium | C | Top Interview Question |
| π | 385 | Mini Parser | Medium | ||
| π | 386 | Lexicographical Numbers | Medium | ||
| π | 387 | First Unique Character in a String | Easy | C | Top Interview Question |
| π | 388 | Longest Absolute File Path | Medium | ||
| π | 389 | Find the Difference | Easy | ||
| π | 390 | Elimination Game | Medium | ||
| [] | 391 | Perfect Rectangle | Hard | ||
| π | 392 | Is Subsequence | Medium | ||
| [] | 393 | UTF-8 Validation | Medium | ||
| π | 394 | Decode String | Medium | ||
| π | 395 | Longest Substring with At Least K Repeating Characters | Medium | C | Top Interview Question |
| π | 396 | Rotate Function | Medium | ||
| π | 397 | Integer Replacement | Medium | ||
| π | 398 | Random Pick Index | Medium | ||
| [] | 399 | Evaluate Division | Medium | ||
| π | 400 | Nth Digit | Easy | ||
| π | 401 | Binary Watch | Easy | ||
| π | 402 | Remove K Digits | Medium | ||
| [] | 403 | Frog Jump | Hard | ||
| π | 404 | Sum of Left Leaves | Easy | ||
| π | 405 | Convert a Number to Hexadecimal | Easy | ||
| π | 406 | Queue Reconstruction by Height | Medium | ||
| [] | 407 | Trapping Rain Water II | Hard | ||
| π | 408 | Valid Word Abbreviation | Easy | ||
| π | 409 | Longest Palindrome | Easy | ||
| [] | 410 | Split Array Largest Sum | Hard | ||
| π | 411 | Minimum Unique Word Abbreviation | Hard | ||
| π | 412 | Fizz Buzz | Easy | C | Top Interview Question |
| π | 413 | Arithmetic Slices | Medium | ||
| π | 414 | Third Maximum Number | Easy | ||
| π | 415 | Add Strings | Easy | ||
| π | 416 | Partition Equal Subset Sum | Medium | ||
| [] | 417 | Pacific Atlantic Water Flow | Medium | ||
| π | 418 | Sentence Screen Fitting | Medium | ||
| π | 419 | Battleships in a Board | Medium | ||
| [] | 420 | Strong Password Checker | Hard | ||
| π | 421 | Maximum XOR of Two Numbers in an Array | Medium | ||
| π | 422 | Valid Word Square | Easy | ||
| π | 423 | Reconstruct Original Digits from English | Medium | ||
| [] | 424 | Longest Repeating Character Replacement | Medium | ||
| π | 425 | Word Squares | Hard | ||
| [] | 432 | All O`one Data Structure | Hard | ||
| π | 434 | Number of Segments in a String | Easy | ||
| π | 435 | Non-overlapping Intervals | Medium | ||
| [] | 436 | Find Right Interval | Medium | ||
| π | 437 | Path Sum III | Easy | ||
| π | 438 | Find All Anagrams in a String | Easy | ||
| π | 439 | Ternary Expression Parser | Medium | ||
| [] | 440 | K-th Smallest in Lexicographical Order | Hard | ||
| π | 441 | Arranging Coins | Easy | ||
| π | 442 | Find All Duplicates in an Array | Medium | ||
| π | 444 | Sequence Reconstruction | Medium | ||
| π | 445 | Add Two Numbers II | Medium | ||
| [] | 446 | Arithmetic Slices II - Subsequence | Hard | ||
| π | 447 | Number of Boomerangs | Easy | ||
| π | 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 | C | Top Interview Question |
| π | 455 | Assign Cookies | Easy | ||
| π | 456 | 132 Pattern | Medium | ||
| π | 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 | ||
| π | 465 | Optimal Account Balancing | Hard | ||
| [] | 466 | Count The Repetitions | Hard | ||
| π | 467 | Unique Substrings in Wraparound String | Medium | ||
| π | 468 | Validate IP Address | Medium | ||
| π | 469 | Convex Polygon | Medium | ||
| π | 471 | Encode String with Shortest Length | Hard | ||
| [] | 472 | Concatenated Words | Hard | ||
| [] | 473 | Matchsticks to Square | Medium | ||
| π | 474 | Ones and Zeroes | Medium | ||
| π | 475 | Heaters | Easy | ||
| π | 476 | Number Complement | Easy | ||
| π | 477 | Total Hamming Distance | Medium | ||
| [] | 480 | Sliding Window Median | Hard | ||
| π | 481 | Magical String | Medium | ||
| π | 482 | License Key Formatting | Medium | ||
| [] | 483 | Smallest Good Base | Hard | ||
| π | 484 | Find Permutation | Medium | ||
| π | 485 | Max Consecutive Ones | Easy | ||
| [] | 486 | Predict the Winner | Medium | ||
| π | 487 | Max Consecutive Ones II | Medium | ||
| [] | 488 | Zuma Game | Hard | ||
| π | 490 | The Maze | Medium | ||
| [] | 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 | ||
| π | 499 | The Maze III | Hard | ||
| π | 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 | ||
| π | 505 | The Maze II | Medium | ||
| π | 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 | ||
| π | 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 | ||
| [] | 525 | Contiguous Array | Medium | ||
| [] | 526 | Beautiful Arrangement | Medium | ||
| π | 527 | Word Abbreviation | Hard | ||
| [] | 529 | Minesweeper | Medium | ||
| π | 530 | Minimum Absolute Difference in BST | Easy | ||
| π | 531 | Lonely Pixel I | Medium | ||
| π | 532 | K-diff Pairs in an Array | Easy | ||
| π | 533 | Lonely Pixel II | Medium | ||
| π | 535 | Encode and Decode TinyURL | Medium | ||
| π | 536 | Construct Binary Tree from String | Medium | ||
| π | 537 | Complex Number Multiplication | Medium | ||
| [] | 538 | Convert BST to Greater Tree | Medium | ||
| [] | 539 | Minimum Time Difference | Medium | ||
| π | 541 | Reverse String II | Easy | ||
| [] | 542 | 01 Matrix | Medium | ||
| π | 543 | Diameter of Binary Tree | Easy | ||
| π | 544 | Output Contest Matches | Medium | ||
| π | 545 | Boundary of Binary Tree | Medium | ||
| [] | 546 | Remove Boxes | Hard | ||
| [] | 547 | Friend Circles | Medium | ||
| π | 548 | Split Array with Equal Sum | Medium | ||
| π | 549 | Binary Tree Longest Consecutive Sequence II | Medium | ||
| π | 551 | Student Attendance Record I | Easy | ||
| [] | 552 | Student Attendance Record II | Hard | ||
| [] | 553 | Optimal Division | Medium | ||
| [] | 554 | Brick Wall | Medium | ||
| π | 555 | Split Concatenated Strings | 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 | ||
| π | 562 | Longest Line of Consecutive One in Matrix | Medium | ||
| π | 563 | Binary Tree Tilt | Easy | ||
| [] | 564 | Find the Closest Palindrome | Hard | ||
| π | 566 | Reshape the Matrix | Easy | ||
| π | 567 | Permutation in String | Medium | ||
| π | 568 | Maximum Vacation Days | Hard | ||
| π | 572 | Subtree of Another Tree | Easy | ||
| π | 573 | Squirrel Simulation | Medium | ||
| π | 575 | Distribute Candies | Easy | ||
| [] | 576 | Out of Boundary Paths | Hard | ||
| π | 581 | Shortest Unsorted Continuous Subarray | Easy | ||
| π | 582 | Kill Process | Medium | ||
| π | 583 | Delete Operation for Two Strings | Medium | ||
| [] | 587 | Erect the Fence | Hard | ||
| [] | 588 | Design In-Memory File System | Hard | ||
| [] | 592 | Fraction Addition and Subtraction | Medium | ||
| π | 593 | Valid Square | Medium | ||
| π | 594 | Longest Harmonious Subsequence | Easy |