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 }}
abhikdas7421
/
Leet-Code
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
main
Branches
Tags
Go to file
Code
Open more actions menu
Latest commit
History
1,505 Commits
1,505 Commits
Folders and files
Name
Name
Last commit message
Last commit date
0001-two-sum
0001-two-sum
0004-median-of-two-sorted-arrays
0004-median-of-two-sorted-arrays
0005-longest-palindromic-substring
0005-longest-palindromic-substring
0006-zigzag-conversion
0006-zigzag-conversion
0007-reverse-integer
0007-reverse-integer
0008-string-to-integer-atoi
0008-string-to-integer-atoi
0012-integer-to-roman
0012-integer-to-roman
0014-longest-common-prefix
0014-longest-common-prefix
0015-3sum
0015-3sum
0017-letter-combinations-of-a-phone-number
0017-letter-combinations-of-a-phone-number
0019-remove-nth-node-from-end-of-list
0019-remove-nth-node-from-end-of-list
0020-valid-parentheses
0020-valid-parentheses
0021-merge-two-sorted-lists
0021-merge-two-sorted-lists
0022-generate-parentheses
0022-generate-parentheses
0028-find-the-index-of-the-first-occurrence-in-a-string
0028-find-the-index-of-the-first-occurrence-in-a-string
0031-next-permutation
0031-next-permutation
0032-longest-valid-parentheses
0032-longest-valid-parentheses
0034-find-first-and-last-position-of-element-in-sorted-array
0034-find-first-and-last-position-of-element-in-sorted-array
0036-valid-sudoku
0036-valid-sudoku
0037-sudoku-solver
0037-sudoku-solver
0039-combination-sum
0039-combination-sum
0040-combination-sum-ii
0040-combination-sum-ii
0041-first-missing-positive
0041-first-missing-positive
0042-trapping-rain-water
0042-trapping-rain-water
0046-permutations
0046-permutations
0047-permutations-ii
0047-permutations-ii
0049-group-anagrams
0049-group-anagrams
0051-n-queens
0051-n-queens
0053-maximum-subarray
0053-maximum-subarray
0054-spiral-matrix
0054-spiral-matrix
0056-merge-intervals
0056-merge-intervals
0057-insert-interval
0057-insert-interval
0058-length-of-last-word
0058-length-of-last-word
0061-rotate-list
0061-rotate-list
0069-sqrtx
0069-sqrtx
0070-climbing-stairs
0070-climbing-stairs
0071-simplify-path
0071-simplify-path
0075-sort-colors
0075-sort-colors
0076-minimum-window-substring
0076-minimum-window-substring
0079-word-search
0079-word-search
0084-largest-rectangle-in-histogram
0084-largest-rectangle-in-histogram
0085-maximal-rectangle
0085-maximal-rectangle
0088-merge-sorted-array
0088-merge-sorted-array
0098-validate-binary-search-tree
0098-validate-binary-search-tree
0100-same-tree
0100-same-tree
0101-symmetric-tree
0101-symmetric-tree
0102-binary-tree-level-order-traversal
0102-binary-tree-level-order-traversal
0103-binary-tree-zigzag-level-order-traversal
0103-binary-tree-zigzag-level-order-traversal
0104-maximum-depth-of-binary-tree
0104-maximum-depth-of-binary-tree
0105-construct-binary-tree-from-preorder-and-inorder-traversal
0105-construct-binary-tree-from-preorder-and-inorder-traversal
0106-construct-binary-tree-from-inorder-and-postorder-traversal
0106-construct-binary-tree-from-inorder-and-postorder-traversal
0110-balanced-binary-tree
0110-balanced-binary-tree
0112-path-sum
0112-path-sum
0113-path-sum-ii
0113-path-sum-ii
0118-pascals-triangle
0118-pascals-triangle
0119-pascals-triangle-ii
0119-pascals-triangle-ii
0121-best-time-to-buy-and-sell-stock
0121-best-time-to-buy-and-sell-stock
0128-longest-consecutive-sequence
0128-longest-consecutive-sequence
0129-sum-root-to-leaf-numbers
0129-sum-root-to-leaf-numbers
0134-gas-station
0134-gas-station
0138-copy-list-with-random-pointer
0138-copy-list-with-random-pointer
0141-linked-list-cycle
0141-linked-list-cycle
0143-reorder-list
0143-reorder-list
0148-sort-list
0148-sort-list
0155-min-stack
0155-min-stack
0160-intersection-of-two-linked-lists
0160-intersection-of-two-linked-lists
0167-two-sum-ii-input-array-is-sorted
0167-two-sum-ii-input-array-is-sorted
0169-majority-element
0169-majority-element
0179-largest-number
0179-largest-number
0189-rotate-array
0189-rotate-array
0198-house-robber
0198-house-robber
0199-binary-tree-right-side-view
0199-binary-tree-right-side-view
0200-number-of-islands
0200-number-of-islands
0201-bitwise-and-of-numbers-range
0201-bitwise-and-of-numbers-range
0204-count-primes
0204-count-primes
0205-isomorphic-strings
0205-isomorphic-strings
0206-reverse-linked-list
0206-reverse-linked-list
0209-minimum-size-subarray-sum
0209-minimum-size-subarray-sum
0215-kth-largest-element-in-an-array
0215-kth-largest-element-in-an-array
0222-count-complete-tree-nodes
0222-count-complete-tree-nodes
0225-implement-stack-using-queues
0225-implement-stack-using-queues
0230-kth-smallest-element-in-a-bst
0230-kth-smallest-element-in-a-bst
0231-power-of-two
0231-power-of-two
0232-implement-queue-using-stacks
0232-implement-queue-using-stacks
0234-palindrome-linked-list
0234-palindrome-linked-list
0235-lowest-common-ancestor-of-a-binary-search-tree
0235-lowest-common-ancestor-of-a-binary-search-tree
0236-lowest-common-ancestor-of-a-binary-tree
0236-lowest-common-ancestor-of-a-binary-tree
0237-delete-node-in-a-linked-list
0237-delete-node-in-a-linked-list
0238-product-of-array-except-self
0238-product-of-array-except-self
0239-sliding-window-maximum
0239-sliding-window-maximum
0242-valid-anagram
0242-valid-anagram
0257-binary-tree-paths
0257-binary-tree-paths
0268-missing-number
0268-missing-number
0273-integer-to-english-words
0273-integer-to-english-words
0279-perfect-squares
0279-perfect-squares
0283-move-zeroes
0283-move-zeroes
0287-find-the-duplicate-number
0287-find-the-duplicate-number
0300-longest-increasing-subsequence
0300-longest-increasing-subsequence
0310-minimum-height-trees
0310-minimum-height-trees
0326-power-of-three
0326-power-of-three
View all files
Repository files navigation
README
More
items
Leet-Code
Collection of LeetCode questions to ace the coding interview!
About
Collection of LeetCode questions to ace the coding interview!
Resources
Readme
Activity
Stars
0
stars
Watchers
2
watching
Forks
0
forks
Report repository
Releases
Packages
Contributors
Languages
You can’t perform that action at this time.