main

BranchesTags

Go to file

Code

Open more actions menu

Folders and files

Name		Name	Last commit message	Last commit date
Latest commit   History 851 Commits 851 Commits
1-two-sum		1-two-sum
10-regular-expression-matching		10-regular-expression-matching
100-same-tree		100-same-tree
1001-n-repeated-element-in-size-2n-array		1001-n-repeated-element-in-size-2n-array
1002-maximum-width-ramp		1002-maximum-width-ramp
101-symmetric-tree		101-symmetric-tree
1013-fibonacci-number		1013-fibonacci-number
102-binary-tree-level-order-traversal		102-binary-tree-level-order-traversal
1029-vertical-order-traversal-of-a-binary-tree		1029-vertical-order-traversal-of-a-binary-tree
103-binary-tree-zigzag-level-order-traversal		103-binary-tree-zigzag-level-order-traversal
1036-rotting-oranges		1036-rotting-oranges
104-maximum-depth-of-binary-tree		104-maximum-depth-of-binary-tree
1046-max-consecutive-ones-iii		1046-max-consecutive-ones-iii
1049-minimum-domino-rotations-for-equal-row		1049-minimum-domino-rotations-for-equal-row
105-construct-binary-tree-from-preorder-and-inorder-traversal		105-construct-binary-tree-from-preorder-and-inorder-traversal
1050-construct-binary-search-tree-from-preorder-traversal		1050-construct-binary-search-tree-from-preorder-traversal
1056-capacity-to-ship-packages-within-d-days		1056-capacity-to-ship-packages-within-d-days
106-construct-binary-tree-from-inorder-and-postorder-traversal		106-construct-binary-tree-from-inorder-and-postorder-traversal
108-convert-sorted-array-to-binary-search-tree		108-convert-sorted-array-to-binary-search-tree
1093-recover-a-tree-from-preorder-traversal		1093-recover-a-tree-from-preorder-traversal
11-container-with-most-water		11-container-with-most-water
110-balanced-binary-tree		110-balanced-binary-tree
1111-minimum-score-triangulation-of-polygon		1111-minimum-score-triangulation-of-polygon
112-path-sum		112-path-sum
1121-partition-array-for-maximum-sum		1121-partition-array-for-maximum-sum
1129-longest-string-chain		1129-longest-string-chain
114-flatten-binary-tree-to-linked-list		114-flatten-binary-tree-to-linked-list
115-distinct-subsequences		115-distinct-subsequences
1170-shortest-common-supersequence		1170-shortest-common-supersequence
1171-shortest-path-in-binary-matrix		1171-shortest-path-in-binary-matrix
12-integer-to-roman		12-integer-to-roman
120-triangle		120-triangle
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
123-best-time-to-buy-and-sell-stock-iii		123-best-time-to-buy-and-sell-stock-iii
1236-n-th-tribonacci-number		1236-n-th-tribonacci-number
124-binary-tree-maximum-path-sum		124-binary-tree-maximum-path-sum
1250-longest-common-subsequence		1250-longest-common-subsequence
126-word-ladder-ii		126-word-ladder-ii
127-word-ladder		127-word-ladder
1285-balance-a-binary-search-tree		1285-balance-a-binary-search-tree
1293-three-consecutive-odds		1293-three-consecutive-odds
13-roman-to-integer		13-roman-to-integer
130-surrounded-regions		130-surrounded-regions
1304-longest-happy-string		1304-longest-happy-string
132-palindrome-partitioning-ii		132-palindrome-partitioning-ii
1350-remove-sub-folders-from-the-filesystem		1350-remove-sub-folders-from-the-filesystem
1364-tuple-with-same-product		1364-tuple-with-same-product
1370-count-number-of-nice-subarrays		1370-count-number-of-nice-subarrays
139-word-break		139-word-break
14-longest-common-prefix		14-longest-common-prefix
1402-count-square-submatrices-with-all-ones		1402-count-square-submatrices-with-all-ones
1408-find-the-smallest-divisor-given-a-threshold		1408-find-the-smallest-divisor-given-a-threshold
141-linked-list-cycle		141-linked-list-cycle
1411-convert-binary-number-in-a-linked-list-to-integer		1411-convert-binary-number-in-a-linked-list-to-integer
1413-maximum-side-length-of-a-square-with-sum-less-than-or-equal-to-threshold		1413-maximum-side-length-of-a-square-with-sum-less-than-or-equal-to-threshold
142-linked-list-cycle-ii		142-linked-list-cycle-ii
1424-maximum-candies-you-can-get-from-boxes		1424-maximum-candies-you-can-get-from-boxes
1437-minimum-insertion-steps-to-make-a-string-palindrome		1437-minimum-insertion-steps-to-make-a-string-palindrome
144-binary-tree-preorder-traversal		144-binary-tree-preorder-traversal
1442-number-of-operations-to-make-network-connected		1442-number-of-operations-to-make-network-connected
145-binary-tree-postorder-traversal		145-binary-tree-postorder-traversal
1458-sort-integers-by-the-number-of-1-bits		1458-sort-integers-by-the-number-of-1-bits
1460-number-of-substrings-containing-all-three-characters		1460-number-of-substrings-containing-all-three-characters
1475-maximum-sum-bst-in-binary-tree		1475-maximum-sum-bst-in-binary-tree
1478-maximum-number-of-events-that-can-be-attended		1478-maximum-number-of-events-that-can-be-attended
148-sort-list		148-sort-list
1497-design-a-stack-with-increment-operation		1497-design-a-stack-with-increment-operation
1502-construct-k-palindrome-strings		1502-construct-k-palindrome-strings
1507-check-if-there-is-a-valid-path-in-a-grid		1507-check-if-there-is-a-valid-path-in-a-grid
1510-find-lucky-integer-in-an-array		1510-find-lucky-integer-in-an-array
1516-the-k-th-lexicographical-string-of-all-happy-strings-of-length-n		1516-the-k-th-lexicographical-string-of-all-happy-strings-of-length-n
152-maximum-product-subarray		152-maximum-product-subarray
1527-number-of-ways-to-paint-n-3-grid		1527-number-of-ways-to-paint-n-3-grid
1529-max-difference-you-can-get-from-changing-an-integer		1529-max-difference-you-can-get-from-changing-an-integer
153-find-minimum-in-rotated-sorted-array		153-find-minimum-in-rotated-sorted-array
1538-maximum-points-you-can-obtain-from-cards		1538-maximum-points-you-can-obtain-from-cards
154-find-minimum-in-rotated-sorted-array-ii		154-find-minimum-in-rotated-sorted-array-ii
155-min-stack		155-min-stack
1557-check-if-a-string-contains-all-binary-codes-of-size-k		1557-check-if-a-string-contains-all-binary-codes-of-size-k
1586-longest-subarray-of-1s-after-deleting-one-element		1586-longest-subarray-of-1s-after-deleting-one-element
1605-minimum-number-of-days-to-make-m-bouquets		1605-minimum-number-of-days-to-make-m-bouquets
162-find-peak-element		162-find-peak-element
1621-number-of-subsequences-that-satisfy-the-given-sum-condition		1621-number-of-subsequences-that-satisfy-the-given-sum-condition
1631-number-of-sub-arrays-with-odd-sum		1631-number-of-sub-arrays-with-odd-sum
1635-number-of-good-pairs		1635-number-of-good-pairs
1646-kth-missing-positive-number		1646-kth-missing-positive-number
165-compare-version-numbers		165-compare-version-numbers
1656-count-good-triplets		1656-count-good-triplets
167-two-sum-ii-input-array-is-sorted		167-two-sum-ii-input-array-is-sorted
1677-matrix-diagonal-sum		1677-matrix-diagonal-sum
17-letter-combinations-of-a-phone-number		17-letter-combinations-of-a-phone-number
1737-maximum-nesting-depth-of-the-parentheses		1737-maximum-nesting-depth-of-the-parentheses
1753-path-with-minimum-effort		1753-path-with-minimum-effort
1756-minimum-deletions-to-make-string-balanced		1756-minimum-deletions-to-make-string-balanced
1783-ways-to-make-a-fair-array		1783-ways-to-make-a-fair-array
1813-maximum-erasure-value		1813-maximum-erasure-value
1840-minimize-hamming-distance-after-swap-operations		1840-minimize-hamming-distance-after-swap-operations
1851-maximum-number-of-events-that-can-be-attended-ii		1851-maximum-number-of-events-that-can-be-attended-ii
188-best-time-to-buy-and-sell-stock-iv		188-best-time-to-buy-and-sell-stock-iv
View all files

About

No description, website, or topics provided.

Activity

Stars

0 stars

Watchers

1 watching

Forks

0 forks

Report repository

Releases

Packages

Contributors

Languages