leetcodes

::: Started

I am going to finish them all ::::: POKEMON!!!!!!!!!!!!!!!!!!!!!!!

A journey to finish most of the leetcode questions in Python using short and precise code.

Name		Name	Last commit message	Last commit date
Latest commit History 474 Commits
(2) 1099. Two Sum Less Than K		(2) 1099. Two Sum Less Than K
(2) 611. Valid Triangle Number		(2) 611. Valid Triangle Number
(2) 845. Longest Mountain in Array		(2) 845. Longest Mountain in Array
(2) 849. Maximize Distance to Closest Person		(2) 849. Maximize Distance to Closest Person
(2)763. Partition Labels		(2)763. Partition Labels
(SPACING) Integer to Enginlish Words		(SPACING) Integer to Enginlish Words
(Try 3) 53. Maximum Subarray		(Try 3) 53. Maximum Subarray
(Working)1004. Max Consecutive Ones III		(Working)1004. Max Consecutive Ones III
10. Regular Expression Matching		10. Regular Expression Matching
1004. Max Consecutive Ones III		1004. Max Consecutive Ones III
101. Symmetric Tree		101. Symmetric Tree
102. Binary Tree Level Order Traversal		102. Binary Tree Level Order Traversal
1024. Video Stitching		1024. Video Stitching
1025. Divisor Game		1025. Divisor Game
1027. Longest Arithmetic Sequence		1027. Longest Arithmetic Sequence
103. Binary Tree Zigzag Level Order Traversal		103. Binary Tree Zigzag Level Order Traversal
1031. Maximum Sum of Two Non-Overlapping Subarrays		1031. Maximum Sum of Two Non-Overlapping Subarrays
1042. Flower Planting With No Adjacent		1042. Flower Planting With No Adjacent
1043. Partition Array for Maximum Sum		1043. Partition Array for Maximum Sum
1047. Remove All Adjacent Duplicates In String		1047. Remove All Adjacent Duplicates In String
1048. Longest String Chain		1048. Longest String Chain
1048. Longest String Chain TRY 2		1048. Longest String Chain TRY 2
105. Construct Binary Tree from Preorder and Inorder Traversal		105. Construct Binary Tree from Preorder and Inorder Traversal
1057. Campus Bikes		1057. Campus Bikes
1074. Number of Submatrices That Sum to Target		1074. Number of Submatrices That Sum to Target
1079. Letter Tile Possibilities		1079. Letter Tile Possibilities
108. Convert Sorted Array to Binary Search Tree		108. Convert Sorted Array to Binary Search Tree
1081. Smallest Subsequence of Distinct Characters		1081. Smallest Subsequence of Distinct Characters
1087. Brace Expansion		1087. Brace Expansion
109. Convert Sorted List to Binary Search Tree		109. Convert Sorted List to Binary Search Tree
1099. Two Sum Less Than K		1099. Two Sum Less Than K
1099. Two Sum Less Than K (2)		1099. Two Sum Less Than K (2)
11. Container With Most Water		11. Container With Most Water
110. Balanced Binary Tree		110. Balanced Binary Tree
1101. The Earliest Moment When Everyone Become Friends		1101. The Earliest Moment When Everyone Become Friends
111. Minimum Depth of Binary Tree		111. Minimum Depth of Binary Tree
1120. Maximum Average Subtree		1120. Maximum Average Subtree
1135. Connecting Cities With Minimum Cost		1135. Connecting Cities With Minimum Cost
114. Flatten Binary Tree to Linked List		114. Flatten Binary Tree to Linked List
114. Flatten Binary Tree to Linked List(2)		114. Flatten Binary Tree to Linked List(2)
1140. Stone Game II		1140. Stone Game II
1147. Longest Chunked Palindrome Decomposition		1147. Longest Chunked Palindrome Decomposition
115. Distinct Subsequences		115. Distinct Subsequences
1151. Minimum Swaps to Group All 1's Together		1151. Minimum Swaps to Group All 1's Together
1153. String Transforms Into Another String		1153. String Transforms Into Another String
116. Populating Next Right Pointers in Each Node		116. Populating Next Right Pointers in Each Node
117. Populating Next Right Pointers in Each Node II		117. Populating Next Right Pointers in Each Node II
118. Pascal's Triangle		118. Pascal's Triangle
1192. Critical Connections in a Network		1192. Critical Connections in a Network
120. Triangle		120. Triangle
120. Triangle :Optimized		120. Triangle :Optimized
1209. Remove All Adjacent Duplicates in String II		1209. Remove All Adjacent Duplicates in String II
1209. Remove All Adjacent Duplicates in String II (Try 3)		1209. Remove All Adjacent Duplicates in String II (Try 3)
121. Best Time to Buy and Sell Stock		121. Best Time to Buy and Sell Stock
122. Best Time to Buy and Sell Stock II		122. Best Time to Buy and Sell Stock II
1223. Dice Roll Simulation		1223. Dice Roll Simulation
123. Best Time to Buy and Sell Stock III		123. Best Time to Buy and Sell Stock III
1235. Maximum Profit in Job Scheduling		1235. Maximum Profit in Job Scheduling
124. Binary Tree Maximum (TRY 2) Path Sum		124. Binary Tree Maximum (TRY 2) Path Sum
124. Binary Tree Maximum Path Sum		124. Binary Tree Maximum Path Sum
1247. Minimum Swaps to Make Strings Equal		1247. Minimum Swaps to Make Strings Equal
1249. Minimum Remove to Make Valid Parentheses		1249. Minimum Remove to Make Valid Parentheses
1249. Minimum Remove to Make Valid Parentheses(2)		1249. Minimum Remove to Make Valid Parentheses(2)
125. Valid Palindrome		125. Valid Palindrome
127. Word Ladder		127. Word Ladder
128. Longest Consecutive Sequence		128. Longest Consecutive Sequence
13. Roman to Integer		13. Roman to Integer
131. Palindrome Partitioning		131. Palindrome Partitioning
133. Clone Graph		133. Clone Graph
1335. Minimum Difficulty of a Job Schedule		1335. Minimum Difficulty of a Job Schedule
134. Gas Station		134. Gas Station
135. Candy		135. Candy
1352. Product of the Last K Numbers		1352. Product of the Last K Numbers
136. Single Number		136. Single Number
137. Single Number II		137. Single Number II
138. Copy List with Random Pointer		138. Copy List with Random Pointer
139. Word Break		139. Word Break
139. Word Break (Efficient)		139. Word Break (Efficient)
140 Word Break 2		140 Word Break 2
140. Word Break II		140. Word Break II
1416. Restore The Array		1416. Restore The Array
142. Linked List Cycle II		142. Linked List Cycle II
146. LRU Cache		146. LRU Cache
1477. Find Two Non-overlapping Sub-arrays Each With Target Sum		1477. Find Two Non-overlapping Sub-arrays Each With Target Sum
148. Sort List		148. Sort List
152. Maximum Product Subarray		152. Maximum Product Subarray
155. Min Stack		155. Min Stack
157. Read N Characters Given Read4		157. Read N Characters Given Read4
158. Read N Characters Given Read4 II - Call multiple times		158. Read N Characters Given Read4 II - Call multiple times
159. Longest Substring with At Most Two Distinct Characters		159. Longest Substring with At Most Two Distinct Characters
16. 3Sum Closest		16. 3Sum Closest
1609. Even Odd Tree		1609. Even Odd Tree
161. One Edit Distance		161. One Edit Distance
162. Find Peak Element		162. Find Peak Element
162. Find Peak Element (2)		162. Find Peak Element (2)
163. Missing Ranges		163. Missing Ranges
165. Compare Version Numbers		165. Compare Version Numbers
166. Fraction to Recurring Decimal		166. Fraction to Recurring Decimal
166. Fraction to Recurring Decimal(2)		166. Fraction to Recurring Decimal(2)
167. Two Sum II - Input array is sorted		167. Two Sum II - Input array is sorted

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

Repository files navigation

leetcodes

About

Releases

Packages

akaashhazarika/leetcodes

Folders and files

Latest commit

History

Repository files navigation

leetcodes

About

Resources

Stars

Watchers

Forks

Releases

Packages 0

Packages