Leetcode Java Solutions

In this repository, you'll find Java solutions to LeetCode problems. Each solution is implemented in a separate Java file with a descriptive filename corresponding to the problem's name or number.

Usage

You can browse the solutions directly in the repository or clone it to your local machine to explore and test the solutions locally. Feel free to use these solutions as a reference while practicing for technical interviews or improving your problem-solving skills on LeetCode.

License

This repository is licensed under the MIT License. Feel free to use the code provided here for your own personal or educational purposes.

Name		Name	Last commit message	Last commit date
Latest commit History 1,767 Commits
1-two-sum		1-two-sum
10-regular-expression-matching		10-regular-expression-matching
100-same-tree		100-same-tree
101-symmetric-tree		101-symmetric-tree
1013-fibonacci-number		1013-fibonacci-number
1019-squares-of-a-sorted-array		1019-squares-of-a-sorted-array
102-binary-tree-level-order-traversal		102-binary-tree-level-order-traversal
1023-time-based-key-value-store		1023-time-based-key-value-store
1025-minimum-cost-for-tickets		1025-minimum-cost-for-tickets
103-binary-tree-zigzag-level-order-traversal		103-binary-tree-zigzag-level-order-traversal
1034-subarrays-with-k-different-integers		1034-subarrays-with-k-different-integers
1036-rotting-oranges		1036-rotting-oranges
1039-find-the-town-judge		1039-find-the-town-judge
104-maximum-depth-of-binary-tree		104-maximum-depth-of-binary-tree
1044-find-common-characters		1044-find-common-characters
1046-max-consecutive-ones-iii		1046-max-consecutive-ones-iii
105-construct-binary-tree-from-preorder-and-inorder-traversal		105-construct-binary-tree-from-preorder-and-inorder-traversal
1050-construct-binary-search-tree-from-preorder-traversal		1050-construct-binary-search-tree-from-preorder-traversal
1056-capacity-to-ship-packages-within-d-days		1056-capacity-to-ship-packages-within-d-days
106-construct-binary-tree-from-inorder-and-postorder-traversal		106-construct-binary-tree-from-inorder-and-postorder-traversal
1073-number-of-enclaves		1073-number-of-enclaves
108-convert-sorted-array-to-binary-search-tree		108-convert-sorted-array-to-binary-search-tree
109-convert-sorted-list-to-binary-search-tree		109-convert-sorted-list-to-binary-search-tree
11-container-with-most-water		11-container-with-most-water
110-balanced-binary-tree		110-balanced-binary-tree
111-minimum-depth-of-binary-tree		111-minimum-depth-of-binary-tree
1116-maximum-level-sum-of-a-binary-tree		1116-maximum-level-sum-of-a-binary-tree
112-path-sum		112-path-sum
1129-longest-string-chain		1129-longest-string-chain
1137-height-checker		1137-height-checker
114-flatten-binary-tree-to-linked-list		114-flatten-binary-tree-to-linked-list
1146-greatest-common-divisor-of-strings		1146-greatest-common-divisor-of-strings
115-distinct-subsequences		115-distinct-subsequences
1153-product-sales-analysis-i		1153-product-sales-analysis-i
117-populating-next-right-pointers-in-each-node-ii		117-populating-next-right-pointers-in-each-node-ii
1170-shortest-common-supersequence		1170-shortest-common-supersequence
1171-shortest-path-in-binary-matrix		1171-shortest-path-in-binary-matrix
118-pascals-triangle		118-pascals-triangle
119-pascals-triangle-ii		119-pascals-triangle-ii
1196-filling-bookcase-shelves		1196-filling-bookcase-shelves
12-integer-to-roman		12-integer-to-roman
120-triangle		120-triangle
121-best-time-to-buy-and-sell-stock		121-best-time-to-buy-and-sell-stock
1217-relative-sort-array		1217-relative-sort-array
122-best-time-to-buy-and-sell-stock-ii		122-best-time-to-buy-and-sell-stock-ii
123-best-time-to-buy-and-sell-stock-iii		123-best-time-to-buy-and-sell-stock-iii
1231-replace-elements-with-greatest-element-on-right-side		1231-replace-elements-with-greatest-element-on-right-side
1236-n-th-tribonacci-number		1236-n-th-tribonacci-number
124-binary-tree-maximum-path-sum		124-binary-tree-maximum-path-sum
1240-stone-game-ii		1240-stone-game-ii
125-valid-palindrome		125-valid-palindrome
1250-longest-common-subsequence		1250-longest-common-subsequence
1258-article-views-i		1258-article-views-i
127-word-ladder		127-word-ladder
128-longest-consecutive-sequence		128-longest-consecutive-sequence
129-sum-root-to-leaf-numbers		129-sum-root-to-leaf-numbers
13-roman-to-integer		13-roman-to-integer
130-surrounded-regions		130-surrounded-regions
1302-delete-characters-to-make-fancy-string		1302-delete-characters-to-make-fancy-string
1319-unique-number-of-occurrences		1319-unique-number-of-occurrences
1325-path-with-maximum-probability		1325-path-with-maximum-probability
134-gas-station		134-gas-station
135-candy		135-candy
136-single-number		136-single-number
1364-tuple-with-same-product		1364-tuple-with-same-product
137-single-number-ii		137-single-number-ii
1370-count-number-of-nice-subarrays		1370-count-number-of-nice-subarrays
139-word-break		139-word-break
1390-average-selling-price		1390-average-selling-price
1392-find-the-difference-of-two-arrays		1392-find-the-difference-of-two-arrays
1396-count-servers-that-communicate		1396-count-servers-that-communicate
1397-search-suggestions-system		1397-search-suggestions-system
14-longest-common-prefix		14-longest-common-prefix
1408-find-the-smallest-divisor-given-a-threshold		1408-find-the-smallest-divisor-given-a-threshold
141-linked-list-cycle		141-linked-list-cycle
1415-students-and-examinations		1415-students-and-examinations
142-linked-list-cycle-ii		142-linked-list-cycle-ii
1437-minimum-insertion-steps-to-make-a-string-palindrome		1437-minimum-insertion-steps-to-make-a-string-palindrome
144-binary-tree-preorder-traversal		144-binary-tree-preorder-traversal
1442-number-of-operations-to-make-network-connected		1442-number-of-operations-to-make-network-connected
145-binary-tree-postorder-traversal		145-binary-tree-postorder-traversal
1456-find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance		1456-find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance
1460-number-of-substrings-containing-all-three-characters		1460-number-of-substrings-containing-all-three-characters
1474-longest-zigzag-path-in-a-binary-tree		1474-longest-zigzag-path-in-a-binary-tree
1478-maximum-number-of-events-that-can-be-attended		1478-maximum-number-of-events-that-can-be-attended
1482-how-many-numbers-are-smaller-than-the-current-number		1482-how-many-numbers-are-smaller-than-the-current-number
1485-minimum-cost-to-make-at-least-one-valid-path-in-a-grid		1485-minimum-cost-to-make-at-least-one-valid-path-in-a-grid
15-3sum		15-3sum
1502-construct-k-palindrome-strings		1502-construct-k-palindrome-strings
1509-replace-employee-id-with-the-unique-identifier		1509-replace-employee-id-with-the-unique-identifier
151-reverse-words-in-a-string		151-reverse-words-in-a-string
1510-find-lucky-integer-in-an-array		1510-find-lucky-integer-in-an-array
1511-count-number-of-teams		1511-count-number-of-teams
152-maximum-product-subarray		152-maximum-product-subarray
1524-string-matching-in-an-array		1524-string-matching-in-an-array
1528-kids-with-the-greatest-number-of-candies		1528-kids-with-the-greatest-number-of-candies
153-find-minimum-in-rotated-sorted-array		153-find-minimum-in-rotated-sorted-array
1537-maximum-score-after-splitting-a-string		1537-maximum-score-after-splitting-a-string
1538-maximum-points-you-can-obtain-from-cards		1538-maximum-points-you-can-obtain-from-cards
1544-count-good-nodes-in-binary-tree		1544-count-good-nodes-in-binary-tree

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

Uh oh!

Repository files navigation

Leetcode Java Solutions

Usage

License

About

Uh oh!

Releases

Packages

Languages

ushasri3110/LeetcodeSolutions

Folders and files

Latest commit

History

Repository files navigation

Leetcode Java Solutions

Usage

License

About

Resources

Uh oh!

Stars

Watchers

Forks

Releases

Packages 0

Languages

Packages