leetcode

A collection of LeetCode questions to ace the coding interview! - Created using LeetHub v2

LeetCode Topics

Stack

0020-valid-parentheses
0094-binary-tree-inorder-traversal
0114-flatten-binary-tree-to-linked-list
0144-binary-tree-preorder-traversal
0145-binary-tree-postorder-traversal
0155-min-stack
0234-palindrome-linked-list
0496-next-greater-element-i
0503-next-greater-element-ii
0654-maximum-binary-tree
0678-valid-parenthesis-string
0776-n-ary-tree-postorder-traversal
0933-increasing-order-search-tree
1050-construct-binary-search-tree-from-preorder-traversal

Design

0155-min-stack
0297-serialize-and-deserialize-binary-tree
0449-serialize-and-deserialize-bst
1387-find-elements-in-a-contaminated-binary-tree

Tree

0094-binary-tree-inorder-traversal
0098-validate-binary-search-tree
0100-same-tree
0101-symmetric-tree
0102-binary-tree-level-order-traversal
0103-binary-tree-zigzag-level-order-traversal
0104-maximum-depth-of-binary-tree
0105-construct-binary-tree-from-preorder-and-inorder-traversal
0106-construct-binary-tree-from-inorder-and-postorder-traversal
0107-binary-tree-level-order-traversal-ii
0108-convert-sorted-array-to-binary-search-tree
0109-convert-sorted-list-to-binary-search-tree
0110-balanced-binary-tree
0111-minimum-depth-of-binary-tree
0112-path-sum
0113-path-sum-ii
0114-flatten-binary-tree-to-linked-list
0124-binary-tree-maximum-path-sum
0129-sum-root-to-leaf-numbers
0144-binary-tree-preorder-traversal
0145-binary-tree-postorder-traversal
0199-binary-tree-right-side-view
0222-count-complete-tree-nodes
0226-invert-binary-tree
0230-kth-smallest-element-in-a-bst
0235-lowest-common-ancestor-of-a-binary-search-tree
0236-lowest-common-ancestor-of-a-binary-tree
0257-binary-tree-paths
0297-serialize-and-deserialize-binary-tree
0404-sum-of-left-leaves
0437-path-sum-iii
0449-serialize-and-deserialize-bst
0501-find-mode-in-binary-search-tree
0508-most-frequent-subtree-sum
0513-find-bottom-left-tree-value
0515-find-largest-value-in-each-tree-row
0530-minimum-absolute-difference-in-bst
0538-convert-bst-to-greater-tree
0543-diameter-of-binary-tree
0572-subtree-of-another-tree
0606-construct-string-from-binary-tree
0617-merge-two-binary-trees
0623-add-one-row-to-tree
0637-average-of-levels-in-binary-tree
0654-maximum-binary-tree
0662-maximum-width-of-binary-tree
0671-second-minimum-node-in-a-binary-tree
0764-n-ary-tree-level-order-traversal
0776-n-ary-tree-postorder-traversal
0783-search-in-a-binary-search-tree
0784-insert-into-a-binary-search-tree
0799-minimum-distance-between-bst-nodes
0893-all-nodes-distance-k-in-binary-tree
0904-leaf-similar-trees
0933-increasing-order-search-tree
1005-univalued-binary-tree
1029-vertical-order-traversal-of-a-binary-tree
1030-smallest-string-starting-from-leaf
1035-cousins-in-binary-tree
1050-construct-binary-search-tree-from-preorder-traversal
1079-sum-of-root-to-leaf-binary-numbers
1092-maximum-difference-between-node-and-ancestor
1114-binary-search-tree-to-greater-sum-tree
1116-maximum-level-sum-of-a-binary-tree
1285-balance-a-binary-search-tree
1387-find-elements-in-a-contaminated-binary-tree
1544-count-good-nodes-in-binary-tree
1731-even-odd-tree
2306-create-binary-tree-from-descriptions
2384-root-equals-sum-of-children
2461-amount-of-time-for-binary-tree-to-be-infected
2493-reverse-odd-levels-of-binary-tree
2558-minimum-number-of-operations-to-sort-a-binary-tree-by-level
2567-closest-nodes-queries-in-a-binary-search-tree
2646-kth-largest-sum-in-a-binary-tree
3509-k-th-largest-perfect-subtree-size-in-binary-tree

Depth-First Search

