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 }}
ngoyal16
/
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
master
Branches
Tags
Go to file
Code
Open more actions menu
Folders and files
Name
Name
Last commit message
Last commit date
Latest commit
History
109 Commits
109 Commits
00001 - Two Sum
00001 - Two Sum
00002 - Add Two Numbers
00002 - Add Two Numbers
00003 - Longest Substring Without Repeating Characters
00003 - Longest Substring Without Repeating Characters
00004 - Median of Two Sorted Arrays
00004 - Median of Two Sorted Arrays
00006 - ZigZag Conversion
00006 - ZigZag Conversion
00007 - Reverse Integer
00007 - Reverse Integer
00009 - Palindrome Number
00009 - Palindrome Number
00013 - Roman to Integer
00013 - Roman to Integer
00014 - Longest Common Prefix
00014 - Longest Common Prefix
00017 - Letter Combinations of a Phone Number
00017 - Letter Combinations of a Phone Number
00020 - Valid Parentheses
00020 - Valid Parentheses
00021 - Merge Two Sorted Lists
00021 - Merge Two Sorted Lists
00026 - Remove Duplicates from Sorted Array
00026 - Remove Duplicates from Sorted Array
00027 - Remove Element
00027 - Remove Element
00028 - Implement strStr()
00028 - Implement strStr()
00035 - Search Insert Position
00035 - Search Insert Position
00050 - Pow(x, n)
00050 - Pow(x, n)
00058 - Length of Last Word
00058 - Length of Last Word
00066 - Plus One
00066 - Plus One
00067 - Add Binary
00067 - Add Binary
00069 - Sqrt(x)
00069 - Sqrt(x)
00070 - Climbing Stairs
00070 - Climbing Stairs
00083 - Remove Duplicates from Sorted List
00083 - Remove Duplicates from Sorted List
00088 - Merge Sorted Array
00088 - Merge Sorted Array
00100 - Same Tree
00100 - Same Tree
00104 - Maximum Depth of Binary Tree
00104 - Maximum Depth of Binary Tree
00108 - Convert Sorted Array to Binary Search Tree
00108 - Convert Sorted Array to Binary Search Tree
00111 - Minimum Depth of Binary Tree
00111 - Minimum Depth of Binary Tree
00118 - Pascal's Triangle
00118 - Pascal's Triangle
00119 - Pascal's Triangle II
00119 - Pascal's Triangle II
00121 - Best Time to Buy and Sell Stock
00121 - Best Time to Buy and Sell Stock
00125 - Valid Palindrome
00125 - Valid Palindrome
00136 - Single Number
00136 - Single Number
00141 - Linked List Cycle
00141 - Linked List Cycle
00168 - Excel Sheet Column Title
00168 - Excel Sheet Column Title
00169 - Majority Element
00169 - Majority Element
00172 - Factorial Trailing Zeroes
00172 - Factorial Trailing Zeroes
00175 - Combine Two Tables
00175 - Combine Two Tables
00176 - Second Highest Salary
00176 - Second Highest Salary
00177 - Nth Highest Salary
00177 - Nth Highest Salary
00181 - Employees Earning More Than Their Managers
00181 - Employees Earning More Than Their Managers
00182 - Duplicate Emails
00182 - Duplicate Emails
00183 - Customers Who Never Order
00183 - Customers Who Never Order
00184 - Department Highest Salary
00184 - Department Highest Salary
00189 - Rotate Array
00189 - Rotate Array
00190 - Reverse Bits
00190 - Reverse Bits
00196 - Delete Duplicate Emails
00196 - Delete Duplicate Emails
00197 - Rising Temperature
00197 - Rising Temperature
00202 - Happy Number
00202 - Happy Number
00217 - Contains Duplicate
00217 - Contains Duplicate
00231 - Power of Two
00231 - Power of Two
00258 - Add Digits
00258 - Add Digits
00263 - Ugly Number
00263 - Ugly Number
00344 - Reverse String
00344 - Reverse String
00367 - Valid Perfect Square
00367 - Valid Perfect Square
00387 - First Unique Character in a String
00387 - First Unique Character in a String
00389 - Find the Difference
00389 - Find the Difference
00509 - Fibonacci Number
00509 - Fibonacci Number
00511 - Game Play Analysis I
00511 - Game Play Analysis I
00559 - Maximum Depth of N-ary Tree
00559 - Maximum Depth of N-ary Tree
00561 - Array Partition I
00561 - Array Partition I
00577 - Employee Bonus
00577 - Employee Bonus
00589 - N-ary Tree Preorder Traversal
00589 - N-ary Tree Preorder Traversal
00590 - N-ary Tree Postorder Traversal
00590 - N-ary Tree Postorder Traversal
00595 - Big Countries
00595 - Big Countries
00596 - Classes More Than 5 Students
00596 - Classes More Than 5 Students
00617 - Merge Two Binary Trees
00617 - Merge Two Binary Trees
00620 - Not Boring Movies
00620 - Not Boring Movies
00627 - Swap Salary
00627 - Swap Salary
00657 - Robot Return to Origin
00657 - Robot Return to Origin
00700 - Search in a Binary Search Tree
00700 - Search in a Binary Search Tree
00709 - To Lower Case
00709 - To Lower Case
00724 - Find Pivot Index
00724 - Find Pivot Index
00728 - Self Dividing Numbers
00728 - Self Dividing Numbers
00744 - Find Smallest Letter Greater Than Target
00744 - Find Smallest Letter Greater Than Target
00747 - Largest Number At Least Twice of Others
00747 - Largest Number At Least Twice of Others
00771 - Jewels and Stones
00771 - Jewels and Stones
00804 - Unique Morse Code Words
00804 - Unique Morse Code Words
00811 - Subdomain Visit Count
00811 - Subdomain Visit Count
00832 - Flipping an Image
00832 - Flipping an Image
00859 - Buddy Strings
00859 - Buddy Strings
00905 - Sort Array By Parity
00905 - Sort Array By Parity
00925 - Long Pressed Name
00925 - Long Pressed Name
00938 - Range Sum of BST
00938 - Range Sum of BST
00942 - DI String Match
00942 - DI String Match
00944 - Delete Columns to Make Sorted
00944 - Delete Columns to Make Sorted
00961 - N-Repeated Element in Size 2N Array
00961 - N-Repeated Element in Size 2N Array
00965 - Univalued Binary Tree
00965 - Univalued Binary Tree
00977 - Squares of a Sorted Array
00977 - Squares of a Sorted Array
00999 - Available Captures for Rook
00999 - Available Captures for Rook
01021 - Remove Outermost Parentheses
01021 - Remove Outermost Parentheses
01051 - Height Checker
01051 - Height Checker
README.md
README.md
View all files
Repository files navigation
README
More
items
LeetCode
LeetCode solutions
About
LeetCode solutions
Topics
leetcode
leetcode-python
leetcode-solutions
Resources
Readme
Activity
Stars
0
stars
Watchers
1
watching
Forks
0
forks
Report repository
Releases
Packages
Contributors
Languages
You can’t perform that action at this time.