LeetCode-Solutions

Collection of LeetCode questions to ace the coding interview! - Created using LeetHub

Name		Name	Last commit message	Last commit date
Latest commit History 529 Commits
0204-count-primes		0204-count-primes
1-two-sum		1-two-sum
100-same-tree		100-same-tree
1001-grid-illumination		1001-grid-illumination
1004-max-consecutive-ones-iii		1004-max-consecutive-ones-iii
1008-construct-binary-search-tree-from-preorder-traversal		1008-construct-binary-search-tree-from-preorder-traversal
101-symmetric-tree		101-symmetric-tree
102-binary-tree-level-order-traversal		102-binary-tree-level-order-traversal
103-binary-tree-zigzag-level-order-traversal		103-binary-tree-zigzag-level-order-traversal
104-maximum-depth-of-binary-tree		104-maximum-depth-of-binary-tree
105-construct-binary-tree-from-preorder-and-inorder-traversal		105-construct-binary-tree-from-preorder-and-inorder-traversal
106-construct-binary-tree-from-inorder-and-postorder-traversal		106-construct-binary-tree-from-inorder-and-postorder-traversal
107-binary-tree-level-order-traversal-ii		107-binary-tree-level-order-traversal-ii
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
1094-car-pooling		1094-car-pooling
11-container-with-most-water		11-container-with-most-water
110-balanced-binary-tree		110-balanced-binary-tree
114-flatten-binary-tree-to-linked-list		114-flatten-binary-tree-to-linked-list
1143-longest-common-subsequence		1143-longest-common-subsequence
116-populating-next-right-pointers-in-each-node		116-populating-next-right-pointers-in-each-node
121-best-time-to-buy-and-sell-stock		121-best-time-to-buy-and-sell-stock
122-best-time-to-buy-and-sell-stock-ii		122-best-time-to-buy-and-sell-stock-ii
1220-count-vowels-permutation		1220-count-vowels-permutation
124-binary-tree-maximum-path-sum		124-binary-tree-maximum-path-sum
1266-minimum-time-visiting-all-points		1266-minimum-time-visiting-all-points
1278-palindrome-partitioning-iii		1278-palindrome-partitioning-iii
131-palindrome-partitioning		131-palindrome-partitioning
132-palindrome-partitioning-ii		132-palindrome-partitioning-ii
1326-minimum-number-of-taps-to-open-to-water-a-garden		1326-minimum-number-of-taps-to-open-to-water-a-garden
1331-rank-transform-of-an-array		1331-rank-transform-of-an-array
1338-reduce-array-size-to-the-half		1338-reduce-array-size-to-the-half
136-single-number		136-single-number
1368-minimum-cost-to-make-at-least-one-valid-path-in-a-grid		1368-minimum-cost-to-make-at-least-one-valid-path-in-a-grid
1373-maximum-sum-bst-in-binary-tree		1373-maximum-sum-bst-in-binary-tree
138-copy-list-with-random-pointer		138-copy-list-with-random-pointer
1392-longest-happy-prefix		1392-longest-happy-prefix
141-linked-list-cycle		141-linked-list-cycle
142-linked-list-cycle-ii		142-linked-list-cycle-ii
1423-maximum-points-you-can-obtain-from-cards		1423-maximum-points-you-can-obtain-from-cards
144-binary-tree-preorder-traversal		144-binary-tree-preorder-traversal
1448-count-good-nodes-in-binary-tree		1448-count-good-nodes-in-binary-tree
146-lru-cache		146-lru-cache
1477-find-two-non-overlapping-sub-arrays-each-with-target-sum		1477-find-two-non-overlapping-sub-arrays-each-with-target-sum
1480-running-sum-of-1d-array		1480-running-sum-of-1d-array
15-3sum		15-3sum
1512-number-of-good-pairs		1512-number-of-good-pairs
152-maximum-product-subarray		152-maximum-product-subarray
153-find-minimum-in-rotated-sorted-array		153-find-minimum-in-rotated-sorted-array
1547-minimum-cost-to-cut-a-stick		1547-minimum-cost-to-cut-a-stick
1551-minimum-operations-to-make-array-equal		1551-minimum-operations-to-make-array-equal
16-3sum-closest		16-3sum-closest
1626-best-team-with-no-conflicts		1626-best-team-with-no-conflicts
1689-partitioning-into-minimum-number-of-deci-binary-numbers		1689-partitioning-into-minimum-number-of-deci-binary-numbers
1695-maximum-erasure-value		1695-maximum-erasure-value
172-factorial-trailing-zeroes		172-factorial-trailing-zeroes
1745-palindrome-partitioning-iv		1745-palindrome-partitioning-iv
1770-maximum-score-from-performing-multiplication-operations		1770-maximum-score-from-performing-multiplication-operations
19-remove-nth-node-from-end-of-list		19-remove-nth-node-from-end-of-list
1909-remove-one-element-to-make-the-array-strictly-increasing		1909-remove-one-element-to-make-the-array-strictly-increasing
200-number-of-islands		200-number-of-islands
203-remove-linked-list-elements		203-remove-linked-list-elements
206-reverse-linked-list		206-reverse-linked-list
2095-delete-the-middle-node-of-a-linked-list		2095-delete-the-middle-node-of-a-linked-list
21-merge-two-sorted-lists		21-merge-two-sorted-lists
2101-detonate-the-maximum-bombs		2101-detonate-the-maximum-bombs
2125-number-of-laser-beams-in-a-bank		2125-number-of-laser-beams-in-a-bank
215-kth-largest-element-in-an-array		215-kth-largest-element-in-an-array
216-combination-sum-iii		216-combination-sum-iii
2167-minimum-time-to-remove-all-cars-containing-illegal-goods		2167-minimum-time-to-remove-all-cars-containing-illegal-goods
217-contains-duplicate		217-contains-duplicate
219-contains-duplicate-ii		219-contains-duplicate-ii
2192-all-ancestors-of-a-node-in-a-directed-acyclic-graph		2192-all-ancestors-of-a-node-in-a-directed-acyclic-graph
220-contains-duplicate-iii		220-contains-duplicate-iii
2217-find-palindrome-with-fixed-length		2217-find-palindrome-with-fixed-length
2223-sum-of-scores-of-built-strings		2223-sum-of-scores-of-built-strings
2289-steps-to-make-array-non-decreasing		2289-steps-to-make-array-non-decreasing
2359-find-closest-node-to-given-two-nodes		2359-find-closest-node-to-given-two-nodes
236-lowest-common-ancestor-of-a-binary-tree		236-lowest-common-ancestor-of-a-binary-tree
237-delete-node-in-a-linked-list		237-delete-node-in-a-linked-list
241-different-ways-to-add-parentheses		241-different-ways-to-add-parentheses
25-reverse-nodes-in-k-group		25-reverse-nodes-in-k-group
257-binary-tree-paths		257-binary-tree-paths
26-remove-duplicates-from-sorted-array		26-remove-duplicates-from-sorted-array
287-find-the-duplicate-number		287-find-the-duplicate-number
2873-prime-pairs-with-target-sum		2873-prime-pairs-with-target-sum
300-longest-increasing-subsequence		300-longest-increasing-subsequence
31-next-permutation		31-next-permutation
310-minimum-height-trees		310-minimum-height-trees
312-burst-balloons		312-burst-balloons
313-super-ugly-number		313-super-ugly-number
315-count-of-smaller-numbers-after-self		315-count-of-smaller-numbers-after-self
322-coin-change		322-coin-change
33-search-in-rotated-sorted-array		33-search-in-rotated-sorted-array
34-find-first-and-last-position-of-element-in-sorted-array		34-find-first-and-last-position-of-element-in-sorted-array
342-power-of-four		342-power-of-four
357-count-numbers-with-unique-digits		357-count-numbers-with-unique-digits
368-largest-divisible-subset		368-largest-divisible-subset
37-sudoku-solver		37-sudoku-solver
374-guess-number-higher-or-lower		374-guess-number-higher-or-lower

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

Repository files navigation

LeetCode-Solutions

About

Uh oh!

Releases

Packages

Uh oh!

Contributors

Uh oh!

Languages

Folders and files

Latest commit

History

Repository files navigation

LeetCode-Solutions

About

Resources

Uh oh!

Stars

Watchers

Forks

Releases

Packages 0

Uh oh!

Contributors

Uh oh!

Languages

Packages