Skip to content
Navigation Menu
Sign in
Products
Platform
GitHub
Repository hosting, code review, and collaboration
Copilot
AI coding agent for tasks, projects and automated work
Build & Ship
Actions
CI/CD and automation
Code Quality
Quality analysis, fixes, and enforcement
Codespaces
Cloud development environments
Secure
Code Security
Vulnerability detection and remediation
Secret Protection
Secret scanning and leak prevention
All Features
Developers
Learn
Documentation
Training
Certifications
Build
Build with Copilot
Customize Copilot
Integrations
Explore
Trending repos
GitHub Sponsors
Events
Changelog
Changelog
Your source for the latest features, improvements, and fixes across GitHub products, all in one place.
Businesses
By Stage
Enterprises
Team
Startups
Nonprofits
By Industry
Healthcare
Financial services
Manufacturing
Government
See all industries
Evaluate GitHub
Why GitHub
Customer Stories
Business insights
Trust Center
Add-ons
GitHub Advanced Security
Enterprise-grade code security
Copilot for business
Enterprise-grade AI features
Premium Support
Enterprise-grade 24/7 support
Resources
Learn & Connect
Documentation
Resource center
Blog
Events & webinars
Community Forum
Customer Stories
Integrations
Support
Customer support
Training
GitHub Status
Company
About
Partners
Changelog
GitHub Universe
GitHub Universe
The event for developers, by developers — talks, workshops, and what’s next for GitHub.
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 }}
tarunkukreja003
Leetcode-Solutions
Repository navigation
Code
Issues
Pull requests
Actions
Projects
Security and quality
Insights
More
items
Leetcode-Solutions
Public
Notifications
You must be signed in to change notification settings
Fork
0
(
0
)
Star
0
(
0
)
You must be signed in to star a repository
About
This repository contains solutions to certain Leetcode problems
Activity
Stars
0
stars
Watchers
1
watching
Forks
0
forks
Report repository
master
Branches
Tags
Go to file
Code
Open more actions menu
Latest commit
History
393 Commits
393 Commits
Folders and files
Name
Name
Last commit message
Last commit date
0200-number-of-islands
0200-number-of-islands
0226-invert-binary-tree
0226-invert-binary-tree
0994-rotting-oranges
0994-rotting-oranges
1-two-sum
1-two-sum
10-regular-expression-matching
10-regular-expression-matching
100-same-tree
100-same-tree
1004-max-consecutive-ones-iii
1004-max-consecutive-ones-iii
101-symmetric-tree
101-symmetric-tree
104-maximum-depth-of-binary-tree
104-maximum-depth-of-binary-tree
1047-remove-all-adjacent-duplicates-in-string
1047-remove-all-adjacent-duplicates-in-string
110-balanced-binary-tree
110-balanced-binary-tree
111-minimum-depth-of-binary-tree
111-minimum-depth-of-binary-tree
112-path-sum
112-path-sum
1143-longest-common-subsequence
1143-longest-common-subsequence
1275-find-winner-on-a-tic-tac-toe-game
1275-find-winner-on-a-tic-tac-toe-game
129-sum-root-to-leaf-numbers
129-sum-root-to-leaf-numbers
13-roman-to-integer
13-roman-to-integer
1382-balance-a-binary-search-tree
1382-balance-a-binary-search-tree
150-evaluate-reverse-polish-notation
150-evaluate-reverse-polish-notation
155-min-stack
155-min-stack
1644-lowest-common-ancestor-of-a-binary-tree-ii
1644-lowest-common-ancestor-of-a-binary-tree-ii
1700-number-of-students-unable-to-eat-lunch
1700-number-of-students-unable-to-eat-lunch
1770-maximum-score-from-performing-multiplication-operations
1770-maximum-score-from-performing-multiplication-operations
1823-find-the-winner-of-the-circular-game
1823-find-the-winner-of-the-circular-game
1834-single-threaded-cpu
1834-single-threaded-cpu
199-binary-tree-right-side-view
199-binary-tree-right-side-view
2007-find-original-array-from-doubled-array
2007-find-original-array-from-doubled-array
2013-detect-squares
2013-detect-squares
2034-stock-price-fluctuation
2034-stock-price-fluctuation
2073-time-needed-to-buy-tickets
2073-time-needed-to-buy-tickets
2096-step-by-step-directions-from-a-binary-tree-node-to-another
2096-step-by-step-directions-from-a-binary-tree-node-to-another
219-contains-duplicate-ii
219-contains-duplicate-ii
221-maximal-square
221-maximal-square
225-implement-stack-using-queues
225-implement-stack-using-queues
226-invert-binary-tree
226-invert-binary-tree
2269-find-the-k-beauty-of-a-number
2269-find-the-k-beauty-of-a-number
232-implement-queue-using-stacks
232-implement-queue-using-stacks
236-lowest-common-ancestor-of-a-binary-tree
236-lowest-common-ancestor-of-a-binary-tree
28-implement-strstr
28-implement-strstr
316-remove-duplicate-letters
316-remove-duplicate-letters
384-shuffle-an-array
384-shuffle-an-array
3sum
3sum
412-fizz-buzz
412-fizz-buzz
415-add-strings
415-add-strings
44-wildcard-matching
44-wildcard-matching
459-repeated-substring-pattern
459-repeated-substring-pattern
495-teemo-attacking
495-teemo-attacking
5-longest-palindromic-substring
5-longest-palindromic-substring
516-longest-palindromic-subsequence
516-longest-palindromic-subsequence
523-continuous-subarray-sum
523-continuous-subarray-sum
528-random-pick-with-weight
528-random-pick-with-weight
543-diameter-of-binary-tree
543-diameter-of-binary-tree
56-merge-intervals
56-merge-intervals
560-subarray-sum-equals-k
560-subarray-sum-equals-k
572-subtree-of-another-tree
572-subtree-of-another-tree
670-maximum-swap
670-maximum-swap
680-valid-palindrome-ii
680-valid-palindrome-ii
791-custom-sort-string
791-custom-sort-string
796-rotate-string
796-rotate-string
833-find-and-replace-in-string
833-find-and-replace-in-string
863-all-nodes-distance-k-in-binary-tree
863-all-nodes-distance-k-in-binary-tree
921-minimum-add-to-make-parentheses-valid
921-minimum-add-to-make-parentheses-valid
94-binary-tree-inorder-traversal
94-binary-tree-inorder-traversal
942-di-string-match
942-di-string-match
954-array-of-doubled-pairs
954-array-of-doubled-pairs
994-rotting-oranges
994-rotting-oranges
add-binary
add-binary
add-two-numbers
add-two-numbers
backspace-string-compare
backspace-string-compare
best-time-to-buy-and-sell-stock
best-time-to-buy-and-sell-stock
binary-search-tree-iterator
binary-search-tree-iterator
binary-tree-inorder-traversal
binary-tree-inorder-traversal
binary-tree-right-side-view
binary-tree-right-side-view
convert-sorted-array-to-binary-search-tree
convert-sorted-array-to-binary-search-tree
count-good-nodes-in-binary-tree
count-good-nodes-in-binary-tree
delete-node-in-a-bst
delete-node-in-a-bst
diameter-of-binary-tree
diameter-of-binary-tree
employee-importance
employee-importance
find-minimum-in-rotated-sorted-array
find-minimum-in-rotated-sorted-array
first-unique-character-in-a-string
first-unique-character-in-a-string
flatten-nested-list-iterator
flatten-nested-list-iterator
house-robber
house-robber
implement-queue-using-stacks
implement-queue-using-stacks
implement-stack-using-queues
implement-stack-using-queues
insert-into-a-binary-search-tree
insert-into-a-binary-search-tree
intersection-of-two-arrays-ii
intersection-of-two-arrays-ii
intersection-of-two-arrays
intersection-of-two-arrays
invert-binary-tree
invert-binary-tree
k-closest-points-to-origin
k-closest-points-to-origin
keyboard-row
keyboard-row
kth-largest-element-in-a-stream
kth-largest-element-in-a-stream
kth-largest-element-in-an-array
kth-largest-element-in-an-array
kth-smallest-element-in-a-bst
kth-smallest-element-in-a-bst
last-stone-weight
last-stone-weight
length-of-last-word
length-of-last-word
longest-common-prefix
longest-common-prefix
lowest-common-ancestor-of-a-binary-search-tree
lowest-common-ancestor-of-a-binary-search-tree
lowest-common-ancestor-of-a-binary-tree
lowest-common-ancestor-of-a-binary-tree
max-area-of-island
max-area-of-island
maximum-depth-of-binary-tree
maximum-depth-of-binary-tree
View all files
About
This repository contains solutions to certain Leetcode problems
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.