Name		Name	Last commit message	Last commit date
1-two-sum		1-two-sum
1006-clumsy-factorial		1006-clumsy-factorial
1007-minimum-domino-rotations-for-equal-row		1007-minimum-domino-rotations-for-equal-row
1008-construct-binary-search-tree-from-preorder-traversal		1008-construct-binary-search-tree-from-preorder-traversal
101-symmetric-tree		101-symmetric-tree
1019-next-greater-node-in-linked-list		1019-next-greater-node-in-linked-list
102-binary-tree-level-order-traversal		102-binary-tree-level-order-traversal
1029-two-city-scheduling		1029-two-city-scheduling
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
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
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
1081-smallest-subsequence-of-distinct-characters		1081-smallest-subsequence-of-distinct-characters
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
1092-shortest-common-supersequence		1092-shortest-common-supersequence
11-container-with-most-water		11-container-with-most-water
112-path-sum		112-path-sum
1122-relative-sort-array		1122-relative-sort-array
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
115-distinct-subsequences		115-distinct-subsequences
116-populating-next-right-pointers-in-each-node		116-populating-next-right-pointers-in-each-node
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
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
1235-maximum-profit-in-job-scheduling		1235-maximum-profit-in-job-scheduling
1239-maximum-length-of-a-concatenated-string-with-unique-characters		1239-maximum-length-of-a-concatenated-string-with-unique-characters
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
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
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
1304-find-n-unique-integers-sum-up-to-zero		1304-find-n-unique-integers-sum-up-to-zero
1305-all-elements-in-two-binary-search-trees		1305-all-elements-in-two-binary-search-trees
1306-jump-game-iii		1306-jump-game-iii
1312-minimum-insertion-steps-to-make-a-string-palindrome		1312-minimum-insertion-steps-to-make-a-string-palindrome
1323-maximum-69-number		1323-maximum-69-number
1326-minimum-number-of-taps-to-open-to-water-a-garden.cpp		1326-minimum-number-of-taps-to-open-to-water-a-garden.cpp
1328-break-a-palindrome		1328-break-a-palindrome
1329-sort-the-matrix-diagonally		1329-sort-the-matrix-diagonally
133-clone-graph		133-clone-graph
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
1339-maximum-product-of-splitted-binary-tree		1339-maximum-product-of-splitted-binary-tree
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
1345-jump-game-iv		1345-jump-game-iv
1347-minimum-number-of-steps-to-make-two-strings-anagram		1347-minimum-number-of-steps-to-make-two-strings-anagram
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
136-single-number		136-single-number
137-single-number-ii		137-single-number-ii
1374-generate-a-string-with-characters-that-have-odd-counts		1374-generate-a-string-with-characters-that-have-odd-counts
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
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
143-reorder-list		143-reorder-list
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
146-lru-cache		146-lru-cache
1461-check-if-a-string-contains-all-binary-codes-of-size-k		1461-check-if-a-string-contains-all-binary-codes-of-size-k
1463-cherry-pickup-ii		1463-cherry-pickup-ii
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
147-insertion-sort-list		147-insertion-sort-list
1473-paint-house-iii		1473-paint-house-iii
148-sort-list		148-sort-list

Repository files navigation

LeetCode

About

No description, website, or topics provided.

9 stars

1 watching

Report repository

Releases

Packages

Contributors

Languages