0094-binary-tree-inorder-traversal
0098-validate-binary-search-tree
0100-same-tree
0101-symmetric-tree
0104-maximum-depth-of-binary-tree
0110-balanced-binary-tree
0111-minimum-depth-of-binary-tree
0112-path-sum
0113-path-sum-ii
0114-flatten-binary-tree-to-linked-list
0124-binary-tree-maximum-path-sum
0129-sum-root-to-leaf-numbers
0144-binary-tree-preorder-traversal
0145-binary-tree-postorder-traversal
0199-binary-tree-right-side-view
0226-invert-binary-tree
0230-kth-smallest-element-in-a-bst
0235-lowest-common-ancestor-of-a-binary-search-tree
0236-lowest-common-ancestor-of-a-binary-tree
0257-binary-tree-paths
0297-serialize-and-deserialize-binary-tree
0404-sum-of-left-leaves
0437-path-sum-iii
0449-serialize-and-deserialize-bst
0501-find-mode-in-binary-search-tree
0508-most-frequent-subtree-sum
0513-find-bottom-left-tree-value
0515-find-largest-value-in-each-tree-row
0530-minimum-absolute-difference-in-bst
0538-convert-bst-to-greater-tree
0543-diameter-of-binary-tree
0572-subtree-of-another-tree
0606-construct-string-from-binary-tree
0617-merge-two-binary-trees
0623-add-one-row-to-tree
0637-average-of-levels-in-binary-tree
0662-maximum-width-of-binary-tree
0671-second-minimum-node-in-a-binary-tree
0776-n-ary-tree-postorder-traversal
0799-minimum-distance-between-bst-nodes
0893-all-nodes-distance-k-in-binary-tree
0904-leaf-similar-trees
0933-increasing-order-search-tree
1005-univalued-binary-tree
1029-vertical-order-traversal-of-a-binary-tree
1030-smallest-string-starting-from-leaf
1035-cousins-in-binary-tree
1079-sum-of-root-to-leaf-binary-numbers
1092-maximum-difference-between-node-and-ancestor
1114-binary-search-tree-to-greater-sum-tree
1116-maximum-level-sum-of-a-binary-tree
1285-balance-a-binary-search-tree
1387-find-elements-in-a-contaminated-binary-tree
1428-jump-game-iii
1544-count-good-nodes-in-binary-tree
2461-amount-of-time-for-binary-tree-to-be-infected
2493-reverse-odd-levels-of-binary-tree
2567-closest-nodes-queries-in-a-binary-search-tree
3509-k-th-largest-perfect-subtree-size-in-binary-tree

Binary Tree

0094-binary-tree-inorder-traversal
0098-validate-binary-search-tree
0100-same-tree
0101-symmetric-tree
0102-binary-tree-level-order-traversal
0103-binary-tree-zigzag-level-order-traversal
0104-maximum-depth-of-binary-tree
0105-construct-binary-tree-from-preorder-and-inorder-traversal
0106-construct-binary-tree-from-inorder-and-postorder-traversal
0107-binary-tree-level-order-traversal-ii
0108-convert-sorted-array-to-binary-search-tree
0109-convert-sorted-list-to-binary-search-tree
0110-balanced-binary-tree
0111-minimum-depth-of-binary-tree
0112-path-sum
0113-path-sum-ii
0114-flatten-binary-tree-to-linked-list
0124-binary-tree-maximum-path-sum
0129-sum-root-to-leaf-numbers
0144-binary-tree-preorder-traversal
0145-binary-tree-postorder-traversal
0199-binary-tree-right-side-view
0222-count-complete-tree-nodes
0226-invert-binary-tree
0230-kth-smallest-element-in-a-bst
0235-lowest-common-ancestor-of-a-binary-search-tree
0236-lowest-common-ancestor-of-a-binary-tree
0257-binary-tree-paths
0297-serialize-and-deserialize-binary-tree
0404-sum-of-left-leaves
0437-path-sum-iii
0449-serialize-and-deserialize-bst
0501-find-mode-in-binary-search-tree
0508-most-frequent-subtree-sum
0513-find-bottom-left-tree-value
0515-find-largest-value-in-each-tree-row
0530-minimum-absolute-difference-in-bst
0538-convert-bst-to-greater-tree
0543-diameter-of-binary-tree
0572-subtree-of-another-tree
0606-construct-string-from-binary-tree
0617-merge-two-binary-trees
0623-add-one-row-to-tree
0637-average-of-levels-in-binary-tree
0654-maximum-binary-tree
0662-maximum-width-of-binary-tree
0671-second-minimum-node-in-a-binary-tree
0783-search-in-a-binary-search-tree
0784-insert-into-a-binary-search-tree
0799-minimum-distance-between-bst-nodes
0893-all-nodes-distance-k-in-binary-tree
0904-leaf-similar-trees
0933-increasing-order-search-tree
1005-univalued-binary-tree
1029-vertical-order-traversal-of-a-binary-tree
1030-smallest-string-starting-from-leaf
1035-cousins-in-binary-tree
1050-construct-binary-search-tree-from-preorder-traversal
1079-sum-of-root-to-leaf-binary-numbers
1092-maximum-difference-between-node-and-ancestor
1114-binary-search-tree-to-greater-sum-tree
1116-maximum-level-sum-of-a-binary-tree
1285-balance-a-binary-search-tree
1387-find-elements-in-a-contaminated-binary-tree
1544-count-good-nodes-in-binary-tree
1731-even-odd-tree
2306-create-binary-tree-from-descriptions
2384-root-equals-sum-of-children
2461-amount-of-time-for-binary-tree-to-be-infected
2493-reverse-odd-levels-of-binary-tree
2558-minimum-number-of-operations-to-sort-a-binary-tree-by-level
2567-closest-nodes-queries-in-a-binary-search-tree
2646-kth-largest-sum-in-a-binary-tree
3509-k-th-largest-perfect-subtree-size-in-binary-tree

