Skip to content
BranchesTags

Latest commit

 

History

1,014 Commits

Folders and files

NameName
Last commit message
Last commit date
.vscode
.vscode
 
 
1-two-sum
1-two-sum
 
 
10-regular-expression-matching
10-regular-expression-matching
 
 
1002-maximum-width-ramp
1002-maximum-width-ramp
 
 
1005-univalued-binary-tree
1005-univalued-binary-tree
 
 
1007-numbers-with-same-consecutive-differences
1007-numbers-with-same-consecutive-differences
 
 
1014-k-closest-points-to-origin
1014-k-closest-points-to-origin
 
 
1016-subarray-sums-divisible-by-k
1016-subarray-sums-divisible-by-k
 
 
1025-minimum-cost-for-tickets
1025-minimum-cost-for-tickets
 
 
1028-interval-list-intersections
1028-interval-list-intersections
 
 
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
 
 
1032-satisfiability-of-equality-equations
1032-satisfiability-of-equality-equations
 
 
1035-cousins-in-binary-tree
1035-cousins-in-binary-tree
 
 
1036-rotting-oranges
1036-rotting-oranges
 
 
1039-find-the-town-judge
1039-find-the-town-judge
 
 
104-maximum-depth-of-binary-tree
104-maximum-depth-of-binary-tree
 
 
1044-find-common-characters
1044-find-common-characters
 
 
1046-max-consecutive-ones-iii
1046-max-consecutive-ones-iii
 
 
105-construct-binary-tree-from-preorder-and-inorder-traversal
105-construct-binary-tree-from-preorder-and-inorder-traversal
 
 
1054-complement-of-base-10-integer
1054-complement-of-base-10-integer
 
 
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
 
 
107-binary-tree-level-order-traversal-ii
107-binary-tree-level-order-traversal-ii
 
 
1072-next-greater-node-in-linked-list
1072-next-greater-node-in-linked-list
 
 
1073-number-of-enclaves
1073-number-of-enclaves
 
 
1078-remove-outermost-parentheses
1078-remove-outermost-parentheses
 
 
1079-sum-of-root-to-leaf-binary-numbers
1079-sum-of-root-to-leaf-binary-numbers
 
 
1086-divisor-game
1086-divisor-game
 
 
1096-maximum-sum-of-two-non-overlapping-subarrays
1096-maximum-sum-of-two-non-overlapping-subarrays
 
 
11-container-with-most-water
11-container-with-most-water
 
 
110-balanced-binary-tree
110-balanced-binary-tree
 
 
111-minimum-depth-of-binary-tree
111-minimum-depth-of-binary-tree
 
 
1116-maximum-level-sum-of-a-binary-tree
1116-maximum-level-sum-of-a-binary-tree
 
 
112-path-sum
112-path-sum
 
 
1120-flower-planting-with-no-adjacent
1120-flower-planting-with-no-adjacent
 
 
1121-partition-array-for-maximum-sum
1121-partition-array-for-maximum-sum
 
 
1127-last-stone-weight
1127-last-stone-weight
 
 
1129-longest-string-chain
1129-longest-string-chain
 
 
113-path-sum-ii
113-path-sum-ii
 
 
114-flatten-binary-tree-to-linked-list
114-flatten-binary-tree-to-linked-list
 
 
115-distinct-subsequences
115-distinct-subsequences
 
 
1159-smallest-subsequence-of-distinct-characters
1159-smallest-subsequence-of-distinct-characters
 
 
116-populating-next-right-pointers-in-each-node
116-populating-next-right-pointers-in-each-node
 
 
1168-duplicate-zeros
1168-duplicate-zeros
 
 
117-populating-next-right-pointers-in-each-node-ii
117-populating-next-right-pointers-in-each-node-ii
 
 
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
 
 
121-best-time-to-buy-and-sell-stock
121-best-time-to-buy-and-sell-stock
 
 
1229-shortest-path-with-alternating-colors
1229-shortest-path-with-alternating-colors
 
 
1240-stone-game-ii
1240-stone-game-ii
 
 
1250-longest-common-subsequence
1250-longest-common-subsequence
 
 
1254-deepest-leaves-sum
1254-deepest-leaves-sum
 
 
126-word-ladder-ii
126-word-ladder-ii
 
 
127-word-ladder
127-word-ladder
 
 
1275-validate-binary-tree-nodes
1275-validate-binary-tree-nodes
 
 
128-longest-consecutive-sequence
128-longest-consecutive-sequence
 
 
1288-maximum-subarray-sum-with-one-deletion
1288-maximum-subarray-sum-with-one-deletion
 
 
129-sum-root-to-leaf-numbers
129-sum-root-to-leaf-numbers
 
 
132-palindrome-partitioning-ii
132-palindrome-partitioning-ii
 
 
1321-get-equal-substrings-within-budget
1321-get-equal-substrings-within-budget
 
 
1325-path-with-maximum-probability
1325-path-with-maximum-probability
 
 
134-gas-station
134-gas-station
 
 
1370-count-number-of-nice-subarrays
1370-count-number-of-nice-subarrays
 
 
1371-minimum-remove-to-make-valid-parentheses
1371-minimum-remove-to-make-valid-parentheses
 
 
1388-greatest-sum-divisible-by-three
1388-greatest-sum-divisible-by-three
 
 
1394-minimum-path-cost-in-a-grid
1394-minimum-path-cost-in-a-grid
 
 
1408-find-the-smallest-divisor-given-a-threshold
1408-find-the-smallest-divisor-given-a-threshold
 
 
1424-maximum-candies-you-can-get-from-boxes
1424-maximum-candies-you-can-get-from-boxes
 
 
1436-get-watched-videos-by-your-friends
1436-get-watched-videos-by-your-friends
 
 
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
 
 
1450-delete-leaves-with-a-given-value
1450-delete-leaves-with-a-given-value
 
 
1456-find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance
1456-find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance
 
 
1478-maximum-number-of-events-that-can-be-attended
1478-maximum-number-of-events-that-can-be-attended
 
 
148-sort-list
148-sort-list
 
 
1484-linked-list-in-binary-tree
1484-linked-list-in-binary-tree
 
 
1498-find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree
1498-find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree
 
 
15-3sum
15-3sum
 
 
150-evaluate-reverse-polish-notation
150-evaluate-reverse-polish-notation
 
 
1514-minimum-value-to-get-positive-step-by-step-sum
1514-minimum-value-to-get-positive-step-by-step-sum
 
 
153-find-minimum-in-rotated-sorted-array
153-find-minimum-in-rotated-sorted-array
 
 
1537-maximum-score-after-splitting-a-string
1537-maximum-score-after-splitting-a-string
 
 
154-find-minimum-in-rotated-sorted-array-ii
154-find-minimum-in-rotated-sorted-array-ii
 
 
1544-count-good-nodes-in-binary-tree
1544-count-good-nodes-in-binary-tree
 
 
1549-longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit
1549-longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit
 
 
155-min-stack
155-min-stack
 
 
1570-final-prices-with-a-special-discount-in-a-shop
1570-final-prices-with-a-special-discount-in-a-shop
 
 
1581-the-k-strongest-values-in-an-array
1581-the-k-strongest-values-in-an-array
 
 
160-intersection-of-two-linked-lists
160-intersection-of-two-linked-lists
 
 
1605-minimum-number-of-days-to-make-m-bouquets
1605-minimum-number-of-days-to-make-m-bouquets
 
 
1619-path-crossing
1619-path-crossing
 
 
162-find-peak-element
162-find-peak-element
 
 
1646-kth-missing-positive-number
1646-kth-missing-positive-number
 
 
166-fraction-to-recurring-decimal
166-fraction-to-recurring-decimal
 
 
1661-minimum-number-of-vertices-to-reach-all-nodes
1661-minimum-number-of-vertices-to-reach-all-nodes
 
 
1669-minimum-cost-to-cut-a-stick
1669-minimum-cost-to-cut-a-stick
 
 
167-two-sum-ii-input-array-is-sorted
167-two-sum-ii-input-array-is-sorted
 
 

About

No description, website, or topics provided.
Activity

Stars

1 star

Watchers

1 watching

Forks

0 forks
Report repository

Releases

Packages

Contributors

Languages