Solutions for leetcode.
- 0001. Two Sum: [Python]
- 0003. Longest Substring Without Repeating Characters: [Python]
- 0008. String to Integer (atoi): [PHP]
- 0013. Roman to Integer: [PHP]
- 0015. 3Sum: [Python]
- 0017. Letter Combinations of a Phone Number: [Python]
- 0018. 4Sum: [Python]
- 0020. Valid Parentheses: [Python]
- 0021. Merge Two Sorted Lists: [PHP]
- 0022. Generate Parentheses: [Python]
- 0023. Merge k Sorted Lists: [PHP]
- 0024. Swap Nodes in Pairs: [PHP]
- 0025. Reverse Nodes in k Group: [PHP]
- 0036. Valid Sudoku: [Python]
- 0037. Sudoku Solver: [Python]
- 0049. Group Anagrams: [Python]
- 0050. Pow X N: [Python]
- 0051. N Queens: [Python]
- 0052. N Queens II: [Python] [Python(Bit)]
- 0053. Maximum Subarray: [Python]
- 0069. Sqrt X: [Python]
- 0079. Word Search: [Python]
- 0088. Merge Sorted Array: [Python]
- 0094. Binary Tree Inorder Traversal: [PHP(Iteratively)] [PHP(Recursively)]
- 0098. Validate Binary Search Tree: [Python] [PHP]
- 0101. Symmetric Tree: [PHP(Iteratively)] [PHP(Recursively)]
- 0102. Binary Tree Level Order Traversal: [Python] [PHP]
- 0104. Maximum Depth of Binary Tree: [Python] [PHP]
- 0105. Construct Binary Tree from Preorder and Inorder Traversal: [PHP]
- 0106. Construct Binary Tree from Inorder and Postorder Traversal: [PHP]
- 0107. Binary Tree Level Order Traversal II: [PHP]
- 0111. Minimum Depth of Binary Tree: [Python]
- 0112. Path Sum: [PHP]
- 0116. Populating Next Right Pointers in Each Node: [PHP(A0)] [PHP(A1)]
- 0117. Populating Next Right Pointers in Each Node II: [PHP]
- 0122. Best Time to Buy and Sell Stock II: [Python]
- 0136. Single Number: [Python]
- 0141. Linked List Cycle: [PHP] [JS]
- 0142. Linked List Cycle II: [JS]
- 0144. Binary Tree Preorder Traversal: [Python] [PHP(Iteratively)] [PHP(Recursively)]
- 0145. Binary Tree Postorder Traversal: [PHP(Iteratively)] [PHP(Recursively)]
- 0155. Min Stack: [Python]
- 0169. Majority Element: [Python]
- 0173. Binary Search Tree Iterator: [PHP(A0)] [PHP(A1)] [JS]
- 0191. Number of 1 Bits: [Python]
- 0202. Happy Number: [Python]
- 0206. Reverse Linked List Iteratively: [PHP]
- 0208. Implement Trie Prefix Tree: [Python]
- 0211. Add and Search Word Data Structure Design: [Python]
- 0212. Word Search II: [Python]
- 0215. Kth Largest Element in an Array: [Python] [PHP]
- 0225. Implement Stack Using Queues: [Python]
- 0231. Power of Two: [Python]
- 0232. Implement Queue Using Stacks: [Python]
- 0235. Lowest Common Ancestor of a Binary Search Tree: [Python]
- 0236. Lowest Common Ancestor of a Binary Tree: [Python] [PHP] [JS(A0)] [JS(A1)]
- 0239. Sliding Window Maximum: [Python] [PHP] [PHP(Heap)]
- 0242. Valid Anagram: [Python]
- 0250. Count Univalue Subtrees: [PHP]
- 0264. Ugly Number II: [Python]
- 0283. Move Zeroes: [Python]
- 0285. Inorder Successor in BST: [JS]
- 0297. Serialize and Deserialize Binary Tree: [PHP]
- 0338. Counting Bits: [Python]
- 0450. Delete Node in a BST: [Python]
- 0482. License Key Formatting: [Python]
- 0543. Diameter of Binary Tree: [Python]
- 0700. Search in a Binary Search Tree: [PHP]
- 0701. Insert Into a Binary Search Tree: [PHP]
- 0703. Kth Largest Element in a Stream: [Python] [PHP]
- 0704. Binary Search: [PHP]
- 0844. Backspace String Compare: [Python]
- 0876. Middle of The Linked List: [Python]
- 0904. Fruit Into Baskets: [Python]
- 0912. Sort an Array: [Python] [PHP]
- 0929. Unique Email Addresses: [Python]
- 0932. Beautiful Array: [Python]
- 1046. Last Stone Weight: [Python]