Breadth-First Search

0100-same-tree
0101-symmetric-tree
0102-binary-tree-level-order-traversal
0103-binary-tree-zigzag-level-order-traversal
0104-maximum-depth-of-binary-tree
0107-binary-tree-level-order-traversal-ii
0111-minimum-depth-of-binary-tree
0112-path-sum
0199-binary-tree-right-side-view
0226-invert-binary-tree
0297-serialize-and-deserialize-binary-tree
0322-coin-change
0404-sum-of-left-leaves
0449-serialize-and-deserialize-bst
0513-find-bottom-left-tree-value
0515-find-largest-value-in-each-tree-row
0530-minimum-absolute-difference-in-bst
0617-merge-two-binary-trees
0623-add-one-row-to-tree
0637-average-of-levels-in-binary-tree
0662-maximum-width-of-binary-tree
0764-n-ary-tree-level-order-traversal
0799-minimum-distance-between-bst-nodes
0893-all-nodes-distance-k-in-binary-tree
1005-univalued-binary-tree
1029-vertical-order-traversal-of-a-binary-tree
1035-cousins-in-binary-tree
1116-maximum-level-sum-of-a-binary-tree
1387-find-elements-in-a-contaminated-binary-tree
1428-jump-game-iii
1544-count-good-nodes-in-binary-tree
1731-even-odd-tree
2461-amount-of-time-for-binary-tree-to-be-infected
2493-reverse-odd-levels-of-binary-tree
2558-minimum-number-of-operations-to-sort-a-binary-tree-by-level
2646-kth-largest-sum-in-a-binary-tree

Binary Search

0033-search-in-rotated-sorted-array
0034-find-first-and-last-position-of-element-in-sorted-array
0035-search-insert-position
0069-sqrtx
0074-search-a-2d-matrix
0081-search-in-rotated-sorted-array-ii
0153-find-minimum-in-rotated-sorted-array
0162-find-peak-element
0167-two-sum-ii-input-array-is-sorted
0222-count-complete-tree-nodes
0240-search-a-2d-matrix-ii
0268-missing-number
0287-find-the-duplicate-number
0349-intersection-of-two-arrays
0367-valid-perfect-square
0410-split-array-largest-sum
0532-k-diff-pairs-in-an-array
0540-single-element-in-a-sorted-array
0907-koko-eating-bananas
0910-nth-magical-number
1056-capacity-to-ship-packages-within-d-days
1605-minimum-number-of-days-to-make-m-bouquets
1646-kth-missing-positive-number
2567-closest-nodes-queries-in-a-binary-search-tree

Bit Manipulation

0078-subsets
0090-subsets-ii
0136-single-number
0222-count-complete-tree-nodes
0231-power-of-two
0268-missing-number
0287-find-the-duplicate-number
0342-power-of-four
0397-integer-replacement
0491-non-decreasing-subsequences

Dynamic Programming

