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 }}
qnfm
/
leetcode
Public
Notifications
You must be signed in to change notification settings
Fork
0
Star
1
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
296 Commits
296 Commits
.vscode
.vscode
.clang-format
.clang-format
.gitignore
.gitignore
100. Same Tree.cpp
100. Same Tree.cpp
102. Binary Tree Level Order Traversal.cpp
102. Binary Tree Level Order Traversal.cpp
1026. Maximum Difference Between Node and Ancestor.cpp
1026. Maximum Difference Between Node and Ancestor.cpp
104. Maximum Depth of Binary Tree.cpp
104. Maximum Depth of Binary Tree.cpp
1043. Partition Array for Maximum Sum.cpp
1043. Partition Array for Maximum Sum.cpp
1085. Sum of Digits in the Minimum Number.cpp
1085. Sum of Digits in the Minimum Number.cpp
11. Container With Most Water.cpp
11. Container With Most Water.cpp
110. Balanced Binary Tree.cpp
110. Balanced Binary Tree.cpp
1110. Delete Nodes And Return Forest.cpp
1110. Delete Nodes And Return Forest.cpp
112. Path Sum.cpp
112. Path Sum.cpp
1122. Relative Sort Array.cpp
1122. Relative Sort Array.cpp
1137. N-th Tribonacci Number.cpp
1137. N-th Tribonacci Number.cpp
1143. Longest Common Subsequence.cpp
1143. Longest Common Subsequence.cpp
1155. Number of Dice Rolls With Target Sum.cpp
1155. Number of Dice Rolls With Target Sum.cpp
1171. Remove Zero Sum Consecutive Nodes from Linked List .cpp
1171. Remove Zero Sum Consecutive Nodes from Linked List .cpp
1177. Can Make Palindrome from Substring.cpp
1177. Can Make Palindrome from Substring.cpp
1200. Minimum Absolute Difference.cpp
1200. Minimum Absolute Difference.cpp
1207. Unique Number of Occurrences.cpp
1207. Unique Number of Occurrences.cpp
121. Best Time to Buy and Sell Stock.cpp
121. Best Time to Buy and Sell Stock.cpp
122. Best Time to Buy and Sell Stock II.cpp
122. Best Time to Buy and Sell Stock II.cpp
1239. Maximum Length of a Concatenated String with Unique Characters.cpp
1239. Maximum Length of a Concatenated String with Unique Characters.cpp
124. Binary Tree Maximum Path Sum.cpp
124. Binary Tree Maximum Path Sum.cpp
1248. Count Number of Nice Subarrays.cpp
1248. Count Number of Nice Subarrays.cpp
1249. Minimum Remove to Make Valid Parentheses.cpp
1249. Minimum Remove to Make Valid Parentheses.cpp
125. Valid Palindrome.cpp
125. Valid Palindrome.cpp
128. Longest Consecutive Sequence.cpp
128. Longest Consecutive Sequence.cpp
129. Sum Root to Leaf Numbers.cpp
129. Sum Root to Leaf Numbers.cpp
1291. Sequential Digits.cpp
1291. Sequential Digits.cpp
130. Surrounded Regions.cpp
130. Surrounded Regions.cpp
131. Palindrome Partitioning.cpp
131. Palindrome Partitioning.cpp
133. Clone Graph.cpp
133. Clone Graph.cpp
1332. Remove Palindromic Subsequences.cpp
1332. Remove Palindromic Subsequences.cpp
134. Gas Station.cpp
134. Gas Station.cpp
1343. Number of Sub-arrays of Size K and Average Greater than or Equal to Threshold.cpp
1343. Number of Sub-arrays of Size K and Average Greater than or Equal to Threshold.cpp
1347. Minimum Number of Steps to Make Two Strings Anagram.cpp
1347. Minimum Number of Steps to Make Two Strings Anagram.cpp
1353. Maximum Number of Events That Can Be Attended.cpp
1353. Maximum Number of Events That Can Be Attended.cpp
138. Copy List with Random Pointer.cpp
138. Copy List with Random Pointer.cpp
139. Word Break.cpp
139. Word Break.cpp
1395. Count Number of Teams.cpp
1395. Count Number of Teams.cpp
141. Linked List Cycle.cpp
141. Linked List Cycle.cpp
1422. Maximum Score After Splitting a String.cpp
1422. Maximum Score After Splitting a String.cpp
143. Reorder List.cpp
143. Reorder List.cpp
1436. Destination City.cpp
1436. Destination City.cpp
1442. Count Triplets That Can Form Two Arrays of Equal XOR.cpp
1442. Count Triplets That Can Form Two Arrays of Equal XOR.cpp
1446. Consecutive Characters.cpp
1446. Consecutive Characters.cpp
1448. Count Good Nodes in Binary Tree.cpp
1448. Count Good Nodes in Binary Tree.cpp
1457. Pseudo-Palindromic Paths in a Binary Tree.cpp
1457. Pseudo-Palindromic Paths in a Binary Tree.cpp
146. LRU Cache.cpp
146. LRU Cache.cpp
1463. Cherry Pickup II.cpp
1463. Cherry Pickup II.cpp
1490. Clone N-ary Tree.cpp
1490. Clone N-ary Tree.cpp
1492. The kth Factor of n.cpp
1492. The kth Factor of n.cpp
1496. Path Crossing.cpp
1496. Path Crossing.cpp
15. 3Sum.cpp
15. 3Sum.cpp
150. Evaluate Reverse Polish Notation.cpp
150. Evaluate Reverse Polish Notation.cpp
1508. Range Sum of Sorted Subarray Sums.cpp
1508. Range Sum of Sorted Subarray Sums.cpp
1518. Water Bottles.cpp
1518. Water Bottles.cpp
152. Maximum Product Subarray.cpp
152. Maximum Product Subarray.cpp
153. Find Minimum in Rotated Sorted Array.cpp
153. Find Minimum in Rotated Sorted Array.cpp
1531. String Compression II.cpp
1531. String Compression II.cpp
1544. Make The String Great.cpp
1544. Make The String Great.cpp
155. Min Stack.cpp
155. Min Stack.cpp
1550. Three Consecutive Odds.cpp
1550. Three Consecutive Odds.cpp
1561. Maximum Number of Coins You Can Get.cpp
1561. Maximum Number of Coins You Can Get.cpp
1578. Minimum Time to Make Rope Colorful.cpp
1578. Minimum Time to Make Rope Colorful.cpp
1609. Even Odd Tree.cpp
1609. Even Odd Tree.cpp
1614. Maximum Nesting Depth of the Parentheses.cpp
1614. Maximum Nesting Depth of the Parentheses.cpp
1624. Largest Substring Between Two Equal Characters.cpp
1624. Largest Substring Between Two Equal Characters.cpp
1637. Widest Vertical Area Between Two Points Containing No Points.cpp
1637. Widest Vertical Area Between Two Points Containing No Points.cpp
1657. Determine if Two Strings Are Close.cpp
1657. Determine if Two Strings Are Close.cpp
1669. Merge In Between Linked Lists.cpp
1669. Merge In Between Linked Lists.cpp
167. Two Sum II - Input Array Is Sorted.cpp
167. Two Sum II - Input Array Is Sorted.cpp
1680. Concatenation of Consecutive Binary Numbers.cpp
1680. Concatenation of Consecutive Binary Numbers.cpp
169. Majority Element.cpp
169. Majority Element.cpp
1695. Maximum Erasure Value.cpp
1695. Maximum Erasure Value.cpp
17. Letter Combinations of a Phone Number.cpp
17. Letter Combinations of a Phone Number.cpp
1700. Number of Students Unable to Eat Lunch.cpp
1700. Number of Students Unable to Eat Lunch.cpp
1704. Determine if String Halves Are Alike.cpp
1704. Determine if String Halves Are Alike.cpp
171. Excel Sheet Column Number.cpp
171. Excel Sheet Column Number.cpp
1750. Minimum Length of String After Deleting Similar Ends.cpp
1750. Minimum Length of String After Deleting Similar Ends.cpp
1758. Minimum Changes To Make Alternating Binary String.cpp
1758. Minimum Changes To Make Alternating Binary String.cpp
1796. Second Largest Digit in a String.cpp
1796. Second Largest Digit in a String.cpp
1814. Count Nice Pairs in an Array.cpp
1814. Count Nice Pairs in an Array.cpp
1827. Minimum Operations to Make the Array Increasing.cpp
1827. Minimum Operations to Make the Array Increasing.cpp
1895. Largest Magic Square.cpp
1895. Largest Magic Square.cpp
1897. Redistribute Characters to Make All Strings Equal.cpp
1897. Redistribute Characters to Make All Strings Equal.cpp
1899. Merge Triplets to Form Target Triplet.cpp
1899. Merge Triplets to Form Target Triplet.cpp
19. Remove Nth Node From End of List.cpp
19. Remove Nth Node From End of List.cpp
1913. Maximum Product Difference Between Two Pairs.cpp
1913. Maximum Product Difference Between Two Pairs.cpp
1929. Concatenation of Array.cpp
1929. Concatenation of Array.cpp
1971. Find if Path Exists in Graph.cpp
1971. Find if Path Exists in Graph.cpp
198. House Robber.cpp
198. House Robber.cpp
199. Binary Tree Right Side View.cpp
199. Binary Tree Right Side View.cpp
2. Add Two Numbers.cpp
2. Add Two Numbers.cpp
200. Number of Islands.cpp
200. Number of Islands.cpp
2000. Reverse Prefix of Word.cpp
2000. Reverse Prefix of Word.cpp
201. Bitwise AND of Numbers Range.cpp
201. Bitwise AND of Numbers Range.cpp
202. Happy Number.cpp
202. Happy Number.cpp
View all files
About
No description, website, or topics provided.
Activity
Stars
1
star
Watchers
1
watching
Forks
0
forks
Report repository
Releases
Packages
Contributors
Languages
You can’t perform that action at this time.