leetcode_question

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

LeetCode Topics

Hash Table

0001-two-sum
0003-longest-substring-without-repeating-characters
0013-roman-to-integer
0017-letter-combinations-of-a-phone-number
0141-linked-list-cycle
0169-majority-element
0205-isomorphic-strings
0242-valid-anagram
0268-missing-number
0496-next-greater-element-i
0865-smallest-subtree-with-all-the-deepest-nodes
1461-check-if-a-string-contains-all-binary-codes-of-size-k
1512-number-of-good-pairs
1525-number-of-good-ways-to-split-a-string
2975-maximum-square-area-by-removing-fences-from-a-field
3013-divide-an-array-into-subarrays-with-minimum-cost-ii
3381-maximum-subarray-sum-with-length-divisible-by-k
3510-minimum-pair-removal-to-sort-array-ii
3713-longest-balanced-substring-i
3714-longest-balanced-substring-ii
3721-longest-balanced-subarray-ii

String

0003-longest-substring-without-repeating-characters
0013-roman-to-integer
0014-longest-common-prefix
0017-letter-combinations-of-a-phone-number
0020-valid-parentheses
0067-add-binary
0151-reverse-words-in-a-string
0205-isomorphic-strings
0242-valid-anagram
0344-reverse-string
0474-ones-and-zeroes
0696-count-binary-substrings
0712-minimum-ascii-delete-sum-for-two-strings
0844-backspace-string-compare
0921-minimum-add-to-make-parentheses-valid
1404-number-of-steps-to-reduce-a-number-in-binary-representation-to-one
1461-check-if-a-string-contains-all-binary-codes-of-size-k
1525-number-of-good-ways-to-split-a-string
1541-minimum-insertions-to-balance-a-parentheses-string
1653-minimum-deletions-to-make-string-balanced
1903-largest-odd-number-in-string
2976-minimum-cost-to-convert-string-i
3713-longest-balanced-substring-i
3714-longest-balanced-substring-ii

Sliding Window

0003-longest-substring-without-repeating-characters
1984-minimum-difference-between-highest-and-lowest-of-k-scores
2618-maximize-the-minimum-powered-city
3013-divide-an-array-into-subarrays-with-minimum-cost-ii

Array

0001-two-sum
0011-container-with-most-water
0014-longest-common-prefix
0015-3sum
0016-3sum-closest
0018-4sum
0034-find-first-and-last-position-of-element-in-sorted-array
0035-search-insert-position
0053-maximum-subarray
0085-maximal-rectangle
0088-merge-sorted-array
0167-two-sum-ii-input-array-is-sorted
0169-majority-element
0189-rotate-array
0238-product-of-array-except-self
0268-missing-number
0283-move-zeroes
0474-ones-and-zeroes
0485-max-consecutive-ones
0496-next-greater-element-i
0704-binary-search
0724-find-pivot-index
0739-daily-temperatures
0744-find-smallest-letter-greater-than-target
0852-peak-index-in-a-mountain-array
1046-last-stone-weight
1200-minimum-absolute-difference
1266-minimum-time-visiting-all-points
1292-maximum-side-length-of-a-square-with-sum-less-than-or-equal-to-threshold
1356-sort-integers-by-the-number-of-1-bits
1390-four-divisors
1458-max-dot-product-of-two-subsequences
1512-number-of-good-pairs
1536-minimum-swaps-to-arrange-a-binary-grid
1588-sum-of-all-odd-length-subarrays
1727-largest-submatrix-with-rearrangements
1878-get-biggest-three-rhombus-sums-in-a-grid
1895-largest-magic-square
1975-maximum-matrix-sum
1984-minimum-difference-between-highest-and-lowest-of-k-scores
2073-time-needed-to-buy-tickets
2435-paths-in-matrix-whose-sum-is-divisible-by-k
2618-maximize-the-minimum-powered-city
2753-minimum-number-of-operations-to-make-all-array-elements-equal-to-1
2943-maximize-area-of-square-hole-in-grid
2975-maximum-square-area-by-removing-fences-from-a-field
2976-minimum-cost-to-convert-string-i
3010-divide-an-array-into-subarrays-with-minimum-cost-i
3013-divide-an-array-into-subarrays-with-minimum-cost-ii
3047-find-the-largest-area-of-square-inside-two-rectangles
3296-minimum-number-of-seconds-to-make-mountain-height-zero
3315-construct-the-minimum-bitwise-array-ii
3379-transformed-array
3381-maximum-subarray-sum-with-length-divisible-by-k
3453-separate-squares-i
3454-separate-squares-ii
3510-minimum-pair-removal-to-sort-array-ii
3637-trionic-array-i
3640-trionic-array-ii
3651-minimum-cost-path-with-teleportations
3721-longest-balanced-subarray-ii

