LeetCode solutions
Every LeetCode problem I have solved, with the accepted code in each language I solved it in. The problem statements stay on LeetCode where they belong — what is here is the solution, the runtime it was accepted at, and a link to the repository it came from.
1,055 solutions
Showing 1–50 of 1,055 solutions.
- 1. Two Sum Easy Languages: C++ Python Accepted runtime 0ms
- 10. Regular Expression Matching Hard Languages: Python Accepted runtime 8ms
- 11. Container With Most Water Medium Languages: Python Accepted runtime 111ms
- 12. Integer to Roman Medium Languages: Python Accepted runtime 3ms
- 13. Roman to Integer Easy Languages: Python Accepted runtime 3ms
- 100. Same Tree Easy Languages: Python Accepted runtime 0ms
- 101. Symmetric Tree Easy Languages: Python Accepted runtime 5ms
- 102. Binary Tree Level Order Traversal Medium Languages: JavaScript Python Accepted runtime 1ms
- 103. Binary Tree Zigzag Level Order Traversal Medium Languages: JavaScript Accepted runtime 0ms
- 104. Maximum Depth of Binary Tree Easy Languages: Python Accepted runtime 3ms
- 105. Construct Binary Tree from Preorder and Inorder Traversal Medium Languages: Python Accepted runtime 7ms
- 106. Construct Binary Tree from Inorder and Postorder Traversal Medium Languages: JavaScript Accepted runtime 3ms
- 107. Binary Tree Level Order Traversal II Medium Languages: JavaScript Accepted runtime 0ms
- 108. Convert Sorted Array to Binary Search Tree Easy Languages: Python Accepted runtime 3ms
- 109. Convert Sorted List to Binary Search Tree Medium Languages: JavaScript Accepted runtime 4ms
- 110. Balanced Binary Tree Easy Languages: Python Accepted runtime 8ms
- 111. Minimum Depth of Binary Tree Easy Languages: Python Accepted runtime 158ms
- 112. Path Sum Easy Languages: Python Accepted runtime 0ms
- 113. Path Sum II Medium Languages: JavaScript Accepted runtime 1ms
- 114. Flatten Binary Tree to Linked List Medium Languages: JavaScript Accepted runtime 0ms
- 115. Distinct Subsequences Hard Languages: Python Accepted runtime 198ms
- 116. Populating Next Right Pointers in Each Node Medium Languages: JavaScript Accepted runtime 48ms
- 117. Populating Next Right Pointers in Each Node II Medium Languages: JavaScript Accepted runtime 47ms
- 118. Pascal's Triangle Easy Languages: Python Accepted runtime 0ms
- 119. Pascal's Triangle II Easy Languages: Python Accepted runtime 3ms
- 120. Triangle Medium Languages: JavaScript Accepted runtime 2ms
- 121. Best Time to Buy and Sell Stock Easy Languages: Python Accepted runtime 29ms
- 122. Best Time to Buy and Sell Stock II Medium Languages: JavaScript Accepted runtime 1ms
- 123. Best Time to Buy and Sell Stock III Hard Languages: Python Accepted runtime 218ms
- 124. Binary Tree Maximum Path Sum Hard Languages: Python Accepted runtime 25ms
- 125. Valid Palindrome Easy Languages: Python Accepted runtime 7ms
- 126. Word Ladder II Hard Languages: Python Accepted runtime 32ms
- 127. Word Ladder Hard Languages: Python Accepted runtime 39ms
- 128. Longest Consecutive Sequence Medium Languages: JavaScript Accepted runtime 34ms
- 129. Sum Root to Leaf Numbers Medium Languages: JavaScript Accepted runtime 0ms
- 130. Surrounded Regions Medium Languages: JavaScript Accepted runtime 2ms
- 131. Palindrome Partitioning Medium Languages: JavaScript Accepted runtime 13ms
- 1000. Delete Columns to Make Sorted III Hard Languages: Python Accepted runtime 57ms
- 1001. N-Repeated Element in Size 2N Array Easy Languages: C++ Python Accepted runtime 9ms
- 1002. Maximum Width Ramp Medium Languages: Python Accepted runtime 44ms
- 1003. Minimum Area Rectangle II Medium Languages: Python Accepted runtime 36ms
- 1005. Univalued Binary Tree Easy Languages: C++ Accepted runtime 0ms
- 1006. Vowel Spellchecker Medium Languages: Python Accepted runtime 39ms
- 1007. Numbers With Same Consecutive Differences Medium Languages: Python Accepted runtime 4ms
- 1008. Binary Tree Cameras Hard Languages: Python Accepted runtime 0ms
- 1009. Pancake Sorting Medium Languages: Python Accepted runtime 1ms
- 1010. Powerful Integers Medium Languages: Python Accepted runtime 0ms
- 1011. Flip Binary Tree To Match Preorder Traversal Medium Languages: Python Accepted runtime 0ms
- 1012. Equal Rational Numbers Hard Languages: Python Accepted runtime 0ms
- 1013. Fibonacci Number Easy Languages: Python Accepted runtime 13ms
Page 1 of 22
These are practice solutions, not lessons. If you came here to learn how any of it works, the explanations live in the lessons.