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
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
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 }}
Ta-SeenJunaid
/
Leetcode
Public
Notifications
You must be signed in to change notification settings
Fork
1
Star
2
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
Latest commit
History
660 Commits
660 Commits
Folders and files
Name
Name
Last commit message
Last commit date
.gitignore
.gitignore
1. Two Sum.py
1. Two Sum.py
100. Same Tree.py
100. Same Tree.py
1008. Construct Binary Search Tree from Preorder Traversal.py
1008. Construct Binary Search Tree from Preorder Traversal.py
101. Symmetric Tree.py
101. Symmetric Tree.py
1011. Capacity To Ship Packages Within D Days.py
1011. Capacity To Ship Packages Within D Days.py
102. Binary Tree Level Order Traversal.py
102. Binary Tree Level Order Traversal.py
1020. Number of Enclaves.py
1020. Number of Enclaves.py
1022. Sum of Root To Leaf Binary Numbers.py
1022. Sum of Root To Leaf Binary Numbers.py
1025. Divisor Game.py
1025. Divisor Game.py
1026. Maximum Difference Between Node and Ancestor.py
1026. Maximum Difference Between Node and Ancestor.py
103. Binary Tree Zigzag Level Order Traversal.py
103. Binary Tree Zigzag Level Order Traversal.py
1038. Binary Search Tree to Greater Sum Tree.py
1038. Binary Search Tree to Greater Sum Tree.py
104. Maximum Depth of Binary Tree.py
104. Maximum Depth of Binary Tree.py
1043. Partition Array for Maximum Sum memo.py
1043. Partition Array for Maximum Sum memo.py
1046. Last Stone Weight.py
1046. Last Stone Weight.py
1047. Remove All Adjacent Duplicates In String.py
1047. Remove All Adjacent Duplicates In String.py
105. Construct Binary Tree from Preorder and Inorder Traversal.py
105. Construct Binary Tree from Preorder and Inorder Traversal.py
106. Construct Binary Tree from Inorder and Postorder Traversal.py
106. Construct Binary Tree from Inorder and Postorder Traversal.py
1064. Fixed Point.py
1064. Fixed Point.py
107. Binary Tree Level Order Traversal II.py
107. Binary Tree Level Order Traversal II.py
1079. Letter Tile Possibilities.py
1079. Letter Tile Possibilities.py
108. Convert Sorted Array to Binary Search Tree.py
108. Convert Sorted Array to Binary Search Tree.py
1086. High Five.py
1086. High Five.py
109. Convert Sorted List to Binary Search Tree.py
109. Convert Sorted List to Binary Search Tree.py
1091. Shortest Path in Binary Matrix.py
1091. Shortest Path in Binary Matrix.py
1092. Shortest Common Supersequence.py
1092. Shortest Common Supersequence.py
11. Container With Most Water.py
11. Container With Most Water.py
110. Balanced Binary Tree.py
110. Balanced Binary Tree.py
1106. Parsing A Boolean Expression.py
1106. Parsing A Boolean Expression.py
1108. Defanging an IP Address.py
1108. Defanging an IP Address.py
111. Minimum Depth of Binary Tree.py
111. Minimum Depth of Binary Tree.py
1110. Delete Nodes And Return Forest.py
1110. Delete Nodes And Return Forest.py
112. Path Sum.py
112. Path Sum.py
1123. Lowest Common Ancestor of Deepest Leaves.py
1123. Lowest Common Ancestor of Deepest Leaves.py
113. Path Sum II.py
113. Path Sum II.py
1137. N-th Tribonacci Number.py
1137. N-th Tribonacci Number.py
114. Flatten Binary Tree to Linked List.py
114. Flatten Binary Tree to Linked List.py
1143. Longest Common Subsequence memorization.py
1143. Longest Common Subsequence memorization.py
1143. Longest Common Subsequence tabulation.py
1143. Longest Common Subsequence tabulation.py
1147. Longest Chunked Palindrome Decomposition.py
1147. Longest Chunked Palindrome Decomposition.py
116. Populating Next Right Pointers in Each Node.py
116. Populating Next Right Pointers in Each Node.py
1167. Minimum Cost to Connect Sticks.py
1167. Minimum Cost to Connect Sticks.py
117. Populating Next Right Pointers in Each Node II.py
117. Populating Next Right Pointers in Each Node II.py
1171. Remove Zero Sum Consecutive Nodes from Linked List.py
1171. Remove Zero Sum Consecutive Nodes from Linked List.py
118. Pascal’s Triangle.py
118. Pascal’s Triangle.py
119. Pascal's Triangle II.py
119. Pascal's Triangle II.py
1190. Reverse Substrings Between Each Pair of Parentheses.py
1190. Reverse Substrings Between Each Pair of Parentheses.py
1198. Find Smallest Common Element in All Rows.py
1198. Find Smallest Common Element in All Rows.py
12. Integer to Roman.py
12. Integer to Roman.py
120. Triangle memo.py
120. Triangle memo.py
120. Triangle tabu SO.py
120. Triangle tabu SO.py
120. Triangle tabu.py
120. Triangle tabu.py
1200. Minimum Absolute Difference.py
1200. Minimum Absolute Difference.py
1207. Unique Number of Occurrences.py
1207. Unique Number of Occurrences.py
121. Best Time to Buy and Sell Stock.py
121. Best Time to Buy and Sell Stock.py
1213. Intersection of Three Sorted Arrays.py
1213. Intersection of Three Sorted Arrays.py
122. Best Time to Buy and Sell Stock II memo.py
122. Best Time to Buy and Sell Stock II memo.py
122. Best Time to Buy and Sell Stock II tabu SO.py
122. Best Time to Buy and Sell Stock II tabu SO.py
122. Best Time to Buy and Sell Stock II tabu.py
122. Best Time to Buy and Sell Stock II tabu.py
123. Best Time to Buy and Sell Stock III memo.py
123. Best Time to Buy and Sell Stock III memo.py
123. Best Time to Buy and Sell Stock III tabu SO.py
123. Best Time to Buy and Sell Stock III tabu SO.py
123. Best Time to Buy and Sell Stock III tabu.py
123. Best Time to Buy and Sell Stock III tabu.py
1237. Find Positive Integer Solution for a Given Equation.py
1237. Find Positive Integer Solution for a Given Equation.py
124. Binary Tree Maximum Path Sum.py
124. Binary Tree Maximum Path Sum.py
125. Valid Palindrome.py
125. Valid Palindrome.py
1261. Find Elements in a Contaminated Binary Tree.py
1261. Find Elements in a Contaminated Binary Tree.py
1268. Search Suggestions System.py
1268. Search Suggestions System.py
127. Word Ladder.py
127. Word Ladder.py
1282. Group the People Given the Group Size They Belong To.py
1282. Group the People Given the Group Size They Belong To.py
1283. Find the Smallest Divisor Given a Threshold.py
1283. Find the Smallest Divisor Given a Threshold.py
129. Sum Root to Leaf Numbers.py
129. Sum Root to Leaf Numbers.py
13. Roman to Integer.py
13. Roman to Integer.py
130. Surrounded Regions.py
130. Surrounded Regions.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
131. Palindrome Partitioning.py
131. Palindrome Partitioning.py
1312. Minimum Insertion Steps to Make a String Palindrome.py
1312. Minimum Insertion Steps to Make a String Palindrome.py
1313. Decompress Run-Length Encoded List.py
1313. Decompress Run-Length Encoded List.py
1315. Sum of Nodes with Even-Valued Grandparent.py
1315. Sum of Nodes with Even-Valued Grandparent.py
1319. Number of Operations to Make Network Connected.py
1319. Number of Operations to Make Network Connected.py
1323. Maximum 69 Number.py
1323. Maximum 69 Number.py
1325. Delete Leaves With a Given Value.py
1325. Delete Leaves With a Given Value.py
1328. Break a Palindrome.py
1328. Break a Palindrome.py
133. Clone Graph.py
133. Clone Graph.py
1332. Remove Palindromic Subsequences.py
1332. Remove Palindromic Subsequences.py
1337. The K Weakest Rows in a Matrix.py
1337. The K Weakest Rows in a Matrix.py
1338. Reduce Array Size to The Half.py
1338. Reduce Array Size to The Half.py
1342. Number of Steps to Reduce a Number to Zero.py
1342. Number of Steps to Reduce a Number to Zero.py
1343. Number of Sub-arrays of Size K and Average Greater than or Equal to Threshold.py
1343. Number of Sub-arrays of Size K and Average Greater than or Equal to Threshold.py
1345. Jump Game IV.py
1345. Jump Game IV.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
1358. Number of Substrings Containing All Three Characters.py
1358. Number of Substrings Containing All Three Characters.py
136. Single Number.py
136. Single Number.py
1365. How Many Numbers Are Smaller Than the Current Number.py
1365. How Many Numbers Are Smaller Than the Current Number.py
1367. Linked List in Binary Tree.py
1367. Linked List in Binary Tree.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
1382. Balance a Binary Search Tree.py
1382. Balance a Binary Search Tree.py
1385. Find the Distance Value Between Two Arrays.py
1385. Find the Distance Value Between Two Arrays.py
View all files
Repository files navigation
README
More
items
Leetcode
About
No description, website, or topics provided.
Resources
Readme
Activity
Stars
2
stars
Watchers
1
watching
Forks
1
fork
Report repository
Releases
Packages
Contributors
Languages
You can’t perform that action at this time.