LeetCode Problem Solutions
Note
This website contains my LeetCode problem solving records, problems are categorized by difficulty:
Solution Table
| Number | Title | Solution | Difficulty |
|---|---|---|---|
| 1 | Two Sum | go | E |
| 2 | Add Two Numbers | go | M |
| 3 | Longest Substring Without Repeating Characters | go | M |
| 4 | Median of Two Sorted Arrays | go | H |
| 5 | Longest Palindromic Substring | go | M |
| 6 | Zigzag Conversion | go | M |
| 7 | Reverse Integer | go | M |
| 8 | String to Integer (atoi) | go | M |
| 9 | Palindrome Number | go | E |
| 10 | Regular Expression Matching | go | H |
| 11 | Container With Most Water | go | M |
| 12 | Integer to Roman | go | M |
| 13 | Roman to Integer | go | E |
| 14 | Longest Common Prefix | go | E |
| 15 | 3Sum | go | M |
| 16 | 3Sum Closest | go | M |
| 17 | Letter Combinations of a Phone Number | go | M |
| 23 | Merge k Sorted Lists | go | H |
| 24 | Swap Nodes in Pairs | go | M |
| 25 | Reverse Nodes in k-Group | go | H |
| 38 | Count and Say | go | M |
| 42 | Trapping Rain Water | go | H |
| 44 | Wildcard Matching | go | H |
| 45 | Jump Game II | go | M |
| 46 | Permutations | go | M |
| 50 | Pow(x, n) | go | M |
| 51 | N-Queens | go | H |
| 73 | Set Matrix Zeroes | go | M |
| 105 | Construct Binary Tree from Preorder and Inorder Tranversal | go | M |
| 124 | Binary Tree Maximum Path Sum | go | H |
| 135 | Candy | go | H |
| 140 | Word Break II | go | H |
| 146 | LRU Cache | go | M |
| 210 | Course Schedule II | go | M |
| 220 | Contains Duplicate III | go | H |
| 236 | Lowest Common Ancestor of a Binary Tree | go | M |
| 239 | Sliding Window Maximum | go | H |
| 312 | Burst Balloons | go | H |
| 316 | Remove Duplicate Letters | go | M |
| 322 | Coin Change | go | M |
| 347 | Top K Frequent Elements | go | M |
| 386 | Lexicographical Numbers | go | M |
| 416 | Partition Equal Subset Sum | go | M |
| 435 | Non-overlapping Interval | go | M |
| 440 | K-th Smallest in Lexicographical Order | go | H |
| 460 | LFU Cache | go | H |
| 592 | Fraction Addition and Subtraction | go | M |
| 594 | Longest Harmonious Subsequence | go | E |
| 685 | Redundant Connection II | go | H |
| 752 | Open the Lock | go | M |
| 757 | Set Intersection Size At Least Two | go | H |
| 765 | Couples Holding Hands | go | H |
| 815 | Bus Routes | go | H |
| 834 | Sum of Distances in Tree | go | H |
| 840 | Magic Squares In Grid | go | M |
| 847 | Shortest Path Visiting All Nodes | go | H |
| 855 | Exam Room | go | M |
| 875 | Koko Eating Bananas | go | M |
| 881 | Boats to Save People | go | M |
| 887 | Super Egg Drop | go | H |
| 895 | Maximum Frequency Stack | go | H |
| 912 | Sort an Array | go | M |
| 948 | Bag of Tokens | go | M |
| 1209 | Remove All Adjacent Duplicates in String II | go | M |
| 1395 | Count Number of Trams | go | M |
| 2016 | Maximum Difference Between Increasing Elements | go | E |
| 2071 | Maximum Number of Tasks You Can Assign | go | H |
| 2099 | Find Subsequence of Length K With the Largest Sum | go | E |
| 2138 | Divide a String Into Groups of Size k | go | E |
| 2294 | Partition Array Such That Maximum Difference Is K | go | M |
| 2366 | Mimimum Replacements to Sort the Array | go | H |
| 2392 | Build A Matrix with Conditions | go | H |
| 2444 | Count Subarrays With Fixed Bounds | go | H |
| 2742 | Paiting the Walls | go | H |
| 2894 | Divisible and Non-divisible Sums Difference | go | E |
| 2966 | Divide Array Into Arrays With Max Difference | go | M |
| 3024 | Type of Triangle | go | E |
| 3355 | Zero Array Transformation I | go | M |
| 3362 | Zero Array Transformation III | go | M |
| 3372 | Maximize the Number of Target Nodes After Connecting Trees I | go | M |
| 3373 | Maximize the Number of Target Nodes After Connecting Trees II | go | H |
| 3423 | Maximum Difference Between Adjacent Elements in a Circular Array | go | E |
| 3442 | Maximum Difference Between Even and Odd Frequency I | go | E |
| 3443 | Maximum Manhattan Distance After K Changes | go | M |
| 3727 | Find the Count of Good Integers | go | H |
About
This website is built with MkDocs and hosted on GitHub Pages. All solution code can be found in the Repository: alonza0314/leetcode.