GitHub - kleeeeea/LeetCode-Python: My approaches for coding challenge problems

Branches Tags

Name		Name	Last commit message	Last commit date
Latest commit History 18 Commits
.gitignore		.gitignore
036. Valid Sudoku.md		036. Valid Sudoku.md
037. Count and Say.md		037. Count and Say.md
039. Combination Sum.md		039. Combination Sum.md
040. Combination Sum II.md		040. Combination Sum II.md
041. First Missing Positive.md		041. First Missing Positive.md
042. Trapping Rain Water.md		042. Trapping Rain Water.md
043. Multiply Strings.md		043. Multiply Strings.md
044. Wildcard Matching.md		044. Wildcard Matching.md
045. Jump Game II.md		045. Jump Game II.md
046. Permutations.md		046. Permutations.md
047. Permutations II.md		047. Permutations II.md
048. Rotate Image.md		048. Rotate Image.md
049. Group Anagrams.md		049. Group Anagrams.md
050. Pow(x, n).md		050. Pow(x, n).md
051. N-Queens.md		051. N-Queens.md
052. N-Queens II.md		052. N-Queens II.md
053. Maximum Subarray.md		053. Maximum Subarray.md
054. Spiral Matrix.md		054. Spiral Matrix.md
055. Jump Game.md		055. Jump Game.md
056. Merge Intervals.md		056. Merge Intervals.md
057. Insert Interval.md		057. Insert Interval.md
058. Length of Last Word.md		058. Length of Last Word.md
059. Spiral Matrix II.md		059. Spiral Matrix II.md
060. Permutation Sequence.md		060. Permutation Sequence.md
061. Rotate List.md		061. Rotate List.md
062. Unique Paths.md		062. Unique Paths.md
063. Unique Paths II.md		063. Unique Paths II.md
064. Minimum Path Sum.md		064. Minimum Path Sum.md
065. Valid Number.md		065. Valid Number.md
066. Plus One.md		066. Plus One.md
067. Add Binary.md		067. Add Binary.md
068. Text Justification.md		068. Text Justification.md
069. Sqrt(x).md		069. Sqrt(x).md
070. Climbing Stairs.md		070. Climbing Stairs.md
071. Simplify Path.md		071. Simplify Path.md
073. Set Matrix Zeroes.md		073. Set Matrix Zeroes.md
074. Search a 2D Matrix.md		074. Search a 2D Matrix.md
075. Sort Colors.md		075. Sort Colors.md
076. Minimum Window Substring.md		076. Minimum Window Substring.md
077. Combinations.md		077. Combinations.md
078. Subsets.md		078. Subsets.md
079. Word Search.md		079. Word Search.md
080. Remove Duplicates from Sorted Array II.md		080. Remove Duplicates from Sorted Array II.md
081. Search in Rotated Sorted Array II.md		081. Search in Rotated Sorted Array II.md
082. Remove Duplicates from Sorted List II.md		082. Remove Duplicates from Sorted List II.md
083. Remove Duplicates from Sorted List.md		083. Remove Duplicates from Sorted List.md
084. Largest Rectangle in Histogram.md		084. Largest Rectangle in Histogram.md
086. Partition List.md		086. Partition List.md
087. Scramble String.md		087. Scramble String.md
088. Merge Sorted Array.md		088. Merge Sorted Array.md
089. Gray Code.md		089. Gray Code.md
090. Subsets II.md		090. Subsets II.md
091. Decode Ways.md		091. Decode Ways.md
092. Reverse Linked List II.md		092. Reverse Linked List II.md
093. Restore IP Addresses.md		093. Restore IP Addresses.md
094. Binary Tree Inorder Traversal.md		094. Binary Tree Inorder Traversal.md
095. Unique Binary Search Trees II.md		095. Unique Binary Search Trees II.md
096. Unique Binary Search Trees.md		096. Unique Binary Search Trees.md
097. Interleaving String.md		097. Interleaving String.md
098. Validate Binary Search Tree.md		098. Validate Binary Search Tree.md
099. Recover Binary Search Tree.md		099. Recover Binary Search Tree.md
100. Same Tree.md		100. Same Tree.md
101. Symmetric Tree.md		101. Symmetric Tree.md
102. Binary Tree Level Order Traversal.md		102. Binary Tree Level Order Traversal.md
103. Binary Tree Zigzag Level Order Traversal.md		103. Binary Tree Zigzag Level Order Traversal.md
104. Maximum Depth of Binary Tree.md		104. Maximum Depth of Binary Tree.md
105. Construct Binary Tree from Preorder and Inorder Traversal.md		105. Construct Binary Tree from Preorder and Inorder Traversal.md
106. Construct Binary Tree from Inorder and Postorder Traversal.md		106. Construct Binary Tree from Inorder and Postorder Traversal.md
107. Binary Tree Level Order Traversal II.md		107. Binary Tree Level Order Traversal II.md
108. Convert Sorted Array to Binary Search Tree.md		108. Convert Sorted Array to Binary Search Tree.md
109. Convert Sorted List to Binary Search Tree.md		109. Convert Sorted List to Binary Search Tree.md
110. Balanced Binary Tree.md		110. Balanced Binary Tree.md
111. Minimum Depth of Binary Tree.md		111. Minimum Depth of Binary Tree.md
112. Path Sum.md		112. Path Sum.md
113. Path Sum II.md		113. Path Sum II.md
114. Flatten Binary Tree to Linked List.md		114. Flatten Binary Tree to Linked List.md
115. Distinct Subsequences.md		115. Distinct Subsequences.md
116. Populating Next Right Pointers in Each Node.md		116. Populating Next Right Pointers in Each Node.md
117. Populating Next Right Pointers in Each Node II.md		117. Populating Next Right Pointers in Each Node II.md
118. Pascal's Triangle.md		118. Pascal's Triangle.md
119. Pascal's Triangle II.md		119. Pascal's Triangle II.md
120. Triangle.md		120. Triangle.md
121. Best Time to Buy and Sell Stock.md		121. Best Time to Buy and Sell Stock.md
122. Best Time to Buy and Sell Stock II.md		122. Best Time to Buy and Sell Stock II.md
123. Best Time to Buy and Sell Stock III.md		123. Best Time to Buy and Sell Stock III.md
124. Binary Tree Maximum Path Sum.md		124. Binary Tree Maximum Path Sum.md
125. Valid Palindrome.md		125. Valid Palindrome.md
127. Word Ladder.md		127. Word Ladder.md
128. Longest Consecutive Sequence.md		128. Longest Consecutive Sequence.md
129. Sum Root to Leaf Numbers.md		129. Sum Root to Leaf Numbers.md
130. Surrounded Regions.md		130. Surrounded Regions.md
131. Palindrome Partitioning.md		131. Palindrome Partitioning.md
132. Palindrome Partitioning II.md		132. Palindrome Partitioning II.md
133. Clone Graph.md		133. Clone Graph.md
134. Gas Station.md		134. Gas Station.md
135. Candy.md		135. Candy.md
136. Single Number.md		136. Single Number.md
137. Single Number II.md		137. Single Number II.md
138. Copy List with Random Pointer.md		138. Copy List with Random Pointer.md