LeetCode

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

Name		Name	Last commit message	Last commit date
Latest commit History 1,076 Commits
0258-add-digits		0258-add-digits
0300-longest-increasing-subsequence		0300-longest-increasing-subsequence
0334-increasing-triplet-subsequence		0334-increasing-triplet-subsequence
0649-dota2-senate		0649-dota2-senate
0879-profitable-schemes		0879-profitable-schemes
1007-minimum-domino-rotations-for-equal-row		1007-minimum-domino-rotations-for-equal-row
1009-complement-of-base-10-integer		1009-complement-of-base-10-integer
102-binary-tree-level-order-traversal		102-binary-tree-level-order-traversal
1022-sum-of-root-to-leaf-binary-numbers		1022-sum-of-root-to-leaf-binary-numbers
1029-two-city-scheduling		1029-two-city-scheduling
104-maximum-depth-of-binary-tree		104-maximum-depth-of-binary-tree
1041-robot-bounded-in-circle		1041-robot-bounded-in-circle
1046-last-stone-weight		1046-last-stone-weight
1048-longest-string-chain		1048-longest-string-chain
105-construct-binary-tree-from-preorder-and-inorder-traversal		105-construct-binary-tree-from-preorder-and-inorder-traversal
1074-number-of-submatrices-that-sum-to-target		1074-number-of-submatrices-that-sum-to-target
108-convert-sorted-array-to-binary-search-tree		108-convert-sorted-array-to-binary-search-tree
1091-shortest-path-in-binary-matrix		1091-shortest-path-in-binary-matrix
1094-car-pooling		1094-car-pooling
11-container-with-most-water		11-container-with-most-water
110-balanced-binary-tree		110-balanced-binary-tree
112-path-sum		112-path-sum
1123-lowest-common-ancestor-of-deepest-leaves		1123-lowest-common-ancestor-of-deepest-leaves
114-flatten-binary-tree-to-linked-list		114-flatten-binary-tree-to-linked-list
117-populating-next-right-pointers-in-each-node-ii		117-populating-next-right-pointers-in-each-node-ii
118-pascals-triangle		118-pascals-triangle
1192-critical-connections-in-a-network		1192-critical-connections-in-a-network
120-triangle		120-triangle
121-best-time-to-buy-and-sell-stock		121-best-time-to-buy-and-sell-stock
1249-minimum-remove-to-make-valid-parentheses		1249-minimum-remove-to-make-valid-parentheses
1260-shift-2d-grid		1260-shift-2d-grid
1268-search-suggestions-system		1268-search-suggestions-system
127-word-ladder		127-word-ladder
128-longest-consecutive-sequence		128-longest-consecutive-sequence
1288-remove-covered-intervals		1288-remove-covered-intervals
1291-sequential-digits		1291-sequential-digits
1305-all-elements-in-two-binary-search-trees		1305-all-elements-in-two-binary-search-trees
1325-delete-leaves-with-a-given-value		1325-delete-leaves-with-a-given-value
133-clone-graph		133-clone-graph
1332-remove-palindromic-subsequences		1332-remove-palindromic-subsequences
1337-the-k-weakest-rows-in-a-matrix		1337-the-k-weakest-rows-in-a-matrix
134-gas-station		134-gas-station
1342-number-of-steps-to-reduce-a-number-to-zero		1342-number-of-steps-to-reduce-a-number-to-zero
135-candy		135-candy
1354-construct-target-array-with-multiple-sums		1354-construct-target-array-with-multiple-sums
1359-count-all-valid-pickup-and-delivery-options		1359-count-all-valid-pickup-and-delivery-options
137-single-number-ii		137-single-number-ii
1379-find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree		1379-find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree
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
1456-maximum-number-of-vowels-in-a-substring-of-given-length		1456-maximum-number-of-vowels-in-a-substring-of-given-length
1461-check-if-a-string-contains-all-binary-codes-of-size-k		1461-check-if-a-string-contains-all-binary-codes-of-size-k
1465-maximum-area-of-a-piece-of-cake-after-horizontal-and-vertical-cuts		1465-maximum-area-of-a-piece-of-cake-after-horizontal-and-vertical-cuts
1473-paint-house-iii		1473-paint-house-iii
148-sort-list		148-sort-list
1480-running-sum-of-1d-array		1480-running-sum-of-1d-array
160-intersection-of-two-linked-lists		160-intersection-of-two-linked-lists
1642-furthest-building-you-can-reach		1642-furthest-building-you-can-reach
1647-minimum-deletions-to-make-character-frequencies-unique		1647-minimum-deletions-to-make-character-frequencies-unique
165-compare-version-numbers		165-compare-version-numbers
1658-minimum-operations-to-reduce-x-to-zero		1658-minimum-operations-to-reduce-x-to-zero
1663-smallest-string-with-a-given-numeric-value		1663-smallest-string-with-a-given-numeric-value
167-two-sum-ii-input-array-is-sorted		167-two-sum-ii-input-array-is-sorted
1675-minimize-deviation-in-array		1675-minimize-deviation-in-array
1679-max-number-of-k-sum-pairs		1679-max-number-of-k-sum-pairs
1689-partitioning-into-minimum-number-of-deci-binary-numbers		1689-partitioning-into-minimum-number-of-deci-binary-numbers
169-majority-element		169-majority-element
1695-maximum-erasure-value		1695-maximum-erasure-value
1696-jump-game-vi		1696-jump-game-vi
17-letter-combinations-of-a-phone-number		17-letter-combinations-of-a-phone-number
171-excel-sheet-column-number		171-excel-sheet-column-number
1710-maximum-units-on-a-truck		1710-maximum-units-on-a-truck
1711-count-good-meals		1711-count-good-meals
1721-swapping-nodes-in-a-linked-list		1721-swapping-nodes-in-a-linked-list
1768-merge-strings-alternately		1768-merge-strings-alternately
189-rotate-array		189-rotate-array
190-reverse-bits		190-reverse-bits
198-house-robber		198-house-robber
199-binary-tree-right-side-view		199-binary-tree-right-side-view
206-reverse-linked-list		206-reverse-linked-list
2079-watering-plants		2079-watering-plants
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
211-design-add-and-search-words-data-structure		211-design-add-and-search-words-data-structure
2129-capitalize-the-title		2129-capitalize-the-title
2145-count-the-hidden-sequences		2145-count-the-hidden-sequences
2149-rearrange-array-elements-by-sign		2149-rearrange-array-elements-by-sign
215-kth-largest-element-in-an-array		215-kth-largest-element-in-an-array
2155-all-divisions-with-the-highest-score-of-a-binary-array		2155-all-divisions-with-the-highest-score-of-a-binary-array
216-combination-sum-iii		216-combination-sum-iii
2181-merge-nodes-in-between-zeros		2181-merge-nodes-in-between-zeros
2235-add-two-integers		2235-add-two-integers
225-implement-stack-using-queues		225-implement-stack-using-queues
228-summary-ranges		228-summary-ranges
23-merge-k-sorted-lists		23-merge-k-sorted-lists
230-kth-smallest-element-in-a-bst		230-kth-smallest-element-in-a-bst
231-power-of-two		231-power-of-two
235-lowest-common-ancestor-of-a-binary-search-tree		235-lowest-common-ancestor-of-a-binary-search-tree
236-lowest-common-ancestor-of-a-binary-tree		236-lowest-common-ancestor-of-a-binary-tree
24-swap-nodes-in-pairs		24-swap-nodes-in-pairs

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

Uh oh!

Uh oh!

Uh oh!

Repository files navigation

LeetCode

About

Uh oh!

Uh oh!

Languages

Uh oh!

Uh oh!

cryptus-neoxys/LeetCode

Folders and files

Latest commit

History

Repository files navigation

LeetCode

About

Topics

Resources

Uh oh!

Stars

Watchers

Forks

Uh oh!

Languages