Skip to content
Navigation Menu
Sign in
Appearance settings
Platform
AI CODE CREATION
GitHub Copilot
Write better code with AI
GitHub Copilot app
Direct agents from issue to merge
MCP Registry
Integrate external tools
DEVELOPER WORKFLOWS
Actions
Automate any workflow
Codespaces
Instant dev environments
Issues
Plan and track work
Code Review
Manage code changes
Code Quality
Enforce quality at merge
APPLICATION SECURITY
GitHub Advanced Security
Find and fix vulnerabilities
Code security
Secure your code as you build
Secret protection
Stop leaks before they start
EXPLORE
Why GitHub
Documentation
Blog
Changelog
Marketplace
View all features
Solutions
BY COMPANY SIZE
Enterprises
Small and medium teams
Startups
Nonprofits
BY USE CASE
App Modernization
DevSecOps
DevOps
CI/CD
View all use cases
BY INDUSTRY
Healthcare
Financial services
Manufacturing
Government
View all industries
View all solutions
Resources
EXPLORE BY TOPIC
AI
Software Development
DevOps
Security
View all topics
EXPLORE BY TYPE
Customer stories
Events & webinars
Ebooks & reports
Business insights
GitHub Skills
SUPPORT & SERVICES
Documentation
Customer support
Community forum
Trust center
Partners
View all resources
Open Source
COMMUNITY
GitHub Sponsors
Fund open source developers
PROGRAMS
Security Lab
Maintainer Community
Accelerator
GitHub Stars
Archive Program
REPOSITORIES
Topics
Trending
Collections
Enterprise
ENTERPRISE SOLUTIONS
Enterprise platform
AI-powered developer platform
AVAILABLE ADD-ONS
GitHub Advanced Security
Enterprise-grade security features
Copilot for Business
Enterprise-grade AI features
Premium Support
Enterprise-grade 24/7 support
Pricing
Type
/
to search
Sign in
Sign up
Appearance settings
You signed in with another tab or window.
Reload
to refresh your session.
You signed out in another tab or window.
Reload
to refresh your session.
You switched accounts on another tab or window.
Reload
to refresh your session.
Dismiss alert
{{ message }}
149ps
/
leetcode-solutions
Public
Notifications
You must be signed in to change notification settings
Fork
3
Star
0
Code
Issues
0
Pull requests
0
Actions
Projects
Security and quality
0
Insights
Additional navigation options
Code
Issues
Pull requests
Actions
Projects
Security and quality
Insights
main
Branches
Tags
Go to file
Code
Open more actions menu
Folders and files
Name
Name
Last commit message
Last commit date
Latest commit
History
785 Commits
785 Commits
.github/
workflows
.github/
workflows
.idea
.idea
1. Two Sum
1. Two Sum
10. Regular Expression Matching
10. Regular Expression Matching
1002. Find Common Characters
1002. Find Common Characters
1004. Max Consecutive Ones III
1004. Max Consecutive Ones III
1008. Construct Binary Search Tree from Preorder Traversal
1008. Construct Binary Search Tree from Preorder Traversal
1009. Complement of Base 10 Integer
1009. Complement of Base 10 Integer
101. Symmetric Tree
101. Symmetric Tree
1010. Pairs of Songs With Total Durations Divisible by 60
1010. Pairs of Songs With Total Durations Divisible by 60
102. Binary Tree Level Order Traversal
102. Binary Tree Level Order Traversal
103. Binary Tree Zigzag Level Order Traversal
103. Binary Tree Zigzag Level Order Traversal
104. Maximum Depth of Binary Tree
104. Maximum Depth of Binary Tree
1046. Last Stone Weight
1046. Last Stone Weight
1047. Remove All Adjacent Duplicates In String
1047. Remove All Adjacent Duplicates In String
1060. Missing Element in Sorted Array
1060. Missing Element in Sorted Array
107. Binary Tree Level Order Traversal II
107. Binary Tree Level Order Traversal II
108. Convert Sorted Array to Binary Search Tree
108. Convert Sorted Array to Binary Search Tree
1089. Duplicate Zeros
1089. Duplicate Zeros
109. Convert Sorted List to Binary Search Tree
109. Convert Sorted List to Binary Search Tree
1094. Car Pooling
1094. Car Pooling
1099. Two Sum Less Than K
1099. Two Sum Less Than K
11. Container With Most Water
11. Container With Most Water
1114. Print in Order
1114. Print in Order
1115. Print FooBar Alternately
1115. Print FooBar Alternately
1116. Print Zero Even Odd
1116. Print Zero Even Odd
112. Path Sum
112. Path Sum
113. Path Sum II
113. Path Sum II
114. Flatten Binary Tree to Linked List
114. Flatten Binary Tree to Linked List
1150. Check If a Number Is Majority Element in a Sorted Array
1150. Check If a Number Is Majority Element in a Sorted Array
116. Populating Next Right Pointers in Each Node
116. Populating Next Right Pointers in Each Node
1167. Minimum Cost to Connect Sticks
1167. Minimum Cost to Connect Sticks
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
1189. Maximum Number of Balloons
1189. Maximum Number of Balloons
119. Pascal's Triangle II
119. Pascal's Triangle II
1195. Fizz Buzz Multithreaded
1195. Fizz Buzz Multithreaded
1196. How Many Apples Can You Put into the Basket
1196. How Many Apples Can You Put into the Basket
1198. Find Smallest Common Element in All Rows
1198. Find Smallest Common Element in All Rows
1200. Minimum Absolute Difference
1200. Minimum Absolute Difference
121. Best Time to Buy and Sell Stock
121. Best Time to Buy and Sell Stock
1213. Intersection of Three Sorted Arrays
1213. Intersection of Three Sorted Arrays
122. Best Time to Buy and Sell Stock II
122. Best Time to Buy and Sell Stock II
1228. Missing Number In Arithmetic Progression
1228. Missing Number In Arithmetic Progression
1229. Meeting Scheduler
1229. Meeting Scheduler
1236. Web Crawler
1236. Web Crawler
124. Binary Tree Maximum Path Sum
124. Binary Tree Maximum Path Sum
1249. Minimum Remove to Make Valid Parentheses
1249. Minimum Remove to Make Valid Parentheses
125. Valid Palindrome
125. Valid Palindrome
1260. Shift 2D Grid
1260. Shift 2D Grid
127. Word Ladder
127. Word Ladder
1272. Remove Interval
1272. Remove Interval
128. Longest Consecutive Sequence
128. Longest Consecutive Sequence
1287. Element Appearing More Than 25% In Sorted Array
1287. Element Appearing More Than 25% In Sorted Array
129. Sum Root to Leaf Numbers
129. Sum Root to Leaf Numbers
1290. Convert Binary Number in a Linked List to Integer
1290. Convert Binary Number in a Linked List to Integer
130. Surrounded Regions
130. Surrounded Regions
1302. Deepest Leaves Sum
1302. Deepest Leaves Sum
1305. All Elements in Two Binary Search Trees
1305. All Elements in Two Binary Search Trees
1306. Jump Game III
1306. Jump Game III
1325. Delete Leaves With a Given Value
1325. Delete Leaves With a Given Value
1337. The K Weakest Rows in a Matrix
1337. The K Weakest Rows in a Matrix
1338. Reduce Array Size to The Half
1338. Reduce Array Size to The Half
1347. Minimum Number of Steps to Make Two Strings Anagram
1347. Minimum Number of Steps to Make Two Strings Anagram
1351. Count Negative Numbers in a Sorted Matrix
1351. Count Negative Numbers in a Sorted Matrix
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
1381. Design a Stack With Increment Operation
1381. Design a Stack With Increment Operation
139. Word Break
139. Word Break
14. Longest Common Prefix
14. Longest Common Prefix
141. Linked List Cycle
141. Linked List Cycle
142. Linked List Cycle II
142. Linked List Cycle II
1429. First Unique Number
1429. First Unique Number
144. Binary Tree Preorder Traversal
144. Binary Tree Preorder Traversal
146. LRU Cache
146. LRU Cache
1464. Maximum Product of Two Elements in an Array
1464. Maximum Product of Two Elements in an Array
1469. Find All the Lonely Nodes
1469. Find All the Lonely Nodes
147. Insertion Sort List
147. Insertion Sort List
1470. Shuffle the Array
1470. Shuffle the Array
1471. The k Strongest Values in an Array
1471. The k Strongest Values in an Array
1472. Design Browser History
1472. Design Browser History
15. 3Sum
15. 3Sum
150. Evaluate Reverse Polish Notation
150. Evaluate Reverse Polish Notation
151. Reverse Words in a String
151. Reverse Words in a String
152. Maximum Product Subarray
152. Maximum Product Subarray
153. Find Minimum in Rotated Sorted Array
153. Find Minimum in Rotated Sorted Array
155. Min Stack
155. Min Stack
156. Binary Tree Upside Down
156. Binary Tree Upside Down
159. Longest Substring with At Most Two Distinct Characters
159. Longest Substring with At Most Two Distinct Characters
16. 3Sum Closest
16. 3Sum Closest
160. Intersection of Two Linked Lists
160. Intersection of Two Linked Lists
161. One Edit Distance
161. One Edit Distance
162. Find Peak Element
162. Find Peak Element
163. Missing Ranges
163. Missing Ranges
165. Compare Version Numbers
165. Compare Version Numbers
1657. Determine if Two Strings Are Close
1657. Determine if Two Strings Are Close
167. Two Sum II - Input array is sorted
167. Two Sum II - Input array is sorted
1680. Concatenation of Consecutive Binary Numbers
1680. Concatenation of Consecutive Binary Numbers
17. Letter Combinations of a Phone Number
17. Letter Combinations of a Phone Number
View all files
Repository files navigation
README
More
items
Contains Python solutions to all the Questions in Leetcode.
About
Python Solutions to Leetcode Problems
Topics
algorithms-datastructures
coding-interview
data-structures
dfs
dynamic-programming
interview-practice
interview-prep
leetcode-problems
leetcode-problems-solutions
leetcode-python
leetcode-python-solutions
leetcode-python3
leetcode-questions
leetcode-solutions
python-leetcode
python3
Resources
Readme
Activity
Stars
0
stars
Watchers
1
watching
Forks
3
forks
Report repository
Releases
Packages
Used by
Contributors
Languages
You can’t perform that action at this time.