LeetCode-Solutions

LeetCode Topics

Array

0001-two-sum
0056-merge-intervals
0063-unique-paths-ii
0064-minimum-path-sum
0075-sort-colors
0088-merge-sorted-array
0121-best-time-to-buy-and-sell-stock
0128-longest-consecutive-sequence
0189-rotate-array
0268-missing-number
0283-move-zeroes
0455-assign-cookies
0485-max-consecutive-ones
0493-reverse-pairs
0560-subarray-sum-equals-k
0966-binary-subarrays-with-sum
1034-subarrays-with-k-different-integers
1046-max-consecutive-ones-iii
1370-count-number-of-nice-subarrays
1435-xor-queries-of-a-subarray
1538-maximum-points-you-can-obtain-from-cards

Binary Search

0268-missing-number
0493-reverse-pairs
1046-max-consecutive-ones-iii

Sliding Window

0076-minimum-window-substring
0424-longest-repeating-character-replacement
0966-binary-subarrays-with-sum
1034-subarrays-with-k-different-integers
1046-max-consecutive-ones-iii
1370-count-number-of-nice-subarrays
1460-number-of-substrings-containing-all-three-characters
1538-maximum-points-you-can-obtain-from-cards

Prefix Sum

0560-subarray-sum-equals-k
0966-binary-subarrays-with-sum
1046-max-consecutive-ones-iii
1370-count-number-of-nice-subarrays
1435-xor-queries-of-a-subarray
1538-maximum-points-you-can-obtain-from-cards

Hash Table

0001-two-sum
0076-minimum-window-substring
0128-longest-consecutive-sequence
0268-missing-number
0424-longest-repeating-character-replacement
0560-subarray-sum-equals-k
0653-two-sum-iv-input-is-a-bst
0966-binary-subarrays-with-sum
1034-subarrays-with-k-different-integers
1370-count-number-of-nice-subarrays
1460-number-of-substrings-containing-all-three-characters

String

0076-minimum-window-substring
0424-longest-repeating-character-replacement
0957-minimum-add-to-make-parentheses-valid
1460-number-of-substrings-containing-all-three-characters

Math

0062-unique-paths
0189-rotate-array
0268-missing-number
1370-count-number-of-nice-subarrays

Two Pointers

0075-sort-colors
0088-merge-sorted-array
0189-rotate-array
0283-move-zeroes
0455-assign-cookies
0653-two-sum-iv-input-is-a-bst

Stack

0144-binary-tree-preorder-traversal
0145-binary-tree-postorder-traversal
0957-minimum-add-to-make-parentheses-valid

Greedy

0455-assign-cookies
0957-minimum-add-to-make-parentheses-valid

Counting

1034-subarrays-with-k-different-integers

Bit Manipulation

0268-missing-number
1435-xor-queries-of-a-subarray

Sorting

0056-merge-intervals
0075-sort-colors
0088-merge-sorted-array
0268-missing-number
0455-assign-cookies

Divide and Conquer

0493-reverse-pairs

Binary Indexed Tree

0493-reverse-pairs

Segment Tree

0493-reverse-pairs

Merge Sort

0493-reverse-pairs

Ordered Set

0493-reverse-pairs

Dynamic Programming

0062-unique-paths
0063-unique-paths-ii
0064-minimum-path-sum
0121-best-time-to-buy-and-sell-stock

Combinatorics

0062-unique-paths

Matrix

0063-unique-paths-ii
0064-minimum-path-sum

Tree

0098-validate-binary-search-tree
0099-recover-binary-search-tree
0102-binary-tree-level-order-traversal
0144-binary-tree-preorder-traversal
0145-binary-tree-postorder-traversal
0230-kth-smallest-element-in-a-bst
0235-lowest-common-ancestor-of-a-binary-search-tree
0450-delete-node-in-a-bst
0653-two-sum-iv-input-is-a-bst
0783-search-in-a-binary-search-tree
0784-insert-into-a-binary-search-tree

Binary Search Tree

0098-validate-binary-search-tree
0099-recover-binary-search-tree
0230-kth-smallest-element-in-a-bst
0235-lowest-common-ancestor-of-a-binary-search-tree
0450-delete-node-in-a-bst
0653-two-sum-iv-input-is-a-bst
0783-search-in-a-binary-search-tree
0784-insert-into-a-binary-search-tree

Binary Tree

0098-validate-binary-search-tree
0099-recover-binary-search-tree
0102-binary-tree-level-order-traversal
0144-binary-tree-preorder-traversal
0145-binary-tree-postorder-traversal
0230-kth-smallest-element-in-a-bst
0235-lowest-common-ancestor-of-a-binary-search-tree
0450-delete-node-in-a-bst
0653-two-sum-iv-input-is-a-bst
0783-search-in-a-binary-search-tree
0784-insert-into-a-binary-search-tree

Depth-First Search

0098-validate-binary-search-tree
0099-recover-binary-search-tree
0144-binary-tree-preorder-traversal
0145-binary-tree-postorder-traversal
0230-kth-smallest-element-in-a-bst
0235-lowest-common-ancestor-of-a-binary-search-tree
0653-two-sum-iv-input-is-a-bst

Breadth-First Search

0102-binary-tree-level-order-traversal
0653-two-sum-iv-input-is-a-bst

Union Find

0128-longest-consecutive-sequence