0005-longest-palindromic-substring
0022-generate-parentheses
0053-maximum-subarray
0055-jump-game
0062-unique-paths
0064-minimum-path-sum
0070-climbing-stairs
0072-edit-distance
0091-decode-ways
0118-pascals-triangle
0119-pascals-triangle-ii
0121-best-time-to-buy-and-sell-stock
0124-binary-tree-maximum-path-sum
0131-palindrome-partitioning
0198-house-robber
0322-coin-change
0392-is-subsequence
0397-integer-replacement
0410-split-array-largest-sum
0416-partition-equal-subset-sum
0516-longest-palindromic-subsequence
0518-coin-change-ii
0583-delete-operation-for-two-strings
0647-palindromic-substrings
0678-valid-parenthesis-string
0747-min-cost-climbing-stairs
1250-longest-common-subsequence
1437-minimum-insertion-steps-to-make-a-string-palindrome
3106-length-of-the-longest-subsequence-that-sums-to-target

Array

0001-two-sum
0014-longest-common-prefix
0026-remove-duplicates-from-sorted-array
0031-next-permutation
0033-search-in-rotated-sorted-array
0034-find-first-and-last-position-of-element-in-sorted-array
0035-search-insert-position
0039-combination-sum
0046-permutations
0047-permutations-ii
0048-rotate-image
0053-maximum-subarray
0054-spiral-matrix
0055-jump-game
0059-spiral-matrix-ii
0064-minimum-path-sum
0074-search-a-2d-matrix
0075-sort-colors
0078-subsets
0081-search-in-rotated-sorted-array-ii
0088-merge-sorted-array
0090-subsets-ii
0105-construct-binary-tree-from-preorder-and-inorder-traversal
0106-construct-binary-tree-from-inorder-and-postorder-traversal
0108-convert-sorted-array-to-binary-search-tree
0118-pascals-triangle
0119-pascals-triangle-ii
0121-best-time-to-buy-and-sell-stock
0128-longest-consecutive-sequence
0135-candy
0136-single-number
0153-find-minimum-in-rotated-sorted-array
0162-find-peak-element
0167-two-sum-ii-input-array-is-sorted
0169-majority-element
0189-rotate-array
0198-house-robber
0216-combination-sum-iii
0217-contains-duplicate
0229-majority-element-ii
0240-search-a-2d-matrix-ii
0268-missing-number
0283-move-zeroes
0287-find-the-duplicate-number
0322-coin-change
0349-intersection-of-two-arrays
0410-split-array-largest-sum
0414-third-maximum-number
0416-partition-equal-subset-sum
0442-find-all-duplicates-in-an-array
0480-sliding-window-median
0485-max-consecutive-ones
0491-non-decreasing-subsequences
0496-next-greater-element-i
0503-next-greater-element-ii
0518-coin-change-ii
0532-k-diff-pairs-in-an-array
0540-single-element-in-a-sorted-array
0560-subarray-sum-equals-k
0654-maximum-binary-tree
0747-min-cost-climbing-stairs
0907-koko-eating-bananas
1050-construct-binary-search-tree-from-preorder-traversal
1056-capacity-to-ship-packages-within-d-days
1428-jump-game-iii
1605-minimum-number-of-days-to-make-m-bouquets
1646-kth-missing-positive-number
1878-check-if-array-is-sorted-and-rotated
2015-determine-whether-matrix-can-be-obtained-by-rotation
2048-build-array-from-permutation
2231-find-first-palindromic-string-in-the-array
2271-rearrange-array-elements-by-sign
2306-create-binary-tree-from-descriptions
2432-number-of-zero-filled-subarrays
2552-maximum-sum-of-distinct-subarrays-with-length-k
2567-closest-nodes-queries-in-a-binary-search-tree
2844-sum-of-squares-of-special-elements
3106-length-of-the-longest-subsequence-that-sums-to-target

Two Pointers

0005-longest-palindromic-substring
0019-remove-nth-node-from-end-of-list
0026-remove-duplicates-from-sorted-array
0028-find-the-index-of-the-first-occurrence-in-a-string
0031-next-permutation
0061-rotate-list
0075-sort-colors
0088-merge-sorted-array
0125-valid-palindrome
0141-linked-list-cycle
0142-linked-list-cycle-ii
0148-sort-list
0151-reverse-words-in-a-string
0160-intersection-of-two-linked-lists
0167-two-sum-ii-input-array-is-sorted
0189-rotate-array
0234-palindrome-linked-list
0283-move-zeroes
0287-find-the-duplicate-number
0344-reverse-string
0345-reverse-vowels-of-a-string
0349-intersection-of-two-arrays
0392-is-subsequence
0532-k-diff-pairs-in-an-array
0541-reverse-string-ii
0557-reverse-words-in-a-string-iii
0647-palindromic-substrings
0908-middle-of-the-linked-list
1454-remove-palindromic-subsequences
2216-delete-the-middle-node-of-a-linked-list
2231-find-first-palindromic-string-in-the-array
2271-rearrange-array-elements-by-sign

