LeetCode

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

Name		Name	Last commit message	Last commit date
0012-integer-to-roman		0012-integer-to-roman
0038-count-and-say		0038-count-and-say
0055-jump-game		0055-jump-game
0076-minimum-window-substring		0076-minimum-window-substring
0150-evaluate-reverse-polish-notation		0150-evaluate-reverse-polish-notation
0219-contains-duplicate-ii		0219-contains-duplicate-ii
0237-delete-node-in-a-linked-list		0237-delete-node-in-a-linked-list
0334-increasing-triplet-subsequence		0334-increasing-triplet-subsequence
0645-set-mismatch		0645-set-mismatch
0692-top-k-frequent-words		0692-top-k-frequent-words
0739-daily-temperatures		0739-daily-temperatures
0790-domino-and-tromino-tiling		0790-domino-and-tromino-tiling
0797-all-paths-from-source-to-target		0797-all-paths-from-source-to-target
0834-sum-of-distances-in-tree		0834-sum-of-distances-in-tree
0841-keys-and-rooms		0841-keys-and-rooms
0886-possible-bipartition		0886-possible-bipartition
0976-largest-perimeter-triangle		0976-largest-perimeter-triangle
0980-unique-paths-iii		0980-unique-paths-iii
1-two-sum		1-two-sum
100-same-tree		100-same-tree
1007-minimum-domino-rotations-for-equal-row		1007-minimum-domino-rotations-for-equal-row
101-symmetric-tree		101-symmetric-tree
102-binary-tree-level-order-traversal		102-binary-tree-level-order-traversal
1029-two-city-scheduling		1029-two-city-scheduling
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
1046-last-stone-weight		1046-last-stone-weight
1047-remove-all-adjacent-duplicates-in-string		1047-remove-all-adjacent-duplicates-in-string
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
11-container-with-most-water		11-container-with-most-water
112-path-sum		112-path-sum
113-path-sum-ii		113-path-sum-ii
114-flatten-binary-tree-to-linked-list		114-flatten-binary-tree-to-linked-list
1143-longest-common-subsequence		1143-longest-common-subsequence
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
1200-minimum-absolute-difference		1200-minimum-absolute-difference
1202-smallest-string-with-swaps		1202-smallest-string-with-swaps
1209-remove-all-adjacent-duplicates-in-string-ii		1209-remove-all-adjacent-duplicates-in-string-ii
121-best-time-to-buy-and-sell-stock		121-best-time-to-buy-and-sell-stock
1220-count-vowels-permutation		1220-count-vowels-permutation
1221-split-a-string-in-balanced-strings		1221-split-a-string-in-balanced-strings
1227-airplane-seat-assignment-probability		1227-airplane-seat-assignment-probability
1249-minimum-remove-to-make-valid-parentheses		1249-minimum-remove-to-make-valid-parentheses
126-word-ladder-ii		126-word-ladder-ii
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
1282-group-the-people-given-the-group-size-they-belong-to		1282-group-the-people-given-the-group-size-they-belong-to
1288-remove-covered-intervals		1288-remove-covered-intervals
13-roman-to-integer		13-roman-to-integer
130-surrounded-regions		130-surrounded-regions
1302-deepest-leaves-sum		1302-deepest-leaves-sum
1305-all-elements-in-two-binary-search-trees		1305-all-elements-in-two-binary-search-trees
1314-matrix-block-sum		1314-matrix-block-sum
1328-break-a-palindrome		1328-break-a-palindrome
1329-sort-the-matrix-diagonally		1329-sort-the-matrix-diagonally
1331-rank-transform-of-an-array		1331-rank-transform-of-an-array
1332-remove-palindromic-subsequences		1332-remove-palindromic-subsequences
1335-minimum-difficulty-of-a-job-schedule		1335-minimum-difficulty-of-a-job-schedule
1337-the-k-weakest-rows-in-a-matrix		1337-the-k-weakest-rows-in-a-matrix
1338-reduce-array-size-to-the-half		1338-reduce-array-size-to-the-half
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
1346-check-if-n-and-its-double-exist		1346-check-if-n-and-its-double-exist
1347-minimum-number-of-steps-to-make-two-strings-anagram		1347-minimum-number-of-steps-to-make-two-strings-anagram
135-candy		135-candy
1351-count-negative-numbers-in-a-sorted-matrix		1351-count-negative-numbers-in-a-sorted-matrix
1354-construct-target-array-with-multiple-sums		1354-construct-target-array-with-multiple-sums
1358-number-of-substrings-containing-all-three-characters		1358-number-of-substrings-containing-all-three-characters
1359-count-all-valid-pickup-and-delivery-options		1359-count-all-valid-pickup-and-delivery-options
136-single-number		136-single-number
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
138-copy-list-with-random-pointer		138-copy-list-with-random-pointer
1383-maximum-performance-of-a-team		1383-maximum-performance-of-a-team
1385-find-the-distance-value-between-two-arrays		1385-find-the-distance-value-between-two-arrays
1396-design-underground-system		1396-design-underground-system
14-longest-common-prefix		14-longest-common-prefix
141-linked-list-cycle		141-linked-list-cycle
1423-maximum-points-you-can-obtain-from-cards		1423-maximum-points-you-can-obtain-from-cards
1438-longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit		1438-longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit
144-binary-tree-preorder-traversal		144-binary-tree-preorder-traversal
1448-count-good-nodes-in-binary-tree		1448-count-good-nodes-in-binary-tree
145-binary-tree-postorder-traversal		145-binary-tree-postorder-traversal
1457-pseudo-palindromic-paths-in-a-binary-tree		1457-pseudo-palindromic-paths-in-a-binary-tree
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
1480-running-sum-of-1d-array		1480-running-sum-of-1d-array
15-3sum		15-3sum
151-reverse-words-in-a-string		151-reverse-words-in-a-string
1513-number-of-substrings-with-only-1s		1513-number-of-substrings-with-only-1s

Navigation Menu

Repository files navigation

LeetCode

About

Releases

Packages

Used by

Contributors

Languages

Latest commit

History

Folders and files

Repository files navigation

LeetCode

About

Topics

Resources

Stars

Watchers

Forks

Releases

Packages

Used by

Contributors

Languages