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 }}
kloudnone
/
Leetcode
Public
Notifications
You must be signed in to change notification settings
Fork
0
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
Files
Expand file tree
main
Breadcrumbs
Leetcode
/
problems
/
Copy path
Directory actions
More options
More options
Directory actions
More options
More options
Latest commit
History
History
History
main
Breadcrumbs
Leetcode
/
problems
/
Copy path
Top
Folders and files
Name
Name
Last commit message
Last commit date
parent directory
..
0001 - Two Sum
0001 - Two Sum
0002 - Add Two Numbers/
Go
0002 - Add Two Numbers/
Go
0003 - Longest Substring Without Repeating Characters
0003 - Longest Substring Without Repeating Characters
0009 - Palindrome Number/
Go
0009 - Palindrome Number/
Go
0013 - Roman to Integer
0013 - Roman to Integer
0020 - Valid Parentheses/
Go
0020 - Valid Parentheses/
Go
0021 - Merge Two Sorted Lists
0021 - Merge Two Sorted Lists
0024 - Swap Nodes in Pairs/
Go
0024 - Swap Nodes in Pairs/
Go
0026 - Remove Duplicates from Sorted Array/
Go
0026 - Remove Duplicates from Sorted Array/
Go
0027 - Remove Element
0027 - Remove Element
0028 - Find the Index of the First Occurrence in a String/
Go
0028 - Find the Index of the First Occurrence in a String/
Go
0034 - Find First ans Last Position of Element in Sorted Array
0034 - Find First ans Last Position of Element in Sorted Array
0035 - Search Insert Position
0035 - Search Insert Position
0058 - Length of Last Word/
Go
0058 - Length of Last Word/
Go
0070 - Climbing Stairs
0070 - Climbing Stairs
0071 - Simplify Path
0071 - Simplify Path
0080 - Remove Duplicates from Sorted Array II/
Go
0080 - Remove Duplicates from Sorted Array II/
Go
0082 - Remove Duplicates from Sorted List II
0082 - Remove Duplicates from Sorted List II
0083 - Remove Duplicates from Sorted List
0083 - Remove Duplicates from Sorted List
0088 - Merge Sorted Array
0088 - Merge Sorted Array
0100 - Same Tree
0100 - Same Tree
0104 - Maximum Depth of Binary Tree
0104 - Maximum Depth of Binary Tree
0116 - Populating Next Right Pointers in Each Node
0116 - Populating Next Right Pointers in Each Node
0118 - Pascal's Triangle
0118 - Pascal's Triangle
0121 - Best Time to Buy and Sell Stock/
Go
0121 - Best Time to Buy and Sell Stock/
Go
0122 - Best Time to Buy and Sell Stock II
0122 - Best Time to Buy and Sell Stock II
0134 - Gas Station/
Go
0134 - Gas Station/
Go
0136 - Single Number/
Go
0136 - Single Number/
Go
0141 - Linked List Cycle
0141 - Linked List Cycle
0142 - Linked List Cycle II/
Go
0142 - Linked List Cycle II/
Go
0169 - Majority Element/
Go
0169 - Majority Element/
Go
0175 - Combine two Tables/
MySQL
0175 - Combine two Tables/
MySQL
0189 - Rotate Array/
Go
0189 - Rotate Array/
Go
0191 - Number of 1 Bits
0191 - Number of 1 Bits
0195 - Tenth Line/
Shell
0195 - Tenth Line/
Shell
0202 - Happy Number
0202 - Happy Number
0226 - Invert Binary Tree
0226 - Invert Binary Tree
0228 - Summary Ranges
0228 - Summary Ranges
0237 - Delete Node in a Linked List
0237 - Delete Node in a Linked List
0258 - Add Digits/
Go
0258 - Add Digits/
Go
0278 - First Bad Version
0278 - First Bad Version
0283 - Move Zeroes/
Go
0283 - Move Zeroes/
Go
0344 - Reverse String
0344 - Reverse String
0410 - Split Array Largest Sum
0410 - Split Array Largest Sum
0412 - Fizz Buzz
0412 - Fizz Buzz
0438 - Find All Anagrams in a String/
Go
0438 - Find All Anagrams in a String/
Go
0441 - Arranging Coins
0441 - Arranging Coins
0442 - Find All Duplicates in an Array
0442 - Find All Duplicates in an Array
0496 - Next Greater Element I
0496 - Next Greater Element I
0509 - Fibonacci Number/
Go
0509 - Fibonacci Number/
Go
0567 - Permutation in String
0567 - Permutation in String
0589 - N-ary Tree Preorder Traversal
0589 - N-ary Tree Preorder Traversal
0605 - Can Place Flowers/
Go
0605 - Can Place Flowers/
Go
0617 - Merge Two Binary Trees/
Go
0617 - Merge Two Binary Trees/
Go
0704 - Binary Search
0704 - Binary Search
0705 - Design HashSet
0705 - Design HashSet
0706 - Design HashMap
0706 - Design HashMap
0709 - To Lower Case/
Go
0709 - To Lower Case/
Go
0729 - My Calendar I/
Go
0729 - My Calendar I/
Go
0797 - All Paths From Source to Target/
Go
0797 - All Paths From Source to Target/
Go
0849 - Maximize Distance to Closest Person/
Go
0849 - Maximize Distance to Closest Person/
Go
0876 - Middle of the Linked List
0876 - Middle of the Linked List
0881 - Boats to Save People
0881 - Boats to Save People
0896 - Monotonic Array/
Go
0896 - Monotonic Array/
Go
0938 - Range Sum of BST/
Go
0938 - Range Sum of BST/
Go
0974 - Subarray Sums Divisible by K/
Go
0974 - Subarray Sums Divisible by K/
Go
0976 - Largest Perimeter Triangle
0976 - Largest Perimeter Triangle
0977 - Squares of a Sorted Array
0977 - Squares of a Sorted Array
0991 - Broken Calculator
0991 - Broken Calculator
1009 - Complement of Base 10 Integer/
Go
1009 - Complement of Base 10 Integer/
Go
1010 - Pairs of Songs With Total Durations Divisible by 60/
Go
1010 - Pairs of Songs With Total Durations Divisible by 60/
Go
1051 - Height Checker/
Go
1051 - Height Checker/
Go
1108 - Defanging an IP Address
1108 - Defanging an IP Address
1207 - Unique Number of Occurrences
1207 - Unique Number of Occurrences
1217 - Minimum Cost to Move Chips to The Same Position/
Go
1217 - Minimum Cost to Move Chips to The Same Position/
Go
1232 - Check If It Is a Straight Line
1232 - Check If It Is a Straight Line
1281 - Subtract the Product and Sum of Digits of an Integer
1281 - Subtract the Product and Sum of Digits of an Integer
1290 - Convert Binary Number in a Linked List to Integer/
Go
1290 - Convert Binary Number in a Linked List to Integer/
Go
1332 - Remove Palindromic Subsequences
1332 - Remove Palindromic Subsequences
1342 - Number of Steps to Reduce a Number to Zero
1342 - Number of Steps to Reduce a Number to Zero
1351 - Count Negative Numbers in a Sorted Matrix
1351 - Count Negative Numbers in a Sorted Matrix
1365 - How Many Numbers Are Smaller Than the Current Number/
Go
1365 - How Many Numbers Are Smaller Than the Current Number/
Go
1389 - Create Target Array in the Given Order/
PHP
1389 - Create Target Array in the Given Order/
PHP
1413 - Minimum Value to Get Positive Step by Step Sum
1413 - Minimum Value to Get Positive Step by Step Sum
1446 - Consecutive Characters/
Go
1446 - Consecutive Characters/
Go
1470 - Shuffle the Array/
Go
1470 - Shuffle the Array/
Go
1480 - Running Sum of 1d Array
1480 - Running Sum of 1d Array
1491 - Average Salary Excluding the Minimum and Maximum Salary
1491 - Average Salary Excluding the Minimum and Maximum Salary
1502 - Can Make Arithmetic Progression From Sequence
1502 - Can Make Arithmetic Progression From Sequence
1512 - Number of Good Pairs
1512 - Number of Good Pairs
1523 - Count Odd Numbers in an Interval Range
1523 - Count Odd Numbers in an Interval Range
1528 - Shuffle String
1528 - Shuffle String
1572 - Matrix Diagonal Sum
1572 - Matrix Diagonal Sum
1588 - Sum of All Odd Length Subarrays
1588 - Sum of All Odd Length Subarrays
1641 - Count Sorted Vowel Strings
1641 - Count Sorted Vowel Strings
1652 - Defuse the Bomb/
Go
1652 - Defuse the Bomb/
Go
1672 - Richest Customer Wealth/
Go
1672 - Richest Customer Wealth/
Go
1684 - Count the Number of Consistent Strings
1684 - Count the Number of Consistent Strings
1720 - Decode XORed Array/
Go
1720 - Decode XORed Array/
Go
1741 - Find Total Time Spent by Each Employee
1741 - Find Total Time Spent by Each Employee
View all files
You can’t perform that action at this time.