GitHub - iam-sarthakdev/LeetCode: A curated collection of LeetCode solutions across Java, C++, Python, and SQL, featuring optimized approaches and interview-focused implementations.

Branches Tags

Name		Name	Last commit message	Last commit date
Latest commit History 4,865 Commits
0033-search-in-rotated-sorted-array		0033-search-in-rotated-sorted-array
0061-rotate-list		0061-rotate-list
1-two-sum		1-two-sum
10-regular-expression-matching		10-regular-expression-matching
100-same-tree		100-same-tree
1000-delete-columns-to-make-sorted-iii		1000-delete-columns-to-make-sorted-iii
1001-n-repeated-element-in-size-2n-array		1001-n-repeated-element-in-size-2n-array
101-symmetric-tree		101-symmetric-tree
1013-fibonacci-number		1013-fibonacci-number
1014-k-closest-points-to-origin		1014-k-closest-points-to-origin
1016-subarray-sums-divisible-by-k		1016-subarray-sums-divisible-by-k
1019-squares-of-a-sorted-array		1019-squares-of-a-sorted-array
102-binary-tree-level-order-traversal		102-binary-tree-level-order-traversal
1022-unique-paths-iii		1022-unique-paths-iii
1025-minimum-cost-for-tickets		1025-minimum-cost-for-tickets
1029-vertical-order-traversal-of-a-binary-tree		1029-vertical-order-traversal-of-a-binary-tree
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
104-maximum-depth-of-binary-tree		104-maximum-depth-of-binary-tree
1042-minimum-cost-to-merge-stones		1042-minimum-cost-to-merge-stones
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
1054-complement-of-base-10-integer		1054-complement-of-base-10-integer
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
1064-smallest-integer-divisible-by-k		1064-smallest-integer-divisible-by-k
1071-binary-prefix-divisible-by-5		1071-binary-prefix-divisible-by-5
1073-number-of-enclaves		1073-number-of-enclaves
1079-sum-of-root-to-leaf-binary-numbers		1079-sum-of-root-to-leaf-binary-numbers
108-convert-sorted-array-to-binary-search-tree		108-convert-sorted-array-to-binary-search-tree
1081-video-stitching		1081-video-stitching
109-convert-sorted-list-to-binary-search-tree		109-convert-sorted-list-to-binary-search-tree
1095-two-city-scheduling		1095-two-city-scheduling
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
1114-binary-search-tree-to-greater-sum-tree		1114-binary-search-tree-to-greater-sum-tree
1116-maximum-level-sum-of-a-binary-tree		1116-maximum-level-sum-of-a-binary-tree
1117-as-far-from-land-as-possible		1117-as-far-from-land-as-possible
112-path-sum		112-path-sum
1121-partition-array-for-maximum-sum		1121-partition-array-for-maximum-sum
1127-last-stone-weight		1127-last-stone-weight
1128-remove-all-adjacent-duplicates-in-string		1128-remove-all-adjacent-duplicates-in-string
1129-longest-string-chain		1129-longest-string-chain
113-path-sum-ii		113-path-sum-ii
1138-grumpy-bookstore-owner		1138-grumpy-bookstore-owner
114-flatten-binary-tree-to-linked-list		114-flatten-binary-tree-to-linked-list
115-distinct-subsequences		115-distinct-subsequences
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
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
1210-mean-of-array-after-removing-some-elements		1210-mean-of-array-after-removing-some-elements
122-best-time-to-buy-and-sell-stock-ii		122-best-time-to-buy-and-sell-stock-ii
1222-remove-covered-intervals		1222-remove-covered-intervals
123-best-time-to-buy-and-sell-stock-iii		123-best-time-to-buy-and-sell-stock-iii
1234-number-of-paths-with-max-score		1234-number-of-paths-with-max-score
124-binary-tree-maximum-path-sum		124-binary-tree-maximum-path-sum
125-valid-palindrome		125-valid-palindrome
1250-longest-common-subsequence		1250-longest-common-subsequence
1258-article-views-i		1258-article-views-i
126-word-ladder-ii		126-word-ladder-ii
127-word-ladder		127-word-ladder
128-longest-consecutive-sequence		128-longest-consecutive-sequence
1284-four-divisors		1284-four-divisors
1285-balance-a-binary-search-tree		1285-balance-a-binary-search-tree
1297-maximum-number-of-balloons		1297-maximum-number-of-balloons
13-roman-to-integer		13-roman-to-integer
130-surrounded-regions		130-surrounded-regions
1306-minimum-absolute-difference		1306-minimum-absolute-difference
131-palindrome-partitioning		131-palindrome-partitioning
132-palindrome-partitioning-ii		132-palindrome-partitioning-ii
133-clone-graph		133-clone-graph
134-gas-station		134-gas-station
135-candy		135-candy
136-single-number		136-single-number
137-single-number-ii		137-single-number-ii
1388-greatest-sum-divisible-by-three		1388-greatest-sum-divisible-by-three
139-word-break		139-word-break
1395-minimum-time-visiting-all-points		1395-minimum-time-visiting-all-points
14-longest-common-prefix		14-longest-common-prefix
140-word-break-ii		140-word-break-ii
1402-count-square-submatrices-with-all-ones		1402-count-square-submatrices-with-all-ones
141-linked-list-cycle		141-linked-list-cycle
1413-maximum-side-length-of-a-square-with-sum-less-than-or-equal-to-threshold		1413-maximum-side-length-of-a-square-with-sum-less-than-or-equal-to-threshold
142-linked-list-cycle-ii		142-linked-list-cycle-ii
1427-all-elements-in-two-binary-search-trees		1427-all-elements-in-two-binary-search-trees
1428-jump-game-iii		1428-jump-game-iii
143-reorder-list		143-reorder-list
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
1443-minimum-distance-to-type-a-word-using-two-fingers		1443-minimum-distance-to-type-a-word-using-two-fingers
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