Skip to content

Files

Latest commit

 

History

History

articles

Folders and files

NameName
Last commit message
Last commit date

parent directory

..
132-pattern.md
132-pattern.md
 
 
4sum.md
4sum.md
 
 
README.md
README.md
 
 
accounts-merge.md
accounts-merge.md
 
 
add-binary.md
add-binary.md
 
 
add-to-array-form-of-integer.md
add-to-array-form-of-integer.md
 
 
add-two-numbers.md
add-two-numbers.md
 
 
all-possible-full-binary-trees.md
all-possible-full-binary-trees.md
 
 
anagram-groups.md
anagram-groups.md
 
 
arithmetic-slices-ii-subsequence.md
arithmetic-slices-ii-subsequence.md
 
 
arranging-coins.md
arranging-coins.md
 
 
array-with-elements-not-equal-to-average-of-neighbors.md
array-with-elements-not-equal-to-average-of-neighbors.md
 
 
as-far-from-land-as-possible.md
as-far-from-land-as-possible.md
 
 
assign-cookies.md
assign-cookies.md
 
 
asteroid-collision.md
asteroid-collision.md
 
 
backspace-string-compare.md
backspace-string-compare.md
 
 
bag-of-tokens.md
bag-of-tokens.md
 
 
balanced-binary-tree.md
balanced-binary-tree.md
 
 
baseball-game.md
baseball-game.md
 
 
best-team-with-no-conflicts.md
best-team-with-no-conflicts.md
 
 
best-time-to-buy-and-sell-stock-ii.md
best-time-to-buy-and-sell-stock-ii.md
 
 
binary-search-tree-iterator.md
binary-search-tree-iterator.md
 
 
binary-search.md
binary-search.md
 
 
binary-subarrays-with-sum.md
binary-subarrays-with-sum.md
 
 
binary-tree-diameter.md
binary-tree-diameter.md
 
 
binary-tree-from-preorder-and-inorder-traversal.md
binary-tree-from-preorder-and-inorder-traversal.md
 
 
binary-tree-inorder-traversal.md
binary-tree-inorder-traversal.md
 
 
binary-tree-maximum-path-sum.md
binary-tree-maximum-path-sum.md
 
 
binary-tree-postorder-traversal.md
binary-tree-postorder-traversal.md
 
 
binary-tree-preorder-traversal.md
binary-tree-preorder-traversal.md
 
 
binary-tree-right-side-view.md
binary-tree-right-side-view.md
 
 
binary-tree-zigzag-level-order-traversal.md
binary-tree-zigzag-level-order-traversal.md
 
 
bitwise-and-of-numbers-range.md
bitwise-and-of-numbers-range.md
 
 
boats-to-save-people.md
boats-to-save-people.md
 
 
brick-wall.md
brick-wall.md
 
 
build-a-matrix-with-conditions.md
build-a-matrix-with-conditions.md
 
 
burst-balloons.md
burst-balloons.md
 
 
buy-and-sell-crypto-with-cooldown.md
buy-and-sell-crypto-with-cooldown.md
 
 
buy-and-sell-crypto.md
buy-and-sell-crypto.md
 
 
buy-two-chocolates.md
buy-two-chocolates.md
 
 
calculate-money-in-leetcode-bank.md
calculate-money-in-leetcode-bank.md
 
 
can-place-flowers.md
can-place-flowers.md
 
 
candy.md
candy.md
 
 
capacity-to-ship-packages-within-d-days.md
capacity-to-ship-packages-within-d-days.md
 
 
car-fleet.md
car-fleet.md
 
 
car-pooling.md
car-pooling.md
 
 
champagne-tower.md
champagne-tower.md
 
 
cheapest-flight-path.md
cheapest-flight-path.md
 
 
check-completeness-of-a-binary-tree.md
check-completeness-of-a-binary-tree.md
 
 
check-if-a-string-contains-all-binary-codes-of-size-k.md
check-if-a-string-contains-all-binary-codes-of-size-k.md
 
 
check-if-move-is-legal.md
check-if-move-is-legal.md
 
 
check-if-there-is-a-valid-partition-for-the-array.md
check-if-there-is-a-valid-partition-for-the-array.md
 
 
check-if-two-string-arrays-are-equivalent.md
check-if-two-string-arrays-are-equivalent.md
 
 
cherry-pickup-ii.md
cherry-pickup-ii.md
 
 
climbing-stairs.md
climbing-stairs.md
 
 
clone-graph.md
clone-graph.md
 
 
coin-change-ii.md
coin-change-ii.md
 
 
coin-change.md
coin-change.md
 
 
combination-sum-iv.md
combination-sum-iv.md
 
 
combination-target-sum-ii.md
combination-target-sum-ii.md
 
 
combination-target-sum.md
combination-target-sum.md
 
 
combinations-of-a-phone-number.md
combinations-of-a-phone-number.md
 
 
combinations.md
combinations.md
 
 
concatenated-words.md
concatenated-words.md
 
 
concatenation-of-array.md
concatenation-of-array.md
 
 
constrained-subsequence-sum.md
constrained-subsequence-sum.md
 
 
construct-binary-tree-from-inorder-and-postorder-traversal.md
construct-binary-tree-from-inorder-and-postorder-traversal.md
 
 
construct-quad-tree.md
construct-quad-tree.md
 
 
construct-string-from-binary-tree.md
construct-string-from-binary-tree.md
 
 
contains-duplicate-ii.md
contains-duplicate-ii.md
 
 
contiguous-array.md
contiguous-array.md
 
 
continuous-subarray-sum.md
continuous-subarray-sum.md
 
 
convert-an-array-into-a-2d-array-with-conditions.md
convert-an-array-into-a-2d-array-with-conditions.md
 
 
convert-bst-to-greater-tree.md
convert-bst-to-greater-tree.md
 
 
convert-sorted-array-to-binary-search-tree.md
convert-sorted-array-to-binary-search-tree.md
 
 
copy-linked-list-with-random-pointer.md
copy-linked-list-with-random-pointer.md
 
 
count-all-valid-pickup-and-delivery-options.md
count-all-valid-pickup-and-delivery-options.md
 
 
count-connected-components.md
count-connected-components.md
 
 
count-good-nodes-in-binary-tree.md
count-good-nodes-in-binary-tree.md
 
 
count-number-of-islands.md
count-number-of-islands.md
 
 
count-odd-numbers-in-an-interval-range.md
count-odd-numbers-in-an-interval-range.md
 
 
count-of-matches-in-tournament.md
count-of-matches-in-tournament.md
 
 
count-paths.md
count-paths.md
 
 
count-squares.md
count-squares.md
 
 
count-sub-islands.md
count-sub-islands.md
 
 
count-subarrays-where-max-element-appears-at-least-k-times.md
count-subarrays-where-max-element-appears-at-least-k-times.md
 
 
count-subsequences.md
count-subsequences.md
 
 
count-triplets-that-can-form-two-arrays-of-equal-xor.md
count-triplets-that-can-form-two-arrays-of-equal-xor.md
 
 
count-vowels-permutation.md
count-vowels-permutation.md
 
 
count-ways-to-build-good-strings.md
count-ways-to-build-good-strings.md
 
 
counting-bits.md
counting-bits.md
 
 
course-schedule-ii.md
course-schedule-ii.md
 
 
course-schedule-iv.md
course-schedule-iv.md
 
 
course-schedule.md
course-schedule.md
 
 
daily-temperatures.md
daily-temperatures.md
 
 
data-stream-as-disjoint-intervals.md
data-stream-as-disjoint-intervals.md
 
 
decode-string.md
decode-string.md
 
 
decode-ways.md
decode-ways.md
 
 
delete-and-earn.md
delete-and-earn.md
 
 
delete-leaves-with-a-given-value.md
delete-leaves-with-a-given-value.md
 
 
delete-node-in-a-bst.md
delete-node-in-a-bst.md
 
 
depth-of-binary-tree.md
depth-of-binary-tree.md
 
 
design-a-food-rating-system.md
design-a-food-rating-system.md
 
 
design-browser-history.md
design-browser-history.md
 
 
design-circular-queue.md
design-circular-queue.md
 
 
design-hashmap.md
design-hashmap.md
 
 
design-hashset.md
design-hashset.md
 
 
design-linked-list.md
design-linked-list.md
 
 
design-parking-system.md
design-parking-system.md
 
 
design-twitter-feed.md
design-twitter-feed.md
 
 
design-underground-system.md
design-underground-system.md
 
 
design-word-search-data-structure.md
design-word-search-data-structure.md
 
 
destination-city.md
destination-city.md
 
 
detonate-the-maximum-bombs.md
detonate-the-maximum-bombs.md
 
 
distribute-coins-in-binary-tree.md
distribute-coins-in-binary-tree.md
 
 
divide-array-into-arrays-with-max-difference.md
divide-array-into-arrays-with-max-difference.md
 
 
dota2-senate.md
dota2-senate.md
 
 
duplicate-integer.md
duplicate-integer.md
 
 
eating-bananas.md
eating-bananas.md
 
 
edit-distance.md
edit-distance.md
 
 
eliminate-maximum-number-of-monsters.md
eliminate-maximum-number-of-monsters.md
 
 
encode-and-decode-tinyurl.md
encode-and-decode-tinyurl.md
 
 
evaluate-boolean-binary-tree.md
evaluate-boolean-binary-tree.md
 
 
evaluate-division.md
evaluate-division.md
 
 
evaluate-reverse-polish-notation.md
evaluate-reverse-polish-notation.md
 
 
even-odd-tree.md
even-odd-tree.md
 
 
excel-sheet-column-title.md
excel-sheet-column-title.md
 
 
extra-characters-in-a-string.md
extra-characters-in-a-string.md
 
 
find-all-anagrams-in-a-string.md
find-all-anagrams-in-a-string.md
 
 
find-all-duplicates-in-an-array.md
find-all-duplicates-in-an-array.md
 
 
find-all-numbers-disappeared-in-an-array.md
find-all-numbers-disappeared-in-an-array.md
 
 
find-all-people-with-secret.md
find-all-people-with-secret.md
 
 
find-bottom-left-tree-value.md
find-bottom-left-tree-value.md
 
 
find-closest-node-to-given-two-nodes.md
find-closest-node-to-given-two-nodes.md
 
 
find-critical-and-pseudo-critical-edges-in-minimum-spanning-tree.md
find-critical-and-pseudo-critical-edges-in-minimum-spanning-tree.md
 
 
find-duplicate-integer.md
find-duplicate-integer.md
 
 
find-duplicate-subtrees.md
find-duplicate-subtrees.md
 
 
find-eventual-safe-states.md
find-eventual-safe-states.md
 
 
find-first-and-last-position-of-element-in-sorted-array.md
find-first-and-last-position-of-element-in-sorted-array.md
 
 
find-first-palindromic-string-in-the-array.md
find-first-palindromic-string-in-the-array.md
 
 
find-in-mountain-array.md
find-in-mountain-array.md
 
 
find-k-closest-elements.md
find-k-closest-elements.md
 
 
find-largest-value-in-each-tree-row.md
find-largest-value-in-each-tree-row.md
 
 
find-median-in-a-data-stream.md
find-median-in-a-data-stream.md
 
 
find-minimum-in-rotated-sorted-array.md
find-minimum-in-rotated-sorted-array.md
 
 
find-missing-observations.md
find-missing-observations.md
 
 
find-peak-element.md
find-peak-element.md
 
 
find-pivot-index.md
find-pivot-index.md
 
 
find-polygon-with-the-largest-perimeter.md
find-polygon-with-the-largest-perimeter.md
 
 
find-target-in-rotated-sorted-array.md
find-target-in-rotated-sorted-array.md
 
 
find-the-difference-of-two-arrays.md
find-the-difference-of-two-arrays.md
 
 
find-the-difference.md
find-the-difference.md
 
 
find-the-index-of-the-first-occurrence-in-a-string.md
find-the-index-of-the-first-occurrence-in-a-string.md
 
 
find-the-kth-largest-integer-in-the-array.md
find-the-kth-largest-integer-in-the-array.md
 
 
find-the-longest-valid-obstacle-course-at-each-position.md
find-the-longest-valid-obstacle-course-at-each-position.md
 
 
find-the-maximum-sum-of-node-values.md
find-the-maximum-sum-of-node-values.md
 
 
find-the-safest-path-in-a-grid.md
find-the-safest-path-in-a-grid.md
 
 
find-the-town-judge.md
find-the-town-judge.md
 
 
find-unique-binary-string.md
find-unique-binary-string.md
 
 
find-words-that-can-be-formed-by-characters.md
find-words-that-can-be-formed-by-characters.md
 
 
first-bad-version.md
first-bad-version.md
 
 
first-missing-positive.md
first-missing-positive.md
 
 
first-unique-character-in-a-string.md
first-unique-character-in-a-string.md
 
 
flatten-nested-list-iterator.md
flatten-nested-list-iterator.md
 
 
flip-equivalent-binary-trees.md
flip-equivalent-binary-trees.md
 
 
flip-string-to-monotone-increasing.md
flip-string-to-monotone-increasing.md
 
 
foreign-dictionary.md
foreign-dictionary.md
 
 
freedom-trail.md
freedom-trail.md
 
 
frequency-of-the-most-frequent-element.md
frequency-of-the-most-frequent-element.md
 
 
fruit-into-baskets.md
fruit-into-baskets.md
 
 
furthest-building-you-can-reach.md
furthest-building-you-can-reach.md
 
 
gas-station.md
gas-station.md
 
 
generate-parentheses.md
generate-parentheses.md
 
 
get-equal-substrings-within-budget.md
get-equal-substrings-within-budget.md
 
 
greatest-common-divisor-of-strings.md
greatest-common-divisor-of-strings.md
 
 
greatest-common-divisor-traversal.md
greatest-common-divisor-traversal.md
 
 
grid-game.md
grid-game.md
 
 
guess-number-higher-or-lower.md
guess-number-higher-or-lower.md
 
 
hand-of-straights.md
hand-of-straights.md
 
 
house-robber-ii.md
house-robber-ii.md
 
 
house-robber-iii.md
house-robber-iii.md
 
 
house-robber.md
house-robber.md
 
 
image-smoother.md
image-smoother.md
 
 
implement-prefix-tree.md
implement-prefix-tree.md
 
 
implement-queue-using-stacks.md
implement-queue-using-stacks.md
 
 
implement-stack-using-queues.md
implement-stack-using-queues.md
 
 
insert-delete-getrandom-o1.md
insert-delete-getrandom-o1.md
 
 
insert-greatest-common-divisors-in-linked-list.md
insert-greatest-common-divisors-in-linked-list.md
 
 
insert-into-a-binary-search-tree.md
insert-into-a-binary-search-tree.md
 
 
insert-new-interval.md
insert-new-interval.md
 
 
insertion-sort-list.md
insertion-sort-list.md
 
 
integer-break.md
integer-break.md
 
 
integer-to-roman.md
integer-to-roman.md
 
 
interleaving-string.md
interleaving-string.md
 
 
intersection-of-two-arrays.md
intersection-of-two-arrays.md
 
 
intersection-of-two-linked-lists.md
intersection-of-two-linked-lists.md
 
 
invert-a-binary-tree.md
invert-a-binary-tree.md
 
 
ipo.md
ipo.md
 
 
is-anagram.md
is-anagram.md
 
 
is-graph-bipartite.md
is-graph-bipartite.md
 
 
is-palindrome.md
is-palindrome.md
 
 
is-subsequence.md
is-subsequence.md
 
 
island-perimeter.md
island-perimeter.md
 
 
islands-and-treasure.md
islands-and-treasure.md
 
 
isomorphic-strings.md
isomorphic-strings.md
 
 
jump-game-ii.md
jump-game-ii.md
 
 
jump-game-vii.md
jump-game-vii.md
 
 
jump-game.md
jump-game.md
 
 
k-closest-points-to-origin.md
k-closest-points-to-origin.md
 
 
k-inverse-pairs-array.md
k-inverse-pairs-array.md
 
 
k-th-symbol-in-grammar.md
k-th-symbol-in-grammar.md
 
 
knight-dialer.md
knight-dialer.md
 
 
kth-largest-element-in-an-array.md
kth-largest-element-in-an-array.md
 
 
kth-largest-integer-in-a-stream.md
kth-largest-integer-in-a-stream.md
 
 
kth-smallest-integer-in-bst.md
kth-smallest-integer-in-bst.md
 
 
largest-3-same-digit-number-in-string.md
largest-3-same-digit-number-in-string.md
 
 
largest-color-value-in-a-directed-graph.md
largest-color-value-in-a-directed-graph.md
 
 
largest-divisible-subset.md
largest-divisible-subset.md
 
 
largest-local-values-in-a-matrix.md
largest-local-values-in-a-matrix.md
 
 
largest-number.md
largest-number.md
 
 
largest-odd-number-in-string.md
largest-odd-number-in-string.md
 
 
largest-rectangle-in-histogram.md
largest-rectangle-in-histogram.md
 
 
largest-submatrix-with-rearrangements.md
largest-submatrix-with-rearrangements.md
 
 
largest-substring-between-two-equal-characters.md
largest-substring-between-two-equal-characters.md
 
 
last-stone-weight-ii.md
last-stone-weight-ii.md
 
 
last-stone-weight.md
last-stone-weight.md
 
 
leaf-similar-trees.md
leaf-similar-trees.md
 
 
least-number-of-unique-integers-after-k-removals.md
least-number-of-unique-integers-after-k-removals.md
 
 
lemonade-change.md
lemonade-change.md
 
 
length-of-last-word.md
length-of-last-word.md
 
 
length-of-longest-subarray-with-at-most-k-frequency.md
length-of-longest-subarray-with-at-most-k-frequency.md
 
 
level-order-traversal-of-binary-tree.md
level-order-traversal-of-binary-tree.md
 
 
lfu-cache.md
lfu-cache.md
 
 
linked-list-cycle-detection.md
linked-list-cycle-detection.md
 
 
linked-list-cycle-ii.md
linked-list-cycle-ii.md
 
 
longest-common-prefix.md
longest-common-prefix.md
 
 
longest-common-subsequence.md
longest-common-subsequence.md
 
 
longest-consecutive-sequence.md
longest-consecutive-sequence.md
 
 
longest-happy-string.md
longest-happy-string.md
 
 
longest-ideal-subsequence.md
longest-ideal-subsequence.md
 
 
longest-increasing-path-in-matrix.md
longest-increasing-path-in-matrix.md
 
 
longest-increasing-subsequence-ii.md
longest-increasing-subsequence-ii.md
 
 
longest-increasing-subsequence.md
longest-increasing-subsequence.md
 
 
longest-palindromic-subsequence.md
longest-palindromic-subsequence.md
 
 
longest-palindromic-substring.md
longest-palindromic-substring.md
 
 
longest-repeating-substring-with-replacement.md
longest-repeating-substring-with-replacement.md
 
 
longest-string-chain.md
longest-string-chain.md
 
 
longest-substring-without-duplicates.md
longest-substring-without-duplicates.md
 
 
longest-turbulent-subarray.md
longest-turbulent-subarray.md
 
 
lowest-common-ancestor-in-binary-search-tree.md
lowest-common-ancestor-in-binary-search-tree.md
 
 
lru-cache.md
lru-cache.md
 
 
majority-element-ii.md
majority-element-ii.md
 
 
majority-element.md
majority-element.md
 
 
make-the-string-great.md
make-the-string-great.md
 
 
matchsticks-to-square.md
matchsticks-to-square.md
 
 
matrix-diagonal-sum.md
matrix-diagonal-sum.md
 
 
max-area-of-island.md
max-area-of-island.md
 
 
max-points-on-a-line.md
max-points-on-a-line.md
 
 
max-water-container.md
max-water-container.md
 
 
maximal-square.md
maximal-square.md
 
 
maximize-score-after-n-operations.md
maximize-score-after-n-operations.md
 
 
maximum-alternating-subsequence-sum.md
maximum-alternating-subsequence-sum.md
 
 
maximum-element-after-decreasing-and-rearranging.md
maximum-element-after-decreasing-and-rearranging.md
 
 
maximum-frequency-stack.md
maximum-frequency-stack.md
 
 
maximum-length-of-a-concatenated-string-with-unique-characters.md
maximum-length-of-a-concatenated-string-with-unique-characters.md
 
 
maximum-length-of-pair-chain.md
maximum-length-of-pair-chain.md
 
 
maximum-nesting-depth-of-the-parentheses.md
maximum-nesting-depth-of-the-parentheses.md
 
 
maximum-number-of-balloons.md
maximum-number-of-balloons.md
 
 
maximum-number-of-removable-characters.md
maximum-number-of-removable-characters.md
 
 
maximum-number-of-vowels-in-a-substring-of-given-length.md
maximum-number-of-vowels-in-a-substring-of-given-length.md
 
 
maximum-odd-binary-number.md
maximum-odd-binary-number.md
 
 
maximum-performance-of-a-team.md
maximum-performance-of-a-team.md
 
 
maximum-points-you-can-obtain-from-cards.md
maximum-points-you-can-obtain-from-cards.md
 
 
maximum-product-difference-between-two-pairs.md
maximum-product-difference-between-two-pairs.md
 
 
maximum-product-of-the-length-of-two-palindromic-subsequences.md
maximum-product-of-the-length-of-two-palindromic-subsequences.md
 
 
maximum-product-subarray.md
maximum-product-subarray.md
 
 
maximum-profit-in-job-scheduling.md
maximum-profit-in-job-scheduling.md
 
 
maximum-score-after-splitting-a-string.md
maximum-score-after-splitting-a-string.md
 
 
maximum-score-of-a-good-subarray.md
maximum-score-of-a-good-subarray.md
 
 
maximum-score-words-formed-by-letters.md
maximum-score-words-formed-by-letters.md
 
 
maximum-subarray-min-product.md
maximum-subarray-min-product.md
 
 
maximum-subarray.md
maximum-subarray.md
 
 
maximum-subsequence-score.md
maximum-subsequence-score.md
 
 
maximum-sum-circular-subarray.md
maximum-sum-circular-subarray.md
 
 
maximum-twin-sum-of-a-linked-list.md
maximum-twin-sum-of-a-linked-list.md
 
 
maximum-value-of-k-coins-from-piles.md
maximum-value-of-k-coins-from-piles.md
 
 
maximum-width-of-binary-tree.md
maximum-width-of-binary-tree.md
 
 
median-of-two-sorted-arrays.md
median-of-two-sorted-arrays.md
 
 
meeting-rooms-iii.md
meeting-rooms-iii.md
 
 
meeting-schedule-ii.md
meeting-schedule-ii.md
 
 
meeting-schedule.md
meeting-schedule.md
 
 
merge-in-between-linked-lists.md
merge-in-between-linked-lists.md
 
 
merge-intervals.md
merge-intervals.md
 
 
merge-k-sorted-linked-lists.md
merge-k-sorted-linked-lists.md
 
 
merge-sorted-array.md
merge-sorted-array.md
 
 
merge-strings-alternately.md
merge-strings-alternately.md
 
 
merge-triplets-to-form-target.md
merge-triplets-to-form-target.md
 
 
merge-two-binary-trees.md
merge-two-binary-trees.md
 
 
merge-two-sorted-linked-lists.md
merge-two-sorted-linked-lists.md
 
 
middle-of-the-linked-list.md
middle-of-the-linked-list.md
 
 
min-cost-climbing-stairs.md
min-cost-climbing-stairs.md
 
 
min-cost-to-connect-points.md
min-cost-to-connect-points.md
 
 
minimize-deviation-in-array.md
minimize-deviation-in-array.md
 
 
minimize-maximum-of-array.md
minimize-maximum-of-array.md
 
 
minimize-the-maximum-difference-of-pairs.md
minimize-the-maximum-difference-of-pairs.md
 
 
minimum-array-end.md
minimum-array-end.md
 
 
minimum-changes-to-make-alternating-binary-string.md
minimum-changes-to-make-alternating-binary-string.md
 
 
minimum-cost-for-tickets.md
minimum-cost-for-tickets.md
 
 
minimum-cost-to-cut-a-stick.md
minimum-cost-to-cut-a-stick.md
 
 
minimum-cost-to-hire-k-workers.md
minimum-cost-to-hire-k-workers.md
 
 
minimum-deletions-to-make-character-frequencies-unique.md
minimum-deletions-to-make-character-frequencies-unique.md
 
 
minimum-difference-between-highest-and-lowest-of-k-scores.md
minimum-difference-between-highest-and-lowest-of-k-scores.md
 
 
minimum-difficulty-of-a-job-schedule.md
minimum-difficulty-of-a-job-schedule.md
 
 
minimum-distance-between-bst-nodes.md
minimum-distance-between-bst-nodes.md
 
 
minimum-falling-path-sum-ii.md
minimum-falling-path-sum-ii.md
 
 
minimum-falling-path-sum.md
minimum-falling-path-sum.md
 
 
minimum-fuel-cost-to-report-to-the-capital.md
minimum-fuel-cost-to-report-to-the-capital.md
 
 
minimum-height-trees.md
minimum-height-trees.md
 
 
minimum-interval-including-query.md
minimum-interval-including-query.md
 
 
minimum-length-of-string-after-deleting-similar-ends.md
minimum-length-of-string-after-deleting-similar-ends.md
 
 
minimum-number-of-arrows-to-burst-balloons.md
minimum-number-of-arrows-to-burst-balloons.md
 
 
minimum-number-of-days-to-eat-n-oranges.md
minimum-number-of-days-to-eat-n-oranges.md
 
 
minimum-number-of-flips-to-make-the-binary-string-alternating.md
minimum-number-of-flips-to-make-the-binary-string-alternating.md
 
 
minimum-number-of-operations-to-make-array-continuous.md
minimum-number-of-operations-to-make-array-continuous.md
 
 
minimum-number-of-operations-to-make-array-empty.md
minimum-number-of-operations-to-make-array-empty.md
 
 
minimum-number-of-swaps-to-make-the-string-balanced.md
minimum-number-of-swaps-to-make-the-string-balanced.md
 
 
minimum-number-of-vertices-to-reach-all-nodes.md
minimum-number-of-vertices-to-reach-all-nodes.md
 
 
minimum-one-bit-operations-to-make-integers-zero.md
minimum-one-bit-operations-to-make-integers-zero.md
 
 
minimum-operations-to-reduce-x-to-zero.md
minimum-operations-to-reduce-x-to-zero.md
 
 
minimum-path-sum.md
minimum-path-sum.md
 
 
minimum-penalty-for-a-shop.md
minimum-penalty-for-a-shop.md
 
 
minimum-remove-to-make-valid-parentheses.md
minimum-remove-to-make-valid-parentheses.md
 
 
minimum-score-of-a-path-between-two-cities.md
minimum-score-of-a-path-between-two-cities.md
 
 
minimum-size-subarray-sum.md
minimum-size-subarray-sum.md
 
 
minimum-stack.md
minimum-stack.md
 
 
minimum-time-to-collect-all-apples-in-a-tree.md
minimum-time-to-collect-all-apples-in-a-tree.md
 
 
minimum-time-to-make-rope-colorful.md
minimum-time-to-make-rope-colorful.md
 
 
minimum-window-with-characters.md
minimum-window-with-characters.md
 
 
missing-number.md
missing-number.md
 
 
monotonic-array.md
monotonic-array.md
 
 
move-zeroes.md
move-zeroes.md
 
 
multiply-strings.md
multiply-strings.md
 
 
my-calendar-i.md
my-calendar-i.md
 
 
n-queens-ii.md
n-queens-ii.md
 
 
n-queens.md
n-queens.md
 
 
n-th-tribonacci-number.md
n-th-tribonacci-number.md
 
 
naming-a-company.md
naming-a-company.md
 
 
network-delay-time.md
network-delay-time.md
 
 
new-21-game.md
new-21-game.md
 
 
next-greater-element-i.md
next-greater-element-i.md
 
 
non-cyclical-number.md
non-cyclical-number.md
 
 
non-decreasing-array.md
non-decreasing-array.md
 
 
non-overlapping-intervals.md
non-overlapping-intervals.md
 
 
number-of-closed-islands.md
number-of-closed-islands.md
 
 
number-of-dice-rolls-with-target-sum.md
number-of-dice-rolls-with-target-sum.md
 
 
number-of-enclaves.md
number-of-enclaves.md
 
 
number-of-flowers-in-full-bloom.md
number-of-flowers-in-full-bloom.md
 
 
number-of-good-pairs.md
number-of-good-pairs.md
 
 
number-of-good-paths.md
number-of-good-paths.md
 
 
number-of-laser-beams-in-a-bank.md
number-of-laser-beams-in-a-bank.md
 
 
number-of-longest-increasing-subsequence.md
number-of-longest-increasing-subsequence.md
 
 
number-of-music-playlists.md
number-of-music-playlists.md
 
 
number-of-one-bits.md
number-of-one-bits.md
 
 
number-of-pairs-of-interchangeable-rectangles.md
number-of-pairs-of-interchangeable-rectangles.md
 
 
number-of-students-unable-to-eat-lunch.md
number-of-students-unable-to-eat-lunch.md
 
 
number-of-sub-arrays-of-size-k-and-average-greater-than-or-equal-to-threshold.md
number-of-sub-arrays-of-size-k-and-average-greater-than-or-equal-to-threshold.md
 
 
number-of-submatrices-that-sum-to-target.md
number-of-submatrices-that-sum-to-target.md
 
 
number-of-subsequences-that-satisfy-the-given-sum-condition.md
number-of-subsequences-that-satisfy-the-given-sum-condition.md
 
 
number-of-ways-to-divide-a-long-corridor.md
number-of-ways-to-divide-a-long-corridor.md
 
 
number-of-ways-to-form-a-target-string-given-a-dictionary.md
number-of-ways-to-form-a-target-string-given-a-dictionary.md
 
 
number-of-ways-to-rearrange-sticks-with-k-sticks-visible.md
number-of-ways-to-rearrange-sticks-with-k-sticks-visible.md
 
 
number-of-ways-to-stay-in-the-same-place-after-some-steps.md
number-of-ways-to-stay-in-the-same-place-after-some-steps.md
 
 
number-of-zero-filled-subarrays.md
number-of-zero-filled-subarrays.md
 
 
ones-and-zeroes.md
ones-and-zeroes.md
 
 
online-stock-span.md
online-stock-span.md
 
 
open-the-lock.md
open-the-lock.md
 
 
operations-on-tree.md
operations-on-tree.md
 
 
optimal-partition-of-string.md
optimal-partition-of-string.md
 
 
out-of-boundary-paths.md
out-of-boundary-paths.md
 
 
pacific-atlantic-water-flow.md
pacific-atlantic-water-flow.md
 
 
paint-house.md
paint-house.md
 
 
painting-the-walls.md
painting-the-walls.md
 
 
palindrome-linked-list.md
palindrome-linked-list.md
 
 
palindrome-number.md
palindrome-number.md
 
 
palindrome-partitioning.md
palindrome-partitioning.md
 
 
palindromic-substrings.md
palindromic-substrings.md
 
 
parallel-courses-iii.md
parallel-courses-iii.md
 
 
partition-array-for-maximum-sum.md
partition-array-for-maximum-sum.md
 
 
partition-equal-subset-sum.md
partition-equal-subset-sum.md
 
 
partition-labels.md
partition-labels.md
 
 
partition-list.md
partition-list.md
 
 
partition-to-k-equal-sum-subsets.md
partition-to-k-equal-sum-subsets.md
 
 
pascals-triangle-ii.md
pascals-triangle-ii.md
 
 
pascals-triangle.md
pascals-triangle.md
 
 
path-crossing.md
path-crossing.md
 
 
path-sum.md
path-sum.md
 
 
path-with-maximum-gold.md
path-with-maximum-gold.md
 
 
path-with-maximum-probability.md
path-with-maximum-probability.md
 
 
path-with-minimum-effort.md
path-with-minimum-effort.md
 
 
perfect-squares.md
perfect-squares.md
 
 
permutation-string.md
permutation-string.md
 
 
permutations-ii.md
permutations-ii.md
 
 
permutations.md
permutations.md
 
 
plus-one.md
plus-one.md
 
 
populating-next-right-pointers-in-each-node.md
populating-next-right-pointers-in-each-node.md
 
 
pow-x-n.md
pow-x-n.md
 
 
power-of-four.md
power-of-four.md
 
 
power-of-two.md
power-of-two.md
 
 
prefix-and-suffix-search.md
prefix-and-suffix-search.md
 
 
process-tasks-using-servers.md
process-tasks-using-servers.md
 
 
products-of-array-discluding-self.md
products-of-array-discluding-self.md
 
 
profitable-schemes.md
profitable-schemes.md
 
 
pseudo-palindromic-paths-in-a-binary-tree.md
pseudo-palindromic-paths-in-a-binary-tree.md
 
 
push-dominoes.md
push-dominoes.md
 
 
queue-reconstruction-by-height.md
queue-reconstruction-by-height.md
 
 
range-sum-of-bst.md
range-sum-of-bst.md
 
 
range-sum-query-2d-immutable.md
range-sum-query-2d-immutable.md
 
 
range-sum-query-immutable.md
range-sum-query-immutable.md
 
 
range-sum-query-mutable.md
range-sum-query-mutable.md
 
 
rearrange-array-elements-by-sign.md
rearrange-array-elements-by-sign.md
 
 
reconstruct-flight-path.md
reconstruct-flight-path.md
 
 
redistribute-characters-to-make-all-strings-equal.md
redistribute-characters-to-make-all-strings-equal.md
 
 
redundant-connection.md
redundant-connection.md
 
 
regular-expression-matching.md
regular-expression-matching.md
 
 
remove-all-adjacent-duplicates-in-string-ii.md
remove-all-adjacent-duplicates-in-string-ii.md
 
 
remove-colored-pieces-if-both-neighbors-are-the-same-color.md
remove-colored-pieces-if-both-neighbors-are-the-same-color.md
 
 
remove-covered-intervals.md
remove-covered-intervals.md
 
 
remove-duplicates-from-sorted-array-ii.md
remove-duplicates-from-sorted-array-ii.md
 
 
remove-duplicates-from-sorted-array.md
remove-duplicates-from-sorted-array.md
 
 
remove-duplicates-from-sorted-list.md
remove-duplicates-from-sorted-list.md
 
 
remove-element.md
remove-element.md
 
 
remove-k-digits.md
remove-k-digits.md
 
 
remove-linked-list-elements.md
remove-linked-list-elements.md
 
 
remove-max-number-of-edges-to-keep-graph-fully-traversable.md
remove-max-number-of-edges-to-keep-graph-fully-traversable.md
 
 
remove-node-from-end-of-linked-list.md
remove-node-from-end-of-linked-list.md
 
 
remove-nodes-from-linked-list.md
remove-nodes-from-linked-list.md
 
 
removing-stars-from-a-string.md
removing-stars-from-a-string.md
 
 
reorder-linked-list.md
reorder-linked-list.md
 
 
reorder-routes-to-make-all-paths-lead-to-the-city-zero.md
reorder-routes-to-make-all-paths-lead-to-the-city-zero.md
 
 
reorganize-string.md
reorganize-string.md
 
 
repeated-dna-sequences.md
repeated-dna-sequences.md
 
 
replace-elements-with-greatest-element-on-right-side.md
replace-elements-with-greatest-element-on-right-side.md
 
 
restore-ip-addresses.md
restore-ip-addresses.md
 
 
reveal-cards-in-increasing-order.md
reveal-cards-in-increasing-order.md
 
 
reverse-a-linked-list.md
reverse-a-linked-list.md
 
 
reverse-bits.md
reverse-bits.md
 
 
reverse-integer.md
reverse-integer.md
 
 
reverse-linked-list-ii.md
reverse-linked-list-ii.md
 
 
reverse-nodes-in-k-group.md
reverse-nodes-in-k-group.md
 
 
reverse-string.md
reverse-string.md
 
 
reverse-words-in-a-string-iii.md
reverse-words-in-a-string-iii.md
 
 
robot-bounded-in-circle.md
robot-bounded-in-circle.md
 
 
roman-to-integer.md
roman-to-integer.md
 
 
rotate-array.md
rotate-array.md
 
 
rotate-list.md
rotate-list.md
 
 
rotate-matrix.md
rotate-matrix.md
 
 
rotting-fruit.md
rotting-fruit.md
 
 
same-binary-tree.md
same-binary-tree.md
 
 
score-after-flipping-matrix.md
score-after-flipping-matrix.md
 
 
search-2d-matrix.md
search-2d-matrix.md
 
 
search-for-word-ii.md
search-for-word-ii.md
 
 
search-for-word.md
search-for-word.md
 
 
search-in-a-binary-search-tree.md
search-in-a-binary-search-tree.md
 
 
search-in-rotated-sorted-array-ii.md
search-in-rotated-sorted-array-ii.md
 
 
search-insert-position.md
search-insert-position.md
 
 
search-suggestions-system.md
search-suggestions-system.md
 
 
seat-reservation-manager.md
seat-reservation-manager.md
 
 
sequential-digits.md
sequential-digits.md
 
 
serialize-and-deserialize-binary-tree.md
serialize-and-deserialize-binary-tree.md
 
 
set-mismatch.md
set-mismatch.md
 
 
set-zeroes-in-matrix.md
set-zeroes-in-matrix.md
 
 
shift-2d-grid.md
shift-2d-grid.md
 
 
shortest-bridge.md
shortest-bridge.md
 
 
shortest-common-supersequence.md
shortest-common-supersequence.md
 
 
shortest-path-in-binary-matrix.md
shortest-path-in-binary-matrix.md
 
 
shortest-path-with-alternating-colors.md
shortest-path-with-alternating-colors.md
 
 
shuffle-the-array.md
shuffle-the-array.md
 
 
sign-of-the-product-of-an-array.md
sign-of-the-product-of-an-array.md
 
 
simplify-path.md
simplify-path.md
 
 
single-element-in-a-sorted-array.md
single-element-in-a-sorted-array.md
 
 
single-number-iii.md
single-number-iii.md
 
 
single-number.md
single-number.md
 
 
single-threaded-cpu.md
single-threaded-cpu.md
 
 
sliding-window-maximum.md
sliding-window-maximum.md
 
 
sliding-window-median.md
sliding-window-median.md
 
 
smallest-string-starting-from-leaf.md
smallest-string-starting-from-leaf.md
 
 
snakes-and-ladders.md
snakes-and-ladders.md
 
 
solving-questions-with-brainpower.md
solving-questions-with-brainpower.md
 
 
sort-an-array.md
sort-an-array.md
 
 
sort-array-by-parity.md
sort-array-by-parity.md
 
 
sort-characters-by-frequency.md
sort-characters-by-frequency.md
 
 
sort-colors.md
sort-colors.md
 
 
sort-items-by-groups-respecting-dependencies.md
sort-items-by-groups-respecting-dependencies.md
 
 
sort-list.md
sort-list.md
 
 
special-array-with-x-elements-greater-than-or-equal-x.md
special-array-with-x-elements-greater-than-or-equal-x.md
 
 
spiral-matrix-ii.md
spiral-matrix-ii.md
 
 
spiral-matrix.md
spiral-matrix.md
 
 
split-array-largest-sum.md
split-array-largest-sum.md
 
 
split-linked-list-in-parts.md
split-linked-list-in-parts.md
 
 
splitting-a-string-into-descending-consecutive-values.md
splitting-a-string-into-descending-consecutive-values.md
 
 
sqrtx.md
sqrtx.md
 
 
squares-of-a-sorted-array.md
squares-of-a-sorted-array.md
 
 
stickers-to-spell-word.md
stickers-to-spell-word.md
 
 
stone-game-ii.md
stone-game-ii.md
 
 
stone-game-iii.md
stone-game-iii.md
 
 
stone-game.md
stone-game.md
 
 
string-compression-ii.md
string-compression-ii.md
 
 
string-encode-and-decode.md
string-encode-and-decode.md
 
 
student-attendance-record-ii.md
student-attendance-record-ii.md
 
 
subarray-product-less-than-k.md
subarray-product-less-than-k.md
 
 
subarray-sum-equals-k.md
subarray-sum-equals-k.md
 
 
subarrays-with-k-different-integers.md
subarrays-with-k-different-integers.md
 
 
subsets-ii.md
subsets-ii.md
 
 
subsets.md
subsets.md
 
 
subtree-of-a-binary-tree.md
subtree-of-a-binary-tree.md
 
 
successful-pairs-of-spells-and-potions.md
successful-pairs-of-spells-and-potions.md
 
 
sum-of-absolute-differences-in-a-sorted-array.md
sum-of-absolute-differences-in-a-sorted-array.md
 
 
sum-of-all-subset-xor-totals.md
sum-of-all-subset-xor-totals.md
 
 
sum-of-subarray-minimums.md
sum-of-subarray-minimums.md
 
 
sum-of-two-integers.md
sum-of-two-integers.md
 
 
sum-root-to-leaf-numbers.md
sum-root-to-leaf-numbers.md
 
 
surrounded-regions.md
surrounded-regions.md
 
 
swap-nodes-in-pairs.md
swap-nodes-in-pairs.md
 
 
swapping-nodes-in-a-linked-list.md
swapping-nodes-in-a-linked-list.md
 
 
swim-in-rising-water.md
swim-in-rising-water.md
 
 
symmetric-tree.md
symmetric-tree.md
 
 
target-sum.md
target-sum.md
 
 
task-scheduling.md
task-scheduling.md
 
 
text-justification.md
text-justification.md
 
 
the-number-of-beautiful-subsets.md
the-number-of-beautiful-subsets.md
 
 
three-integer-sum.md
three-integer-sum.md
 
 
time-based-key-value-store.md
time-based-key-value-store.md
 
 
time-needed-to-buy-tickets.md
time-needed-to-buy-tickets.md
 
 
time-needed-to-inform-all-employees.md
time-needed-to-inform-all-employees.md
 
 
top-k-elements-in-list.md
top-k-elements-in-list.md
 
 
transpose-matrix.md
transpose-matrix.md
 
 
trapping-rain-water.md
trapping-rain-water.md
 
 
triangle.md
triangle.md
 
 
trim-a-binary-search-tree.md
trim-a-binary-search-tree.md
 
 
two-city-scheduling.md
two-city-scheduling.md
 
 
two-integer-sum-ii.md
two-integer-sum-ii.md
 
 
two-integer-sum.md
two-integer-sum.md
 
 
ugly-number.md
ugly-number.md
 
 
uncrossed-lines.md
uncrossed-lines.md
 
 
unique-binary-search-trees-ii.md
unique-binary-search-trees-ii.md
 
 
unique-binary-search-trees.md
unique-binary-search-trees.md
 
 
unique-email-addresses.md
unique-email-addresses.md
 
 
unique-length-3-palindromic-subsequences.md
unique-length-3-palindromic-subsequences.md
 
 
unique-paths-ii.md
unique-paths-ii.md
 
 
valid-binary-search-tree.md
valid-binary-search-tree.md
 
 
valid-palindrome-ii.md
valid-palindrome-ii.md
 
 
valid-parenthesis-string.md
valid-parenthesis-string.md
 
 
valid-perfect-square.md
valid-perfect-square.md
 
 
valid-sudoku.md
valid-sudoku.md
 
 
valid-tree.md
valid-tree.md
 
 
validate-binary-tree-nodes.md
validate-binary-tree-nodes.md
 
 
validate-parentheses.md
validate-parentheses.md
 
 
validate-stack-sequences.md
validate-stack-sequences.md
 
 
verifying-an-alien-dictionary.md
verifying-an-alien-dictionary.md
 
 
widest-vertical-area-between-two-points-containing-no-points.md
widest-vertical-area-between-two-points-containing-no-points.md
 
 
wiggle-sort.md
wiggle-sort.md
 
 
word-break-ii.md
word-break-ii.md
 
 
word-break.md
word-break.md
 
 
word-ladder.md
word-ladder.md
 
 
word-pattern.md
word-pattern.md
 
 
zigzag-conversion.md
zigzag-conversion.md
 
 

README.md

Article Guide

  1. Each article should be written in markdown. Exanple: duplicate-integer.md
  2. At least one solution should be similar to a solution present in the NeetCode video. Ideally all solutions from the video are present.
  3. Add time & space complexity
  4. Cover all relevant solutions if possible.