Hash Table

0001-two-sum
0003-longest-substring-without-repeating-characters
0012-integer-to-roman
0013-roman-to-integer
0017-letter-combinations-of-a-phone-number
0105-construct-binary-tree-from-preorder-and-inorder-traversal
0106-construct-binary-tree-from-inorder-and-postorder-traversal
0128-longest-consecutive-sequence
0141-linked-list-cycle
0142-linked-list-cycle-ii
0160-intersection-of-two-linked-lists
0169-majority-element
0217-contains-duplicate
0229-majority-element-ii
0242-valid-anagram
0268-missing-number
0290-word-pattern
0349-intersection-of-two-arrays
0409-longest-palindrome
0442-find-all-duplicates-in-an-array
0480-sliding-window-median
0491-non-decreasing-subsequences
0496-next-greater-element-i
0508-most-frequent-subtree-sum
0532-k-diff-pairs-in-an-array
0560-subarray-sum-equals-k
0893-all-nodes-distance-k-in-binary-tree
1029-vertical-order-traversal-of-a-binary-tree
1387-find-elements-in-a-contaminated-binary-tree
2306-create-binary-tree-from-descriptions
2461-amount-of-time-for-binary-tree-to-be-infected
2552-maximum-sum-of-distinct-subarrays-with-length-k
3412-permutation-difference-between-two-strings

String

0003-longest-substring-without-repeating-characters
0005-longest-palindromic-substring
0012-integer-to-roman
0013-roman-to-integer
0014-longest-common-prefix
0017-letter-combinations-of-a-phone-number
0020-valid-parentheses
0022-generate-parentheses
0028-find-the-index-of-the-first-occurrence-in-a-string
0072-edit-distance
0091-decode-ways
0125-valid-palindrome
0131-palindrome-partitioning
0151-reverse-words-in-a-string
0242-valid-anagram
0257-binary-tree-paths
0290-word-pattern
0297-serialize-and-deserialize-binary-tree
0344-reverse-string
0345-reverse-vowels-of-a-string
0392-is-subsequence
0409-longest-palindrome
0412-fizz-buzz
0434-number-of-segments-in-a-string
0449-serialize-and-deserialize-bst
0516-longest-palindromic-subsequence
0520-detect-capital
0541-reverse-string-ii
0557-reverse-words-in-a-string-iii
0583-delete-operation-for-two-strings
0606-construct-string-from-binary-tree
0647-palindromic-substrings
0657-robot-return-to-origin
0678-valid-parenthesis-string
0742-to-lower-case
1030-smallest-string-starting-from-leaf
1250-longest-common-subsequence
1302-delete-characters-to-make-fancy-string
1437-minimum-insertion-steps-to-make-a-string-palindrome
1454-remove-palindromic-subsequences
2032-largest-odd-number-in-string
2231-find-first-palindromic-string-in-the-array
2235-capitalize-the-title
3412-permutation-difference-between-two-strings

Sliding Window

0003-longest-substring-without-repeating-characters
0480-sliding-window-median
2552-maximum-sum-of-distinct-subarrays-with-length-k

Greedy

0055-jump-game
0135-candy
0397-integer-replacement
0409-longest-palindrome
0410-split-array-largest-sum
0678-valid-parenthesis-string
1285-balance-a-binary-search-tree
1448-maximum-69-number
2032-largest-odd-number-in-string

Sorting

0047-permutations-ii
0075-sort-colors
0088-merge-sorted-array
0148-sort-list
0169-majority-element
0217-contains-duplicate
0229-majority-element-ii
0242-valid-anagram
0268-missing-number
0349-intersection-of-two-arrays
0414-third-maximum-number
0532-k-diff-pairs-in-an-array
1029-vertical-order-traversal-of-a-binary-tree
2646-kth-largest-sum-in-a-binary-tree
3509-k-th-largest-perfect-subtree-size-in-binary-tree

Trie

0014-longest-common-prefix

