Author: github.com/lzl124631x
My Code for LeetCode OJ.
| # | Title | Difficulty |
|---|---|---|
| 412 | Fizz Buzz | Easy |
| 463 | Island Perimeter | Easy |
| 344 | Reverse String | Easy |
| 371 | Sum of Two Integers | Easy |
| 415 | Add Strings | Easy |
| 441 | Arranging Coins | Easy |
| 455 | Assign Cookies | Easy |
| 401 | Binary Watch | Easy |
| 405 | Convert a Number to Hexadecimal | Easy |
| 438 | Find All Anagrams in a String | Easy |
| 299 | Bulls and Cows | Easy |
| 389 | Find the Difference | Easy |
| 387 | First Unique Character in a String | Easy |
| 374 | Guess Number Higher or Lower | Easy |
| 349 | Intersection of Two Arrays | Easy |
| 350 | Intersection of Two Arrays II | Easy |
| 409 | Longest Palindrome | Easy |
| 453 | Minimum Moves to Equal Array Elements | Easy |
| 400 | Nth Digit | Easy |
| 447 | Number of Boomerangs | Easy |
| 342 | Power of Four | Easy |
| 383 | Ransom Note | Easy |
| 459 | Repeated Substring Pattern | Easy |
| 414 | Third Maximum Number | Easy |
| 404 | Sum of Left Leaves | Easy |
| 434 | Number of Segments in a String | Easy |
| 345 | Reverse Vowels of a String | Easy |
| 396 | Rotate Function | Easy |
| 112 | Path Sum | Easy |
| 113 | Path Sum II | Medium |
| 437 | Path Sum III | Easy |
| 475 | Heaters | Easy |
| 419 | Battleships in a Board | Medium |
| 338 | Counting Bits | Medium |
| 413 | Arithmetic Slices | Medium |
| 357 | Count Numbers with Unique Digits | Medium |
| 343 | Integer Break | Medium |
| 392 | Is Subsequence | Medium |
| 39 | Combination Sum | Medium |
| 40 | Combination Sum II | Medium |
| 216 | Combination Sum III | Medium |
| 377 | Combination Sum IV | Medium |
| 474 | Ones and Zeroes | Medium |
| 467 | Unique Substrings in Wraparound String | Medium |
| 466 | Count The Repetitions | Hard |
| 464 | Can I Win | Medium |
| 446 | Arithmetic Slices II - Subsequence | Hard |
| 416 | Partition Equal Subset Sum | Medium |
| 461 | Hamming Distance | Easy |
| 448 | Find All Numbers Disappeared in an Array | Easy |
| 410 | Split Array Largest Sum | Hard |
| 403 | Frog Jump | Hard |
| 376 | Wiggle Subsequence | Medium |
| 375 | Guess Number Higher or Lower II | Medium |
| 368 | Largest Divisible Subset | Medium |
| 322 | Coin Change | Medium |
| 221 | Maximal Square | Medium |
| 477 | Total Hamming Distance | Medium |
| 208 | Implement Trie (Prefix Tree) | Medium |
| 211 | Add and Search Word - Data structure design | Medium |
| 421 | Maximum XOR of Two Numbers in an Array | Medium |
| 472 | Concatenated Words | Hard |
| 212 | Word Search II | Hard |
| 336 | Palindrome Pairs | Hard |
| 382 | Linked List Random Node | Medium |
| 398 | Random Pick Index | Medium |
| 442 | Find All Duplicates in an Array | Medium |
| 1 | Two Sum | Easy |
| 167 | Two Sum II - Input array is sorted | Medium |
| 169 | Majority Element | Easy |
| 229 | Majority Element II | Medium |
| 380 | Insert Delete GetRandom O(1) | Hard |
| 381 | Insert Delete GetRandom O(1) - Duplicates allowed | Hard |
| 153 | Find Minimum in Rotated Sorted Array | Medium |
| 154 | Find Minimum in Rotated Sorted Array II | Hard |
| 451 | Sort Characters By Frequency | Medium |
| 84 | Largest Rectangle in Histogram | Medium |
| 85 | Maximal Rectangle | Hard |
| 127 | Word Ladder | Hard |
| 126 | Word Ladder II | Hard |
| 476 | Number Complement | Easy |
| 481 | Magical String | Medium |
| 482 | License Key Formatting | Medium |
| 480 | Sliding Window Median | Hard |
| 15 | 3Sum | Medium |
| 16 | 3Sum Closest | Medium |
| 18 | 4Sum | Medium |
| 454 | 4Sum II | Medium |
| 355 | Design Twitter | Medium |
| 76 | Minimum Window Substring | Hard |
| 30 | Substring with Concatenation of All Words | Hard |
| 2 | Add Two Numbers | Medium |
| 445 | Add Two Numbers II | Medium |
| 328 | Odd Even Linked List | Medium |
| 214 | Shortest Palindrome | Hard |
| 468 | Validate IP Address | Medium |
| 385 | Mini Parser | Medium |
| 72 | Edit Distance | Hard |
| 53 | Maximum Subarray | Medium |
| 363 | Max Sum of Rectangle No Larger Than K | Hard |
| 354 | Russian Doll Envelopes | Hard |
| 300 | Longest Increasing Subsequence | Medium |
| 115 | Distinct Subsequences | Hard |
| 321 | Create Maximum Number | Hard |
| 121 | Best Time to Buy and Sell Stock | Easy |
| 122 | Best Time to Buy and Sell Stock II | Medium |
| 123 | Best Time to Buy and Sell Stock III | Hard |
| 188 | Best Time to Buy and Sell Stock IV | Hard |
| 309 | Best Time to Buy and Sell Stock with Cooldown | Hard |
| 279 | Perfect Squares | Medium |
| 204 | Count Primes | Easy |
| 21 | Merge Two Sorted Lists | Easy |
| 23 | Merge k Sorted Lists | Hard |
| 412 | Fizz Buzz | Easy |
| 263 | Ugly Number | Easy |
| 264 | Ugly Number II | Medium |
| 313 | Super Ugly Number | Medium |
| 303 | Range Sum Query - Immutable | Easy |
| 304 | Range Sum Query 2D - Immutable | Medium |
| 174 | Dungeon Game | Hard |
| 485 | Max Consecutive Ones | Easy |
| 487 | Max Consecutive Ones II | Medium |
| 488 | Zuma Game | Hard |
| 307 | Range Sum Query - Mutable | Medium |
| 315 | Count of Smaller Numbers After Self | Hard |
| 100 | Same Tree | Easy |
| 101 | Symmetric Tree | Easy |
| 104 | Maximum Depth of Binary Tree | Easy |
| 111 | Minimum Depth of Binary Tree | Easy |
| 94 | Binary Tree Inorder Traversal | Medium |
| 144 | Binary Tree Preorder Traversal | Medium |
| 145 | Binary Tree Postorder Traversal | Hard |
| 98 | Validate Binary Search Tree | Medium |
| 173 | Binary Search Tree Iterator | Medium |
| 257 | Binary Tree Paths | Easy |
| 473 | Matchsticks to Square | Medium |
| 67 | Add Binary | Easy |
| 110 | Balanced Binary Tree | Easy |
| 13 | Roman to Integer | Easy |
| 12 | Integer to Roman | Medium |
| 58 | Length of Last Word | Easy |
| 66 | Plus One | Easy |
| 74 | Search a 2D Matrix | Medium |
| 240 | Search a 2D Matrix II | Medium |
| 218 | The Skyline Problem | Hard |
| 394 | Decode String | Medium |
| 17 | Letter Combinations of a Phone Number | Medium |
| 129 | Sum Root to Leaf Numbers | Medium |
| 35 | Search Insert Position | Medium |
| 33 | Search in Rotated Sorted Array | Hard |
| 81 | Search in Rotated Sorted Array II | Medium |
| 10 | Regular Expression Matching | Hard |
| 27 | Remove Element | Easy |
| 61 | Rotate List | Medium |
| 143 | Reorder List | Medium |
| 206 | Reverse Linked List | Easy |
| 92 | Reverse Linked List II | Medium |
| 7 | Reverse Integer | Easy |
| 344 | Reverse String | Easy |
| 190 | Reverse Bits | Easy |
| 19 | Remove Nth Node From End of List | Easy |
| 69 | Sqrt(x) | Medium |
| 6 | ZigZag Conversion | Easy |
| 48 | Rotate Image | Medium |
| 38 | Count and Say | Easy |
| 417 | Pacific Atlantic Water Flow | Medium |
| 20 | Valid Parentheses | Easy |
| 36 | Valid Sudoku | Easy |
| 371 | Sum of Two Integers | Easy |
| 24 | Swap Nodes in Pairs | Easy |
| 62 | Unique Paths | Medium |
| 63 | Unique Paths II | Medium |
| 136 | Single Number | Easy |
| 137 | Single Number II | Medium |
| 260 | Single Number III | Medium |
| 78 | Subsets | Medium |
| 90 | Subsets II | Medium |
| 147 | Insertion Sort List | Medium |
| 88 | Merge Sorted Array | Easy |
| 75 | Sort Colors | Medium |
| 226 | Invert Binary Tree | Easy |
| 141 | Linked List Cycle | Easy |
| 142 | Linked List Cycle II | Medium |
| 102 | Binary Tree Level Order Traversal | Easy |
| 107 | Binary Tree Level Order Traversal II | Easy |
| 83 | Remove Duplicates from Sorted List | Easy |
| 26 | Remove Duplicates from Sorted Array | Easy |
| 316 | Remove Duplicate Letters | Hard |
| 494 | Target Sum | Medium |
| 491 | Increasing Subsequences | Medium |
| 329 | Longest Increasing Path in a Matrix | Hard |
| 332 | Reconstruct Itinerary | Medium |
| 301 | Remove Invalid Parentheses | Hard |
| 207 | Course Schedule | Medium |
| 210 | Course Schedule II | Medium |
| 456 | 132 Pattern | Medium |
| 402 | Remove K Digits | Medium |
| 114 | Flatten Binary Tree to Linked List | Medium |
| 222 | Count Complete Tree Nodes | Medium |
| 341 | Flatten Nested List Iterator | Medium |
| 86 | Partition List | Medium |
| 331 | Verify Preorder Serialization of a Binary Tree | Medium |
| 486 | Predict the Winner | Medium |
| 224 | Basic Calculator | Hard |
| 150 | Evaluate Reverse Polish Notation | Medium |
| 227 | Basic Calculator II | Medium |
| 327 | Count of Range Sum | Hard |
| 393 | UTF-8 Validation | Medium |
| 397 | Integer Replacement | Medium |
| 324 | Wiggle Sort II | Medium |
| 164 | Maximum Gap | Hard |
| 501 | Find Mode in Binary Search Tree | Easy |
| 450 | Delete Node in a BST | Medium |
| 449 | Serialize and Deserialize BST | Medium |
| 297 | Serialize and Deserialize Binary Tree | Hard |
| 198 | House Robber | Easy |
| 213 | House Robber II | Medium |
| 337 | House Robber III | Medium |
| 42 | Trapping Rain Water | Hard |
| 407 | Trapping Rain Water II | Hard |
| 399 | Evaluate Division | Medium |
| 352 | Data Stream as Disjoint Intervals | Hard |
| 452 | Minimum Number of Arrows to Burst Balloons | Medium |
| 435 | Non-overlapping Intervals | Medium |
| 406 | Queue Reconstruction by Height | Medium |
| 330 | Patching Array | Hard |
| 367 | Valid Perfect Square | Easy |
| 378 | Kth Smallest Element in a Sorted Matrix | Medium |
| 436 | Find Right Interval | Medium |
| 483 | Smallest Good Base | Hard |
| 373 | Find K Pairs with Smallest Sums | Medium |
| 239 | Sliding Window Maximum | Hard |
| 423 | Reconstruct Original Digits from English | Medium |
| 492 | Construct the Rectangle | Easy |
| 495 | Teemo Attacking | Medium |
| 384 | Shuffle an Array | Medium |
| 424 | Longest Repeating Character Replacement | Medium |
| 390 | Elimination Game | Medium |
| 334 | Increasing Triplet Subsequence | Medium |
| 388 | Longest Absolute File Path | Medium |
| 395 | Longest Substring with At Least K Repeating Characters | Medium |
| 148 | Sort List | Medium |
| 386 | Lexicographical Numbers | Medium |
| 500 | Keyboard Row | Easy |
| 496 | Next Greater Element I | Medium |
| 506 | Relative Ranks | Easy |
| 508 | Most Frequent Subtree Sum | Medium |
| 498 | Diagonal Traverse | Medium |
| 503 | Next Greater Element II | Medium |
| 372 | Super Pow | Medium |
| 365 | Water and Jug Problem | Medium |
| 502 | IPO | Hard |
| 432 | All O`one Data Structure | Hard |
| 391 | Perfect Rectangle | Hard |
| 335 | Self Crossing | Hard |
| 462 | Minimum Moves to Equal Array Elements II | Medium |
| 440 | K-th Smallest in Lexicographical Order | Hard |
| 460 | LFU Cache | Hard |
| 420 | Strong Password Checker | Hard |
| 138 | Copy List with Random Pointer | Medium |
| 25 | Reverse Nodes in k-Group | Hard |
| 516 | Longest Palindromic Subsequence | Medium |
| 22 | Generate Parentheses | Medium |
| 49 | Group Anagrams | Medium |
| 71 | Simplify Path | Medium |
| 3 | Longest Substring Without Repeating Characters | Medium |
| 32 | Longest Valid Parentheses | Hard |
| 520 | Detect Capital | Easy |
| 526 | Beautiful Arrangement | Medium |
| 525 | Contiguous Array | Medium |
| 517 | Super Washing Machines | Hard |
| 43 | Multiply Strings | Medium |
| 14 | Longest Common Prefix | Easy |
| 91 | Decode Ways | Medium |
| 151 | Reverse Words in a String | Medium |
| 215 | Kth Largest Element in an Array | Medium |
| 202 | Happy Number | Easy |
| 532 | K-diff Pairs in an Array | Easy |
| 530 | Minimum Absolute Difference in BST | Easy |
| 504 | Base 7 | Easy |
| 535 | Encode and Decode TinyURL | Medium |
| 166 | Fraction to Recurring Decimal | Medium |
| 513 | Find Bottom Left Tree Value | Medium |
| 515 | Find Largest Value in Each Tree Row | Medium |
| 541 | Reverse String II | Easy |
| 539 | Minimum Time Difference | Medium |
| 536 | Construct Binary Tree from String | Medium |
| 529 | Minesweeper | Medium |
| 278 | First Bad Version | Easy |
| 131 | Palindrome Partitioning | Medium |
| 543 | Diameter of Binary Tree | Easy |
| 538 | Convert BST to Greater Tree | Medium |
| 542 | 01 Matrix | Medium |
| 524 | Longest Word in Dictionary through Deleting | Medium |
| 523 | Continuous Subarray Sum | Medium |
| 89 | Gray Code | Medium |
| 79 | Word Search | Medium |
| 46 | Permutations | Medium |
| 47 | Permutations II | Medium |
| 31 | Next Permutation | Medium |
| 139 | Word Break | Medium |
| 134 | Gas Station | Medium |
| 557 | Reverse Words in a String III | Easy |
| 554 | Brick Wall | Medium |
| 556 | Next Greater Element III | Medium |
| 549 | Binary Tree Longest Consecutive Sequence II | Medium |
| 540 | Single Element in a Sorted Array | Medium |
| 130 | Surrounded Regions | Medium |
| 106 | Construct Binary Tree from Inorder and Postorder Traversal | Medium |
| 547 | Friend Circles | Medium |
| 108 | Convert Sorted Array to Binary Search Tree | Easy |
| 103 | Binary Tree Zigzag Level Order Traversal | Medium |
| 133 | Clone Graph | Medium |
| 11 | Container With Most Water | Medium |
| 109 | Convert Sorted List to Binary Search Tree | Medium |
| 232 | Implement Queue using Stacks | Easy |
| 225 | Implement Stack using Queues | Easy |
| 54 | Spiral Matrix | Medium |
| 59 | Spiral Matrix II | Medium |
| 34 | Search for a Range | Medium |
| 80 | Remove Duplicates from Sorted Array II | Medium |
| 82 | Remove Duplicates from Sorted List II | Medium |
| 116 | Populating Next Right Pointers in Each Node | Medium |
| 117 | Populating Next Right Pointers in Each Node II | Medium |
| 223 | Rectangle Area | Medium |
| 563 | Binary Tree Tilt | Easy |
| 561 | Array Partition I | Easy |
| 562 | Longest Line of Consecutive One in Matrix | Medium |
| 70 | Climbing Stairs | Easy |
| 96 | Unique Binary Search Trees | Medium |
React
Typescript
Django
Laravel
Facebook
Microsoft
Google
Alibaba
D3
Tencent