If you’re looking for help with All Leetcode Solutions in Single Post, Directly copy-paste these codes into the Leetcode terminal and you are good to go. Leetcode Solutions in C++, Java, and Python. Quick start Let’s code!
LeetCode is the best platform to help you enhance your skills, expand your knowledge and prepare for technical interviews.Create Account
Explore is a well-organized tool that helps you get the most out of LeetCode by providing structure to guide your progress towards the next step in your programming career.
All Leetcode Solutions
| # | Problem Title | Difficulty | Solution |
|---|---|---|---|
| 1 | Two Sum | Easy | Link |
| 2 | Add Two Numbers | Medium | Link |
| 3 | Longest Substring Without Repeating Characters | Medium | Link |
| 4 | Median of Two Sorted Arrays | Hard | Link |
| 5 | Longest Palindromic Substring | Medium | Link |
| 6 | ZigZag Conversion | Medium | Link |
| 7 | Reverse Integer | Easy | Link |
| 8 | String to Integer (atoi) | Medium | Link |
| 9 | Palindrome Number | Easy | Link |
| 10 | Regular Expression Matching | Hard | Link |
| 11 | Container With Most Water | Medium | Link |
| 12 | Integer to Roman | Medium | Link |
| 13 | Roman to Integer | Easy | Link |
| 14 | Longest Common Prefix | Easy | Link |
| 15 | 3Sum | Medium | Link |
| 16 | 3Sum Closest | Medium | Link |
| 17 | Letter Combinations of a Phone Number | Medium | Link |
| 18 | 4Sum | Medium | Link |
| 19 | Remove Nth Node From End of List | Medium | Link |
| 20 | Valid Parentheses | Easy | Link |
| 21 | Merge Two Sorted Lists | Easy | Link |
| 22 | Generate Parentheses | Medium | Link |
| 23 | Merge k Sorted Lists | Hard | Link |
| 24 | Swap Nodes in Pairs | Medium | Link |
| 25 | Reverse Nodes in k-Group | Hard | Link |
| 26 | Remove Duplicates from Sorted Array | Easy | Link |
| 27 | Remove Element | Easy | Link |
| 28 | Find the Index of the First Occurrence in a String | Easy | Link |
| 29 | Divide Two Integers | Medium | Link |
| 30 | Substring with Concatenation of All Words | Hard | Link |
| 31 | Next Permutation | Medium | Link |
| 32 | Longest Valid Parentheses | Hard | Link |
| 33 | Search in Rotated Sorted Array | Medium | Link |
| 34 | Find First and Last Position of Element in Sorted Array | Medium | Link |
| 35 | Search Insert Position | Easy | Link |
| 36 | Valid Sudoku | Medium | Link |
| 37 | Sudoku Solver | Hard | Link |
| 38 | Count and Say | Easy | Link |
| 39 | Combination Sum | Medium | Link |
| 40 | Combination Sum II | Medium | Link |
| 41 | First Missing Positive | Hard | Link |
| 42 | Trapping Rain Water | Hard | Link |
| 43 | Multiply Strings | Medium | Link |
| 44 | Wildcard Matching | Hard | Link |
| 45 | Jump Game II | Hard | Link |
| 46 | Permutations | Medium | Link |
| 47 | Permutations II | Medium | Link |
| 48 | Rotate Image | Medium | Link |
| 49 | Group Anagrams | Medium | Link |
| 50 | Pow(x, n) | Medium | Link |
| 51 | N-Queens | Hard | Link |
| 52 | N-Queens II | Hard | Link |
| 53 | Maximum Subarray | Easy | Link |
| 54 | Spiral Matrix | Medium | Link |
| 55 | Jump Game | Medium | Link |
| 56 | Merge Intervals | Medium | Link |
| 57 | Insert Interval | Hard | Link |
| 58 | Length of Last Word | Easy | Link |
| 59 | Spiral Matrix II | Medium | Link |
| 60 | Permutation Sequence | Medium | Link |
| 61 | Rotate List | Medium | Link |
| 62 | Unique Paths | Medium | Link |
| 63 | Unique Paths II | Medium | Link |
| 64 | Minimum Path Sum | Medium | Link |
| 65 | Valid Number | Hard | Link |
| 66 | Plus One | Easy | Link |
| 67 | Add Binary | Easy | Link |
| 68 | Text Justification | Hard | Link |
| 69 | Sqrt(x) | Easy | Link |
| 70 | Climbing Stairs | Easy | Link |
| 71 | Simplify Path | Medium | Link |
| 72 | Edit Distance | Hard | Link |
| 73 | Set Matrix Zeroes | Medium | Link |
| 74 | Search a 2D Matrix | Medium | Link |
| 75 | Sort Colors | Medium | Link |
| 76 | Minimum Window Substring | Hard | Link |
| 77 | Combinations | Medium | Link |
| 78 | Subsets | Medium | Link |
| 79 | Word Search | Medium | Link |
| 80 | Remove Duplicates from Sorted Array II | Medium | Link |
| 81 | Search in Rotated Sorted Array II | Medium | Link |
| 82 | Remove Duplicates from Sorted List II | Medium | Link |
| 83 | Remove Duplicates from Sorted List | Easy | Link |
| 84 | Largest Rectangle in Histogram | Hard | Link |
| 85 | Maximal Rectangle | Hard | Link |
| 86 | Partition List | Medium | Link |
| 87 | Scramble String | Hard | Link |
| 88 | Merge Sorted Array | Easy | Link |
| 89 | Gray Code | Medium | Link |
| 90 | Subsets II | Medium | Link |
| 91 | Decode Ways | Medium | Link |
| 92 | Reverse Linked List II | Medium | Link |
| 93 | Restore IP Addresses | Medium | Link |
| 94 | Binary Tree Inorder Traversal | Medium | Link |
| 95 | Unique Binary Search Trees II | Medium | Link |
| 96 | Unique Binary Search Trees | Medium | Link |
| 97 | Interleaving String | Hard | Link |
| 98 | Validate Binary Search Tree | Medium | Link |
| 99 | Recover Binary Search Tree | Hard | Link |
| 100 | Same Tree | Easy | Link |
| 101 | Symmetric Tree | Easy | Link |
| 102 | Binary Tree Level Order Traversal | Medium | Link |
| 103 | Binary Tree Zigzag Level Order Traversal | Medium | Link |
| 104 | Maximum Depth of Binary Tree | Easy | Link |
| 105 | Construct Binary Tree from Preorder and Inorder Traversal | Medium | Link |
| 106 | Construct Binary Tree from Inorder and Postorder Traversal | Medium | Link |
| 107 | Binary Tree Level Order Traversal II | Easy | Link |
| 108 | Convert Sorted Array to Binary Search Tree | Easy | Link |
| 109 | Convert Sorted List to Binary Search Tree | Medium | Link |
| 110 | Balanced Binary Tree | Easy | Link |
| 111 | Minimum Depth of Binary Tree | Easy | Link |
| 112 | Path Sum | Easy | Link |
| 113 | Path Sum II | Medium | Link |
| 114 | Flatten Binary Tree to Linked List | Medium | Link |
| 115 | Distinct Subsequences | Hard | Link |
| 116 | Populating Next Right Pointers in Each Node | Medium | Link |
| 117 | Populating Next Right Pointers in Each Node II | Medium | Link |
| 118 | Pascal’s Triangle | Easy | Link |
| 119 | Pascal’s Triangle II | Easy | Link |
| 120 | Triangle | Medium | Link |
| 121 | Best Time to Buy and Sell Stock | Easy | Link |
| 122 | Best Time to Buy and Sell Stock II | Easy | Link |
| 123 | Best Time to Buy and Sell Stock III | Hard | Link |
| 124 | Binary Tree Maximum Path Sum | Hard | Link |
| 125 | Valid Palindrome | Easy | Link |
| 126 | Word Ladder II | Hard | Link |
| 127 | Word Ladder | Medium | Link |
| 128 | Longest Consecutive Sequence | Hard | Link |
| 129 | Sum Root to Leaf Numbers | Medium | Link |
| 130 | Surrounded Regions | Medium | Link |
| 131 | Palindrome Partitioning | Medium | Link |
| 132 | Palindrome Partitioning II | Hard | Link |
| 133 | Clone Graph | Medium | Link |
| 134 | Gas Station | Medium | Link |
| 135 | Candy | Hard | Link |
| 136 | Single Number | Easy | Link |
| 137 | Single Number II | Medium | Link |
| 138 | Copy List with Random Pointer | Medium | Link |
| 139 | Word Break | Medium | Link |
| 140 | Word Break II | Hard | Link |
| 141 | Linked List Cycle | Easy | Link |
| 142 | Linked List Cycle II | Medium | Link |
| 143 | Reorder List | Medium | Link |
| 144 | Binary Tree Preorder Traversal | Medium | Link |
| 145 | Binary Tree Postorder Traversal | Hard | Link |
| 146 | LRU Cache | Hard | Link |
| 147 | Insertion Sort List | Medium | Link |
| 148 | Sort List | Medium | Link |
| 149 | Max Points on a Line | Hard | Link |
| 150 | Evaluate Reverse Polish Notation | Medium | Link |
Disclaimer: The above Problems are generated by Leetcode but the solution is provided by Chase2learn.This tutorial is only for Educational and Learning purpose.