Skip to content
Navigation Menu
Toggle navigation
Sign in
Product
GitHub Copilot
Write better code with AI
GitHub Advanced Security
Find and fix vulnerabilities
Actions
Automate any workflow
Codespaces
Instant dev environments
Issues
Plan and track work
Code Review
Manage code changes
Discussions
Collaborate outside of code
Code Search
Find more, search less
Explore
Why GitHub
All features
Documentation
GitHub Skills
Blog
Solutions
By company size
Enterprises
Small and medium teams
Startups
Nonprofits
By use case
DevSecOps
DevOps
CI/CD
View all use cases
By industry
Healthcare
Financial services
Manufacturing
Government
View all industries
View all solutions
Resources
Topics
AI
DevOps
Security
Software Development
View all
Explore
Learning Pathways
Events & Webinars
Ebooks & Whitepapers
Customer Stories
Partners
Executive Insights
Open Source
GitHub Sponsors
Fund open source developers
The ReadME Project
GitHub community articles
Repositories
Topics
Trending
Collections
Enterprise
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 or jump to...
Search code, repositories, users, issues, pull requests...
Search syntax tips
Provide feedback
Saved searches
Use saved searches to filter your results more quickly
Sign in
Sign up
Reseting focus
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 }}
codedecks-in
/
LeetCode-Solutions
Public
Notifications
You must be signed in to change notification settings
Fork
422
Star
850
Code
Issues
9
Pull requests
192
Discussions
Actions
Projects
0
Security
Insights
Additional navigation options
Code
Issues
Pull requests
Discussions
Actions
Projects
Security
Insights
Files
master
Breadcrumbs
LeetCode-Solutions
/
Java
/
Copy path
Directory actions
More options
Directory actions
More options
Latest commit
History
History
master
Breadcrumbs
LeetCode-Solutions
/
Java
/
Top
Folders and files
Name
Name
Last commit message
Last commit date
parent directory
..
June-LeetCoding-Challenge
June-LeetCoding-Challenge
May-LeetCoding-Challenge
May-LeetCoding-Challenge
Redundant-Connection
Redundant-Connection
20.ValidParentheses.java
20.ValidParentheses.java
Add-Two-Numbers.java
Add-Two-Numbers.java
All_Paths_From_Source_to_Target.java
All_Paths_From_Source_to_Target.java
Arithmetic-Subarrays.java
Arithmetic-Subarrays.java
Armstrong-Number.java
Armstrong-Number.java
Balanced-Binary-Tree.java
Balanced-Binary-Tree.java
BrokenCalculator.java
BrokenCalculator.java
Degree-of-an-Array.java
Degree-of-an-Array.java
Design-a-Stack-With-Increment-Operation.java
Design-a-Stack-With-Increment-Operation.java
FizzBuzz.java
FizzBuzz.java
Happy-Number.java
Happy-Number.java
LRU-Cache.java
LRU-Cache.java
Number-of-Good-Pairs.java
Number-of-Good-Pairs.java
NumberOfIslands.java
NumberOfIslands.java
PascalsTriangle118.java
PascalsTriangle118.java
Perm_Recus.java
Perm_Recus.java
Power-of-Three.java
Power-of-Three.java
Range-Sum-Query-Mutable.java
Range-Sum-Query-Mutable.java
Same-Tree.java
Same-Tree.java
Search-a-2d-matrix.java
Search-a-2d-matrix.java
SignOf.java
SignOf.java
Sum_of_two_integers.java
Sum_of_two_integers.java
Ugly-Number.java
Ugly-Number.java
WaterBottles.java
WaterBottles.java
binary-tree-inorder-traversal.java
binary-tree-inorder-traversal.java
binary-tree-postorder-traversal.java
binary-tree-postorder-traversal.java
binary-tree-preorder-traversal.java
binary-tree-preorder-traversal.java
buddy-strings.java
buddy-strings.java
can-make-arithmetic-progression-from-sequence.java
can-make-arithmetic-progression-from-sequence.java
climbing-stairs.java
climbing-stairs.java
complete-binary-tree-inserter.java
complete-binary-tree-inserter.java
convert-sorted-list-to-binary-search-tree.java
convert-sorted-list-to-binary-search-tree.java
crawler-log-folder-leetcode-1598.java
crawler-log-folder-leetcode-1598.java
design-circular-deque.java
design-circular-deque.java
detect-capital-use.java
detect-capital-use.java
evaluate_reverse_polish_notation.java
evaluate_reverse_polish_notation.java
first-unique-character-in-a-string.java
first-unique-character-in-a-string.java
generate-a-string-with-characters-that-have-odd-counts.java
generate-a-string-with-characters-that-have-odd-counts.java
graph_connectivity_with_threshold.java
graph_connectivity_with_threshold.java
integer-to-roman.java
integer-to-roman.java
intersection-of-two-linked-lists.java
intersection-of-two-linked-lists.java
linked-list-cycle-ii.java
linked-list-cycle-ii.java
linked-list-cycle.java
linked-list-cycle.java
matrix-diagonal-sum.java
matrix-diagonal-sum.java
max-nesting-depth-parentheses.java
max-nesting-depth-parentheses.java
median-of-two-sorted-arrays.java
median-of-two-sorted-arrays.java
middle-of-the-linked-list.java
middle-of-the-linked-list.java
missing-number.java
missing-number.java
number-complement.java
number-complement.java
palindrome-number.java
palindrome-number.java
path-sum.java
path-sum.java
path-with-minimum-effort.java
path-with-minimum-effort.java
ransom-note.java
ransom-note.java
remove-nth-node-from-end-of-list.java
remove-nth-node-from-end-of-list.java
reverse-integer.java
reverse-integer.java
reverse-words-in-a-string.java
reverse-words-in-a-string.java
roman-to-integer.java
roman-to-integer.java
running-sum-of-1d-array.java
running-sum-of-1d-array.java
set-matrix-zeroes.java
set-matrix-zeroes.java
shuffle-the-array.java
shuffle-the-array.java
single-number.java
single-number.java
string-to-integer-atoi.java
string-to-integer-atoi.java
sum-root-to-leaf-numbers.java
sum-root-to-leaf-numbers.java
symmetric-tree.java
symmetric-tree.java
two-sum.java
two-sum.java
valid-anagram.java
valid-anagram.java
valid-sudoku.java
valid-sudoku.java
word-ladder.java
word-ladder.java
xor-op-in-array.java
xor-op-in-array.java
View all files
You can’t perform that action at this time.