LeetCode Solution

All solutions in this list have passed the LeetCode OJ system. Some problems are solved in Python 2 while most of them are solved in Python 3.

If you have any problem about any problems, please feel free to contract me via email.

Index

• Problem 1-200
• Problem 201-400
• Problem 401-600
• Problem 601-800
• Problem 801-1000
• Problem 1001-1200
• Problem 1201-1400

Recent Posts

• 270. Closest Binary Search Tree Value
• 257. Binary Tree Paths
• 255. Verify Preorder Sequence in Binary Search Tree
• 250. Count Univalue Subtrees
• 236. Lowest Common Ancestor of a Binary Tree
• 235. Lowest Common Ancestor of a Binary Search Tree
• 230. Kth Smallest Element in a BST
• 226. Invert Binary Tree
• 222. Count Complete Tree Nodes
• 199. Binary Tree Right Side View
• 156. Binary Tree Upside Down
• 145. Binary Tree Postorder Traversal
• 144. Binary Tree Prorder Traversal
• 129. Sum Root to Leaf Numbers
• 124. Binary Tree Maximum Path Sum
• 1320. Minimum Distance to Type a Word Using Two Fingers
• 1319. Number of Operations to Make Network Connected
• 1318. Minimum Flips to Make a OR b Equal to c
• 1317. Convert Integer to the Sum of Two No-Zero Integers
• 117. Populating Next Right Pointers in Each Node II