LeetCode

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

Name	Name	Last commit message	Last commit date
Latest commit History 2,656 Commits 2,656 Commits
1-two-sum	1-two-sum
100-same-tree	100-same-tree
101-symmetric-tree	101-symmetric-tree
1014-best-sightseeing-pair	1014-best-sightseeing-pair
102-binary-tree-level-order-traversal	102-binary-tree-level-order-traversal
1020-number-of-enclaves	1020-number-of-enclaves
1021-remove-outermost-parentheses	1021-remove-outermost-parentheses
1025-divisor-game	1025-divisor-game
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
105-construct-binary-tree-from-preorder-and-inorder-traversal	105-construct-binary-tree-from-preorder-and-inorder-traversal
107-binary-tree-level-order-traversal-ii	107-binary-tree-level-order-traversal-ii
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
109-convert-sorted-list-to-binary-search-tree	109-convert-sorted-list-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
110-balanced-binary-tree	110-balanced-binary-tree
1108-defanging-an-ip-address	1108-defanging-an-ip-address
112-path-sum	112-path-sum
113-path-sum-ii	113-path-sum-ii
1137-n-th-tribonacci-number	1137-n-th-tribonacci-number
114-flatten-binary-tree-to-linked-list	114-flatten-binary-tree-to-linked-list
1143-longest-common-subsequence	1143-longest-common-subsequence
1148-article-views-i	1148-article-views-i
115-distinct-subsequences	115-distinct-subsequences
116-populating-next-right-pointers-in-each-node	116-populating-next-right-pointers-in-each-node
1161-maximum-level-sum-of-a-binary-tree	1161-maximum-level-sum-of-a-binary-tree
117-populating-next-right-pointers-in-each-node-ii	117-populating-next-right-pointers-in-each-node-ii
118-pascals-triangle	118-pascals-triangle
119-pascals-triangle-ii	119-pascals-triangle-ii
1192-critical-connections-in-a-network	1192-critical-connections-in-a-network
12-integer-to-roman	12-integer-to-roman
120-triangle	120-triangle
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
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
123-best-time-to-buy-and-sell-stock-iii	123-best-time-to-buy-and-sell-stock-iii
1232-check-if-it-is-a-straight-line	1232-check-if-it-is-a-straight-line
124-binary-tree-maximum-path-sum	124-binary-tree-maximum-path-sum
1249-minimum-remove-to-make-valid-parentheses	1249-minimum-remove-to-make-valid-parentheses
125-valid-palindrome	125-valid-palindrome
1254-number-of-closed-islands	1254-number-of-closed-islands
126-word-ladder-ii	126-word-ladder-ii
1260-shift-2d-grid	1260-shift-2d-grid
128-longest-consecutive-sequence	128-longest-consecutive-sequence
1281-subtract-the-product-and-sum-of-digits-of-an-integer	1281-subtract-the-product-and-sum-of-digits-of-an-integer
129-sum-root-to-leaf-numbers	129-sum-root-to-leaf-numbers
1290-convert-binary-number-in-a-linked-list-to-integer	1290-convert-binary-number-in-a-linked-list-to-integer
1293-shortest-path-in-a-grid-with-obstacles-elimination	1293-shortest-path-in-a-grid-with-obstacles-elimination
13-roman-to-integer	13-roman-to-integer
130-surrounded-regions	130-surrounded-regions
1302-deepest-leaves-sum	1302-deepest-leaves-sum
1309-decrypt-string-from-alphabet-to-integer-mapping	1309-decrypt-string-from-alphabet-to-integer-mapping
131-palindrome-partitioning	131-palindrome-partitioning
1313-decompress-run-length-encoded-list	1313-decompress-run-length-encoded-list
1314-matrix-block-sum	1314-matrix-block-sum
132-palindrome-partitioning-ii	132-palindrome-partitioning-ii
1329-sort-the-matrix-diagonally	1329-sort-the-matrix-diagonally
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
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
135-candy	135-candy
1351-count-negative-numbers-in-a-sorted-matrix	1351-count-negative-numbers-in-a-sorted-matrix
1356-sort-integers-by-the-number-of-1-bits	1356-sort-integers-by-the-number-of-1-bits
136-single-number	136-single-number
1367-linked-list-in-binary-tree	1367-linked-list-in-binary-tree
1376-time-needed-to-inform-all-employees	1376-time-needed-to-inform-all-employees
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
1389-create-target-array-in-the-given-order	1389-create-target-array-in-the-given-order
139-word-break	139-word-break
1396-design-underground-system	1396-design-underground-system
14-longest-common-prefix	14-longest-common-prefix
140-word-break-ii	140-word-break-ii
141-linked-list-cycle	141-linked-list-cycle
142-linked-list-cycle-ii	142-linked-list-cycle-ii
143-reorder-list	143-reorder-list
1431-kids-with-the-greatest-number-of-candies	1431-kids-with-the-greatest-number-of-candies
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
1464-maximum-product-of-two-elements-in-an-array	1464-maximum-product-of-two-elements-in-an-array
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
1470-shuffle-the-array	1470-shuffle-the-array
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
1484-group-sold-products-by-the-date	1484-group-sold-products-by-the-date
149-max-points-on-a-line	149-max-points-on-a-line
1491-average-salary-excluding-the-minimum-and-maximum-salary	1491-average-salary-excluding-the-minimum-and-maximum-salary

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

Repository files navigation

LeetCode

About

Uh oh!

Releases

Packages

Uh oh!

Contributors

Uh oh!

Languages

Search code, repositories, users, issues, pull requests...

Folders and files

Latest commit

History

Repository files navigation

LeetCode

About

Resources

Uh oh!

Stars

Watchers

Forks

Releases

Packages 0

Uh oh!

Contributors

Uh oh!

Languages

Packages