Binary Search

0034-find-first-and-last-position-of-element-in-sorted-array
0035-search-insert-position
0167-two-sum-ii-input-array-is-sorted
0268-missing-number
0704-binary-search
0744-find-smallest-letter-greater-than-target
0852-peak-index-in-a-mountain-array
1292-maximum-side-length-of-a-square-with-sum-less-than-or-equal-to-threshold
2618-maximize-the-minimum-powered-city
3296-minimum-number-of-seconds-to-make-mountain-height-zero
3453-separate-squares-i
3454-separate-squares-ii
3600-maximize-spanning-tree-stability-with-upgrades

Greedy

0011-container-with-most-water
0921-minimum-add-to-make-parentheses-valid
1382-balance-a-binary-search-tree
1536-minimum-swaps-to-arrange-a-binary-grid
1541-minimum-insertions-to-balance-a-parentheses-string
1727-largest-submatrix-with-rearrangements
1903-largest-odd-number-in-string
1975-maximum-matrix-sum
2618-maximize-the-minimum-powered-city
3296-minimum-number-of-seconds-to-make-mountain-height-zero
3600-maximize-spanning-tree-stability-with-upgrades

Queue

0225-implement-stack-using-queues
2073-time-needed-to-buy-tickets
2618-maximize-the-minimum-powered-city

Prefix Sum

0238-product-of-array-except-self
0724-find-pivot-index
1292-maximum-side-length-of-a-square-with-sum-less-than-or-equal-to-threshold
1588-sum-of-all-odd-length-subarrays
1878-get-biggest-three-rhombus-sums-in-a-grid
1895-largest-magic-square
2618-maximize-the-minimum-powered-city
3381-maximum-subarray-sum-with-length-divisible-by-k
3714-longest-balanced-substring-ii
3721-longest-balanced-subarray-ii

Math

0007-reverse-integer
0009-palindrome-number
0013-roman-to-integer
0067-add-binary
0189-rotate-array
0268-missing-number
1266-minimum-time-visiting-all-points
1390-four-divisors
1512-number-of-good-pairs
1588-sum-of-all-odd-length-subarrays
1680-concatenation-of-consecutive-binary-numbers
1878-get-biggest-three-rhombus-sums-in-a-grid
1903-largest-odd-number-in-string
2288-count-operations-to-obtain-zero
2413-smallest-even-multiple
2753-minimum-number-of-operations-to-make-all-array-elements-equal-to-1
2894-divisible-and-non-divisible-sums-difference
3047-find-the-largest-area-of-square-inside-two-rectangles
3296-minimum-number-of-seconds-to-make-mountain-height-zero
3516-find-closest-person
3783-mirror-distance-of-an-integer

Simulation

0067-add-binary
0844-backspace-string-compare
1404-number-of-steps-to-reduce-a-number-in-binary-representation-to-one
1680-concatenation-of-consecutive-binary-numbers
2073-time-needed-to-buy-tickets
2288-count-operations-to-obtain-zero
3379-transformed-array
3510-minimum-pair-removal-to-sort-array-ii

Dynamic Programming

0053-maximum-subarray
0085-maximal-rectangle
0474-ones-and-zeroes
0712-minimum-ascii-delete-sum-for-two-strings
0799-champagne-tower
1411-number-of-ways-to-paint-n-3-grid
1458-max-dot-product-of-two-subsequences
1525-number-of-good-ways-to-split-a-string
1653-minimum-deletions-to-make-string-balanced
2435-paths-in-matrix-whose-sum-is-divisible-by-k
3640-trionic-array-ii
3651-minimum-cost-path-with-teleportations

Number Theory

2413-smallest-even-multiple
2753-minimum-number-of-operations-to-make-all-array-elements-equal-to-1

Matrix

0085-maximal-rectangle
1292-maximum-side-length-of-a-square-with-sum-less-than-or-equal-to-threshold
1536-minimum-swaps-to-arrange-a-binary-grid
1727-largest-submatrix-with-rearrangements
1878-get-biggest-three-rhombus-sums-in-a-grid
1895-largest-magic-square
1975-maximum-matrix-sum
2435-paths-in-matrix-whose-sum-is-divisible-by-k
3651-minimum-cost-path-with-teleportations

