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 }}
Shodydosh
/
Leetcode-Solutions
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
Folders and files
Name
Name
Last commit message
Last commit date
Latest commit
History
388 Commits
388 Commits
00000-StudyPlan-Algorithm
00000-StudyPlan-Algorithm
00000-StudyPlan-ProgrammingSkills
00000-StudyPlan-ProgrammingSkills
0038-count-and-say
0038-count-and-say
0409-longest-palindrome
0409-longest-palindrome
1030-matrix-cells-in-distance-order
1030-matrix-cells-in-distance-order
1175-prime-arrangements
1175-prime-arrangements
121-best-time-to-buy-and-sell-stock
121-best-time-to-buy-and-sell-stock
1221-split-a-string-in-balanced-strings
1221-split-a-string-in-balanced-strings
1252-cells-with-odd-values-in-a-matrix
1252-cells-with-odd-values-in-a-matrix
1277-count-square-submatrices-with-all-ones
1277-count-square-submatrices-with-all-ones
1317-convert-integer-to-the-sum-of-two-no-zero-integers
1317-convert-integer-to-the-sum-of-two-no-zero-integers
14-longest-common-prefix
14-longest-common-prefix
15-3sum
15-3sum
1523-count-odd-numbers-in-an-interval-range
1523-count-odd-numbers-in-an-interval-range
1646-get-maximum-in-generated-array
1646-get-maximum-in-generated-array
1827-minimum-operations-to-make-the-array-increasing
1827-minimum-operations-to-make-the-array-increasing
1884-egg-drop-with-2-eggs-and-n-floors
1884-egg-drop-with-2-eggs-and-n-floors
338-counting-bits
338-counting-bits
342-power-of-four
342-power-of-four
392-is-subsequence
392-is-subsequence
396-rotate-function
396-rotate-function
415-add-strings
415-add-strings
504-base-7
504-base-7
507-perfect-number
507-perfect-number
561-array-partition
561-array-partition
628-maximum-product-of-three-numbers
628-maximum-product-of-three-numbers
647-palindromic-substrings
647-palindromic-substrings
746-min-cost-climbing-stairs
746-min-cost-climbing-stairs
Stack
Stack
Studyplan-Algorithm
Studyplan-Algorithm
1-two-sum.java
1-two-sum.java
101-symmetric-tree.cpp
101-symmetric-tree.cpp
102-binary-tree-level-order-traversal.cpp
102-binary-tree-level-order-traversal.cpp
104-maximum-depth-of-binary-tree.cpp
104-maximum-depth-of-binary-tree.cpp
109-convert-sorted-list-to-binary-search-tree.cpp
109-convert-sorted-list-to-binary-search-tree.cpp
112-path-sum.cpp
112-path-sum.cpp
1137-n-th-tribonacci-numbe.cpp
1137-n-th-tribonacci-numbe.cpp
1143-longest-common-subsequence.cpp
1143-longest-common-subsequence.cpp
1143-longest-common-subsequence.py
1143-longest-common-subsequence.py
116-populating-next-right-pointers-in-each-node.cpp
116-populating-next-right-pointers-in-each-node.cpp
118-pascals-triangle.cpp
118-pascals-triangle.cpp
120-triangle.cpp
120-triangle.cpp
1232-check-if-it-is-a-straight-line.cpp
1232-check-if-it-is-a-straight-line.cpp
129-sum-root-to-leaf-numbers.cpp
129-sum-root-to-leaf-numbers.cpp
1290-convert-binary-number-in-a-linked-list-to-integer.cpp
1290-convert-binary-number-in-a-linked-list-to-integer.cpp
1302-deepest-leaves-sum.cpp
1302-deepest-leaves-sum.cpp
1309-decrypt-string-from-alphabet-to-integer-mapping.cpp
1309-decrypt-string-from-alphabet-to-integer-mapping.cpp
1319-number-of-operations-to-make-network-connected.cpp
1319-number-of-operations-to-make-network-connected.cpp
1329-sort-the-matrix-diagonally.cpp
1329-sort-the-matrix-diagonally.cpp
1337-the-k-weakest-rows-in-a-matrix.cpp
1337-the-k-weakest-rows-in-a-matrix.cpp
1337-the-k-weakest-rows-in-a-matrix.py
1337-the-k-weakest-rows-in-a-matrix.py
1345-jump-game-iv.cpp
1345-jump-game-iv.cpp
1346-check-if-n-and-its-double-exist.cpp
1346-check-if-n-and-its-double-exist.cpp
1346-check-if-n-and-its-double-exist.py
1346-check-if-n-and-its-double-exist.py
1351-count-negative-numbers-in-a-sorted-matrix.cpp
1351-count-negative-numbers-in-a-sorted-matrix.cpp
1356-sort-integers-by-the-number-of-1-bits.cpp
1356-sort-integers-by-the-number-of-1-bits.cpp
136-single-number.cpp
136-single-number.cpp
1385-find-the-distance-value-between-two-arrays.cpp
1385-find-the-distance-value-between-two-arrays.cpp
1402-reducing-dishes.cpp
1402-reducing-dishes.cpp
142-linked-list-cycle-ii.cpp
142-linked-list-cycle-ii.cpp
1431-kids-with-the-greatest-number-of-candies.cpp
1431-kids-with-the-greatest-number-of-candies.cpp
144-binary-tree-preorder-traversal.cpp
144-binary-tree-preorder-traversal.cpp
145-binary-tree-postorder-traversal.cpp
145-binary-tree-postorder-traversal.cpp
1466-reorder-routes-to-make-all-paths-lead-to-the-city-zero.cpp
1466-reorder-routes-to-make-all-paths-lead-to-the-city-zero.cpp
1472-design-browser-history.cpp
1472-design-browser-history.cpp
150-evaluate-reverse-polish-notation.cpp
150-evaluate-reverse-polish-notation.cpp
150-evaluate-reverse-polish-notation.py
150-evaluate-reverse-polish-notation.py
1502-can-make-arithmetic-progression-from-sequence.cpp
1502-can-make-arithmetic-progression-from-sequence.cpp
153-find-minimum-in-rotated-sorted-array.cpp
153-find-minimum-in-rotated-sorted-array.cpp
153-find-minimum-in-rotated-sorted-array.py
153-find-minimum-in-rotated-sorted-array.py
1572-matrix-diagonal-sum.cpp
1572-matrix-diagonal-sum.cpp
1588-sum-of-all-odd-length-subarrays.cpp
1588-sum-of-all-odd-length-subarrays.cpp
1603-design-parking-system.cpp
1603-design-parking-system.cpp
1608-special-array-with-x-elements-greater-than-or-equal-x.cpp
1608-special-array-with-x-elements-greater-than-or-equal-x.cpp
167-two-sum-ii-input-array-is-sorted.cpp
167-two-sum-ii-input-array-is-sorted.cpp
1672-richest-customer-wealth.cpp
1672-richest-customer-wealth.cpp
1678-goal-parser-interpretation.cpp
1678-goal-parser-interpretation.cpp
1768-merge-strings-alternately.cpp
1768-merge-strings-alternately.cpp
1779-find-nearest-point-that-has-the-same-x-or-y-coordinate.cpp
1779-find-nearest-point-that-has-the-same-x-or-y-coordinate.cpp
1790-check-if-one-string-swap-can-make-strings-equal.cpp
1790-check-if-one-string-swap-can-make-strings-equal.cpp
1822-sign-of-the-product-of-an-array.cpp
1822-sign-of-the-product-of-an-array.cpp
19-remove-nth-node-from-end-of-list.cpp
19-remove-nth-node-from-end-of-list.cpp
190-reverse-bits.cpp
190-reverse-bits.cpp
198-house-robber.cpp
198-house-robber.cpp
1987-number-of-unique-good-subsequences.cpp
1987-number-of-unique-good-subsequences.cpp
200-number-of-islands.cpp
200-number-of-islands.cpp
202-happy-number.cpp
202-happy-number.cpp
205-isomorphic-strings.cpp
205-isomorphic-strings.cpp
208-implement-trie-prefix-tree.cpp
208-implement-trie-prefix-tree.cpp
211-design-add-and-search-words-data-structure.cpp
211-design-add-and-search-words-data-structure.cpp
213-house-robber-ii.cpp
213-house-robber-ii.cpp
217-contains-duplicate.cpp
217-contains-duplicate.cpp
2187-minimum-time-to-complete-trips.cpp
2187-minimum-time-to-complete-trips.cpp
22-generate-parentheses.cpp
22-generate-parentheses.cpp
222-count-complete-tree-nodes.cpp
222-count-complete-tree-nodes.cpp
2236-root-equals-sum-of-children.cpp
2236-root-equals-sum-of-children.cpp
226-invert-binary-tree.cpp
226-invert-binary-tree.cpp
2265-count-nodes-equal-to-average-of-subtree.cpp
2265-count-nodes-equal-to-average-of-subtree.cpp
23-merge-k-sorted-lists.cpp
23-merge-k-sorted-lists.cpp
231-power-of-two.cpp
231-power-of-two.cpp
View all files
Repository files navigation
README
More
items
Leetcode solutions
"Wh0"
shodydosh@gmail.com
https://leetcode.com/Shodydosh/
About
This compilation encompasses all of the Leetcode problems that I have solved thus far.
Topics
backtracking
binary-tree
bit-manipulation
breadth-first-search
cpp
depth-first-search
dynamic-programming
greedy
hash-table
javascript
leetcode
leetcode-solutions
linked-list
math
python
sorting
stack
tree
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.