Simulation

0054-spiral-matrix
0059-spiral-matrix-ii
0412-fizz-buzz
0657-robot-return-to-origin
2048-build-array-from-permutation
2271-rearrange-array-elements-by-sign

Math

0007-reverse-integer
0009-palindrome-number
0012-integer-to-roman
0013-roman-to-integer
0048-rotate-image
0050-powx-n
0060-permutation-sequence
0062-unique-paths
0069-sqrtx
0070-climbing-stairs
0189-rotate-array
0231-power-of-two
0268-missing-number
0326-power-of-three
0342-power-of-four
0367-valid-perfect-square
0412-fizz-buzz
0507-perfect-number
0910-nth-magical-number
1448-maximum-69-number
2032-largest-odd-number-in-string
2432-number-of-zero-filled-subarrays

Backtracking

0017-letter-combinations-of-a-phone-number
0022-generate-parentheses
0039-combination-sum
0046-permutations
0047-permutations-ii
0078-subsets
0090-subsets-ii
0113-path-sum-ii
0131-palindrome-partitioning
0216-combination-sum-iii
0257-binary-tree-paths
0491-non-decreasing-subsequences
1030-smallest-string-starting-from-leaf

String Matching

0028-find-the-index-of-the-first-occurrence-in-a-string
0572-subtree-of-another-tree

Divide and Conquer

0053-maximum-subarray
0105-construct-binary-tree-from-preorder-and-inorder-traversal
0106-construct-binary-tree-from-inorder-and-postorder-traversal
0108-convert-sorted-array-to-binary-search-tree
0109-convert-sorted-list-to-binary-search-tree
0148-sort-list
0169-majority-element
0240-search-a-2d-matrix-ii
0654-maximum-binary-tree
1285-balance-a-binary-search-tree

Counting

0169-majority-element
0229-majority-element-ii

Recursion

0021-merge-two-sorted-lists
0050-powx-n
0060-permutation-sequence
0206-reverse-linked-list
0231-power-of-two
0234-palindrome-linked-list
0326-power-of-three
0342-power-of-four

Union Find

0128-longest-consecutive-sequence

Prefix Sum

0410-split-array-largest-sum
0560-subarray-sum-equals-k

Matrix

0048-rotate-image
0054-spiral-matrix
0059-spiral-matrix-ii
0064-minimum-path-sum
0074-search-a-2d-matrix
0240-search-a-2d-matrix-ii
2015-determine-whether-matrix-can-be-obtained-by-rotation

Enumeration

2844-sum-of-squares-of-special-elements

Linked List

0019-remove-nth-node-from-end-of-list
0021-merge-two-sorted-lists
0061-rotate-list
0083-remove-duplicates-from-sorted-list
0109-convert-sorted-list-to-binary-search-tree
0114-flatten-binary-tree-to-linked-list
0141-linked-list-cycle
0142-linked-list-cycle-ii
0148-sort-list
0160-intersection-of-two-linked-lists
0206-reverse-linked-list
0234-palindrome-linked-list
0237-delete-node-in-a-linked-list
0908-middle-of-the-linked-list
2216-delete-the-middle-node-of-a-linked-list

Binary Search Tree

0098-validate-binary-search-tree
0108-convert-sorted-array-to-binary-search-tree
0109-convert-sorted-list-to-binary-search-tree
0230-kth-smallest-element-in-a-bst
0235-lowest-common-ancestor-of-a-binary-search-tree
0449-serialize-and-deserialize-bst
0501-find-mode-in-binary-search-tree
0530-minimum-absolute-difference-in-bst
0538-convert-bst-to-greater-tree
0783-search-in-a-binary-search-tree
0784-insert-into-a-binary-search-tree
0799-minimum-distance-between-bst-nodes
0933-increasing-order-search-tree
1050-construct-binary-search-tree-from-preorder-traversal
1114-binary-search-tree-to-greater-sum-tree
1285-balance-a-binary-search-tree
2567-closest-nodes-queries-in-a-binary-search-tree

Hash Function

0572-subtree-of-another-tree

Monotonic Stack

0496-next-greater-element-i
0503-next-greater-element-ii
0654-maximum-binary-tree
1050-construct-binary-search-tree-from-preorder-traversal

Merge Sort

0148-sort-list

Memoization

0070-climbing-stairs
0397-integer-replacement

Combinatorics

0062-unique-paths

Heap (Priority Queue)

0480-sliding-window-median