Tree

0094-binary-tree-inorder-traversal
0098-validate-binary-search-tree
0099-recover-binary-search-tree
0100-same-tree
0102-binary-tree-level-order-traversal
0104-maximum-depth-of-binary-tree
0109-convert-sorted-list-to-binary-search-tree
0110-balanced-binary-tree
0112-path-sum
0114-flatten-binary-tree-to-linked-list
0144-binary-tree-preorder-traversal
0145-binary-tree-postorder-traversal
0199-binary-tree-right-side-view
0230-kth-smallest-element-in-a-bst
0235-lowest-common-ancestor-of-a-binary-search-tree
0404-sum-of-left-leaves
0450-delete-node-in-a-bst
0501-find-mode-in-binary-search-tree
0543-diameter-of-binary-tree
0637-average-of-levels-in-binary-tree
0700-search-in-a-binary-search-tree
0701-insert-into-a-binary-search-tree
0865-smallest-subtree-with-all-the-deepest-nodes
1022-sum-of-root-to-leaf-binary-numbers
1161-maximum-level-sum-of-a-binary-tree
1339-maximum-product-of-splitted-binary-tree
1382-balance-a-binary-search-tree
2872-maximum-number-of-k-divisible-components

Depth-First Search

0094-binary-tree-inorder-traversal
0098-validate-binary-search-tree
0099-recover-binary-search-tree
0100-same-tree
0104-maximum-depth-of-binary-tree
0110-balanced-binary-tree
0112-path-sum
0114-flatten-binary-tree-to-linked-list
0144-binary-tree-preorder-traversal
0145-binary-tree-postorder-traversal
0199-binary-tree-right-side-view
0230-kth-smallest-element-in-a-bst
0235-lowest-common-ancestor-of-a-binary-search-tree
0404-sum-of-left-leaves
0501-find-mode-in-binary-search-tree
0543-diameter-of-binary-tree
0637-average-of-levels-in-binary-tree
0865-smallest-subtree-with-all-the-deepest-nodes
1022-sum-of-root-to-leaf-binary-numbers
1161-maximum-level-sum-of-a-binary-tree
1339-maximum-product-of-splitted-binary-tree
1382-balance-a-binary-search-tree
2872-maximum-number-of-k-divisible-components

Breadth-First Search

0100-same-tree
0102-binary-tree-level-order-traversal
0104-maximum-depth-of-binary-tree
0112-path-sum
0199-binary-tree-right-side-view
0404-sum-of-left-leaves
0637-average-of-levels-in-binary-tree
0865-smallest-subtree-with-all-the-deepest-nodes
1161-maximum-level-sum-of-a-binary-tree

Binary Tree

0094-binary-tree-inorder-traversal
0098-validate-binary-search-tree
0099-recover-binary-search-tree
0100-same-tree
0102-binary-tree-level-order-traversal
0104-maximum-depth-of-binary-tree
0109-convert-sorted-list-to-binary-search-tree
0110-balanced-binary-tree
0112-path-sum
0114-flatten-binary-tree-to-linked-list
0144-binary-tree-preorder-traversal
0145-binary-tree-postorder-traversal
0199-binary-tree-right-side-view
0230-kth-smallest-element-in-a-bst
0235-lowest-common-ancestor-of-a-binary-search-tree
0404-sum-of-left-leaves
0450-delete-node-in-a-bst
0501-find-mode-in-binary-search-tree
0543-diameter-of-binary-tree
0637-average-of-levels-in-binary-tree
0700-search-in-a-binary-search-tree
0701-insert-into-a-binary-search-tree
0865-smallest-subtree-with-all-the-deepest-nodes
1022-sum-of-root-to-leaf-binary-numbers
1161-maximum-level-sum-of-a-binary-tree
1339-maximum-product-of-splitted-binary-tree
1382-balance-a-binary-search-tree

Two Pointers

0011-container-with-most-water
0015-3sum
0016-3sum-closest
0018-4sum
0019-remove-nth-node-from-end-of-list
0088-merge-sorted-array
0141-linked-list-cycle
0151-reverse-words-in-a-string
0167-two-sum-ii-input-array-is-sorted
0189-rotate-array
0234-palindrome-linked-list
0283-move-zeroes
0344-reverse-string
0696-count-binary-substrings
0844-backspace-string-compare
2095-delete-the-middle-node-of-a-linked-list

Sorting

