Skip to content
Navigation Menu
Sign in
Products
Platform
GitHub
Repository hosting, code review, and collaboration
Copilot
AI coding agent for tasks, projects, and automated work
Build & Ship
Actions
CI/CD and automation
Code Quality
Quality analysis, fixes, and enforcement
Codespaces
Cloud development environments
Secure
Code Security
Vulnerability detection and remediation
Secret Protection
Secret scanning and leak prevention
All Features
Developers
Learn
Documentation
Training
Certifications
Build
Build with Copilot
Customize Copilot
Integrations
Explore
Trending repos
GitHub Sponsors
Developer articles
Changelog
Changelog
Your source for the latest features, improvements, and fixes across GitHub products, all in one place.
Businesses
By Stage
Enterprises
Team
Startups
Nonprofits
By Industry
Healthcare
Financial services
Manufacturing
Government
See all industries
Evaluate GitHub
Why GitHub
Customer Stories
Business insights
Trust Center
Add-ons
GitHub Advanced Security
Enterprise-grade code security
Copilot for business
Enterprise-grade AI features
Premium Support
Enterprise-grade 24/7 support
Resources
Learn & Connect
Documentation
Resource center
Blog
Events & webinars
Community Forum
Customer Stories
Integrations
Support
Customer support
Training
GitHub Status
Company
About
Partners
Changelog
GitHub Universe
GitHub Universe
The event for developers, by developers — talks, workshops, and what’s next for GitHub.
Pricing
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 }}
themockingjester
leetcode-python-
Repository navigation
Code
Issues
Pull requests
Actions
Projects
Security and quality
Insights
More
items
leetcode-python-
Public
Notifications
You must be signed in to change notification settings
Fork
1
(
1
)
Star
1
(
1
)
You must be signed in to star a repository
About
No description, website, or topics provided.
Resources
Readme
Activity
Stars
1
star
Watchers
1
watching
Forks
1
fork
Report repository
main
Branches
Tags
Go to file
Code
Open more actions menu
Latest commit
History
304 Commits
304 Commits
Folders and files
Name
Name
Last commit message
Last commit date
1002. Find Common Characters.py
1002. Find Common Characters.py
1003. Check If Word Is Valid After Substitutions
1003. Check If Word Is Valid After Substitutions
1019. Next Greater Node In Linked List.py
1019. Next Greater Node In Linked List.py
102. Binary Tree Level Order Traversal.py
102. Binary Tree Level Order Traversal.py
1021. Remove Outermost Parentheses
1021. Remove Outermost Parentheses
103. Binary Tree Zigzag Level Order Traversal.py
103. Binary Tree Zigzag Level Order Traversal.py
104. Maximum Depth of Binary Tree.py
104. Maximum Depth of Binary Tree.py
107. Binary Tree Level Order Traversal II.py
107. Binary Tree Level Order Traversal II.py
11. Container With Most Water.py
11. Container With Most Water.py
110. Balanced Binary Tree.py
110. Balanced Binary Tree.py
111. Minimum Depth of Binary Tree.py
111. Minimum Depth of Binary Tree.py
112. Path Sum.py
112. Path Sum.py
1122. Relative Sort Array.py
1122. Relative Sort Array.py
113. Path Sum II.py
113. Path Sum II.py
114. Flatten Binary Tree to Linked List.py
114. Flatten Binary Tree to Linked List.py
1143. Longest Common Subsequence.py
1143. Longest Common Subsequence.py
116. Populating Next Right Pointers in Each Node.py
116. Populating Next Right Pointers in Each Node.py
117. Populating Next Right Pointers in Each Node II.py
117. Populating Next Right Pointers in Each Node II.py
124. Binary Tree Maximum Path Sum
124. Binary Tree Maximum Path Sum
125. Valid Palindrome.py
125. Valid Palindrome.py
1252. Cells with Odd Values in a Matrix.py
1252. Cells with Odd Values in a Matrix.py
1260. Shift 2D Grid.py
1260. Shift 2D Grid.py
129. Sum Root to Leaf Numbers.py
129. Sum Root to Leaf Numbers.py
1290. Convert Binary Number in a Linked List to Integer.py
1290. Convert Binary Number in a Linked List to Integer.py
1299. Replace Elements with Greatest Element on Right Side.py
1299. Replace Elements with Greatest Element on Right Side.py
1302. Deepest Leaves Sum.py
1302. Deepest Leaves Sum.py
1305. All Elements in Two Binary Search Trees.py
1305. All Elements in Two Binary Search Trees.py
1313. Decompress Run-Length Encoded List.py
1313. Decompress Run-Length Encoded List.py
1325. Delete Leaves With a Given Value.py
1325. Delete Leaves With a Given Value.py
1329. Sort the Matrix Diagonally.py
1329. Sort the Matrix Diagonally.py
1346. Check If N and Its Double Exist.py
1346. Check If N and Its Double Exist.py
1351. Count Negative Numbers in a Sorted Matrix.py
1351. Count Negative Numbers in a Sorted Matrix.py
136. Single Number.py
136. Single Number.py
1367. Linked List in Binary Tree.py
1367. Linked List in Binary Tree.py
137. Single Number II.py
137. Single Number II.py
1379. Find a Corresponding Node of a Binary Tree in a Clone of That Tree.py
1379. Find a Corresponding Node of a Binary Tree in a Clone of That Tree.py
1381. Design a Stack With Increment Operation.py
1381. Design a Stack With Increment Operation.py
1394. Find Lucky Integer in an Array.py
1394. Find Lucky Integer in an Array.py
14. Longest Common Prefix
14. Longest Common Prefix
141. Linked List Cycle.py
141. Linked List Cycle.py
1410. HTML Entity Parser.py
1410. HTML Entity Parser.py
142. Linked List Cycle II.py
142. Linked List Cycle II.py
143. Reorder List.py
143. Reorder List.py
1431. Kids With the Greatest Number of Candies.py
1431. Kids With the Greatest Number of Candies.py
144. Binary Tree Preorder Traversal.py
144. Binary Tree Preorder Traversal.py
1441. Build an Array With Stack Operations.py
1441. Build an Array With Stack Operations.py
1446. Consecutive Characters.py
1446. Consecutive Characters.py
1448. Count Good Nodes in Binary Tree.py
1448. Count Good Nodes in Binary Tree.py
145. Binary Tree Postorder Traversal.py
145. Binary Tree Postorder Traversal.py
1455. Check If a Word Occurs As a Prefix of Any Word in a Sentence.py
1455. Check If a Word Occurs As a Prefix of Any Word in a Sentence.py
147. Insertion Sort List.py
147. Insertion Sort List.py
1470. Shuffle the Array.py
1470. Shuffle the Array.py
148. Sort List.py
148. Sort List.py
1480. Running Sum of 1d Array.py
1480. Running Sum of 1d Array.py
1486. XOR Operation in an Array.py
1486. XOR Operation in an Array.py
1491. Average Salary Excluding the Minimum and Maximum Salary.py
1491. Average Salary Excluding the Minimum and Maximum Salary.py
1502. Can Make Arithmetic Progression From Sequence.py
1502. Can Make Arithmetic Progression From Sequence.py
1509. Minimum Difference Between Largest and Smallest Value in Three Moves.py
1509. Minimum Difference Between Largest and Smallest Value in Three Moves.py
151. Reverse Words in a String.py
151. Reverse Words in a String.py
1513. Number of Substrings With Only 1s.py
1513. Number of Substrings With Only 1s.py
152. Maximum Product Subarray.py
152. Maximum Product Subarray.py
1528. Shuffle String.py
1528. Shuffle String.py
153. Find Minimum in Rotated Sorted Array.py
153. Find Minimum in Rotated Sorted Array.py
1539. Kth Missing Positive Number.py
1539. Kth Missing Positive Number.py
154. Find Minimum in Rotated Sorted Array II.py
154. Find Minimum in Rotated Sorted Array II.py
155. Min Stack.py
155. Min Stack.py
1556. Thousand Separator.py
1556. Thousand Separator.py
1598. Crawler Log Folder.py
1598. Crawler Log Folder.py
160. Intersection of Two Linked Lists.py
160. Intersection of Two Linked Lists.py
1614. Maximum Nesting Depth of the Parentheses
1614. Maximum Nesting Depth of the Parentheses
162. Find Peak Element.py
162. Find Peak Element.py
1669. Merge In Between Linked Lists.py
1669. Merge In Between Linked Lists.py
1680. Concatenation of Consecutive Binary Numbers.py
1680. Concatenation of Consecutive Binary Numbers.py
169. Majority Element.py
169. Majority Element.py
17. Letter Combinations of a Phone Number.py
17. Letter Combinations of a Phone Number.py
1701. Average Waiting Time.py
1701. Average Waiting Time.py
1704. Determine if String Halves Are Alike.py
1704. Determine if String Halves Are Alike.py
172. Factorial Trailing Zeroes.py
172. Factorial Trailing Zeroes.py
1721. Swapping Nodes in a Linked List.py
1721. Swapping Nodes in a Linked List.py
1748. Sum of Unique Elements.py
1748. Sum of Unique Elements.py
1759. Count Number of Homogenous Substrings.py
1759. Count Number of Homogenous Substrings.py
1796. Second Largest Digit in a String.py
1796. Second Largest Digit in a String.py
1832. Check if the Sentence Is Pangram.py
1832. Check if the Sentence Is Pangram.py
1833. Maximum Ice Cream Bars.py
1833. Maximum Ice Cream Bars.py
1837. Sum of Digits in Base K.py
1837. Sum of Digits in Base K.py
1844. Replace All Digits with Characters.py
1844. Replace All Digits with Characters.py
1846. Maximum Element After Decreasing and Rearranging.py
1846. Maximum Element After Decreasing and Rearranging.py
1848. Minimum Distance to the Target Element.py
1848. Minimum Distance to the Target Element.py
187. Repeated DNA Sequences.py
187. Repeated DNA Sequences.py
1876. Substrings of Size Three with Distinct Characters.py
1876. Substrings of Size Three with Distinct Characters.py
189. Rotate Array.py
189. Rotate Array.py
19. Remove Nth Node From End of List.py
19. Remove Nth Node From End of List.py
190. Reverse Bits.py
190. Reverse Bits.py
1903. Largest Odd Number in String
1903. Largest Odd Number in String
191. Number of 1 Bits.py
191. Number of 1 Bits.py
198. House Robber.py
198. House Robber.py
199. Binary Tree Right Side View.py
199. Binary Tree Right Side View.py
2. Add Two Numbers
2. Add Two Numbers
20. Valid Parentheses.py
20. Valid Parentheses.py
203. Remove Linked List Elements.py
203. Remove Linked List Elements.py
View all files
Repository files navigation
README
More
items
leetcode
About
No description, website, or topics provided.
Resources
Readme
Activity
Stars
1
star
Watchers
1
watching
Forks
1
fork
Report repository
Releases
Packages
Contributors
Languages
You can’t perform that action at this time.