0015-3sum
0016-3sum-closest
0018-4sum
0088-merge-sorted-array
0169-majority-element
0242-valid-anagram
0268-missing-number
1200-minimum-absolute-difference
1356-sort-integers-by-the-number-of-1-bits
1727-largest-submatrix-with-rearrangements
1878-get-biggest-three-rhombus-sums-in-a-grid
1984-minimum-difference-between-highest-and-lowest-of-k-scores
2943-maximize-area-of-square-hole-in-grid
3010-divide-an-array-into-subarrays-with-minimum-cost-i

Trie

0014-longest-common-prefix

Stack

0020-valid-parentheses
0085-maximal-rectangle
0094-binary-tree-inorder-traversal
0114-flatten-binary-tree-to-linked-list
0144-binary-tree-preorder-traversal
0145-binary-tree-postorder-traversal
0225-implement-stack-using-queues
0234-palindrome-linked-list
0496-next-greater-element-i
0739-daily-temperatures
0844-backspace-string-compare
0921-minimum-add-to-make-parentheses-valid
1541-minimum-insertions-to-balance-a-parentheses-string
1653-minimum-deletions-to-make-string-balanced

Monotonic Stack

0085-maximal-rectangle
0496-next-greater-element-i
0739-daily-temperatures

Geometry

1266-minimum-time-visiting-all-points
3047-find-the-largest-area-of-square-inside-two-rectangles

Backtracking

0017-letter-combinations-of-a-phone-number
0401-binary-watch

Segment Tree

3454-separate-squares-ii
3721-longest-balanced-subarray-ii

Line Sweep

3454-separate-squares-ii

Enumeration

2975-maximum-square-area-by-removing-fences-from-a-field
3010-divide-an-array-into-subarrays-with-minimum-cost-i
3713-longest-balanced-substring-i

Linked List

0019-remove-nth-node-from-end-of-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
0206-reverse-linked-list
0234-palindrome-linked-list
2095-delete-the-middle-node-of-a-linked-list
3510-minimum-pair-removal-to-sort-array-ii

Bit Manipulation

0067-add-binary
0190-reverse-bits
0268-missing-number
0401-binary-watch
0693-binary-number-with-alternating-bits
1009-complement-of-base-10-integer
1356-sort-integers-by-the-number-of-1-bits
1404-number-of-steps-to-reduce-a-number-in-binary-representation-to-one
1461-check-if-a-string-contains-all-binary-codes-of-size-k
1525-number-of-good-ways-to-split-a-string
1680-concatenation-of-consecutive-binary-numbers
3315-construct-the-minimum-bitwise-array-ii

Heap (Priority Queue)

1046-last-stone-weight
1878-get-biggest-three-rhombus-sums-in-a-grid
3013-divide-an-array-into-subarrays-with-minimum-cost-ii
3296-minimum-number-of-seconds-to-make-mountain-height-zero
3510-minimum-pair-removal-to-sort-array-ii
3650-minimum-cost-path-with-edge-reversals

Doubly-Linked List

3510-minimum-pair-removal-to-sort-array-ii

Ordered Set

3510-minimum-pair-removal-to-sort-array-ii

Graph Theory

2976-minimum-cost-to-convert-string-i
3600-maximize-spanning-tree-stability-with-upgrades
3650-minimum-cost-path-with-edge-reversals

Shortest Path

2976-minimum-cost-to-convert-string-i
3650-minimum-cost-path-with-edge-reversals

Counting

0169-majority-element
1356-sort-integers-by-the-number-of-1-bits
1512-number-of-good-pairs
3713-longest-balanced-substring-i

Divide and Conquer

0053-maximum-subarray
0109-convert-sorted-list-to-binary-search-tree
0169-majority-element
0190-reverse-bits
1382-balance-a-binary-search-tree
3721-longest-balanced-subarray-ii

Recursion

0206-reverse-linked-list
0234-palindrome-linked-list

Binary Search Tree

0098-validate-binary-search-tree
0099-recover-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
0450-delete-node-in-a-bst
0501-find-mode-in-binary-search-tree
0700-search-in-a-binary-search-tree
0701-insert-into-a-binary-search-tree
1382-balance-a-binary-search-tree

Design

0225-implement-stack-using-queues

Rolling Hash

1461-check-if-a-string-contains-all-binary-codes-of-size-k

Hash Function

1461-check-if-a-string-contains-all-binary-codes-of-size-k

Union-Find

3600-maximize-spanning-tree-stability-with-upgrades

Minimum Spanning Tree

3600-maximize-spanning-tree-stability-with-upgrades