Leetcode-Problems

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

LeetCode Topics

Array

0001-two-sum
0014-longest-common-prefix
0026-remove-duplicates-from-sorted-array
0027-remove-element
0033-search-in-rotated-sorted-array
0034-find-first-and-last-position-of-element-in-sorted-array
0035-search-insert-position
0039-combination-sum
0041-first-missing-positive
0042-trapping-rain-water
0045-jump-game-ii
0046-permutations
0048-rotate-image
0049-group-anagrams
0051-n-queens
0053-maximum-subarray
0054-spiral-matrix
0055-jump-game
0056-merge-intervals
0057-insert-interval
0063-unique-paths-ii
0064-minimum-path-sum
0066-plus-one
0075-sort-colors
0078-subsets
0081-search-in-rotated-sorted-array-ii
0084-largest-rectangle-in-histogram
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
0121-best-time-to-buy-and-sell-stock
0122-best-time-to-buy-and-sell-stock-ii
0130-surrounded-regions
0136-single-number
0153-find-minimum-in-rotated-sorted-array
0154-find-minimum-in-rotated-sorted-array-ii
0162-find-peak-element
0169-majority-element
0189-rotate-array
0198-house-robber
0200-number-of-islands
0204-count-primes
0209-minimum-size-subarray-sum
0213-house-robber-ii
0215-kth-largest-element-in-an-array
0217-contains-duplicate
0219-contains-duplicate-ii
0268-missing-number
0283-move-zeroes
0287-find-the-duplicate-number
0304-range-sum-query-2d-immutable
0322-coin-change
0347-top-k-frequent-elements
0349-intersection-of-two-arrays
0403-frog-jump
0416-partition-equal-subset-sum
0442-find-all-duplicates-in-an-array
0448-find-all-numbers-disappeared-in-an-array
0463-island-perimeter
0485-max-consecutive-ones
0494-target-sum
0496-next-greater-element-i
0503-next-greater-element-ii
0506-relative-ranks
0518-coin-change-ii
0540-single-element-in-a-sorted-array
0542-01-matrix
0560-subarray-sum-equals-k
0622-design-circular-queue
0645-set-mismatch
0695-max-area-of-island
0718-maximum-length-of-repeated-subarray
0724-find-pivot-index
0733-flood-fill
0735-asteroid-collision
0739-daily-temperatures
0792-binary-search
0816-design-hashset
0817-design-hashmap
0875-koko-eating-bananas
0904-fruit-into-baskets
0907-koko-eating-bananas
0907-sum-of-subarray-minimums
0912-sort-an-array
0930-binary-subarrays-with-sum
0948-sort-an-array
0974-subarray-sums-divisible-by-k
0992-subarrays-with-k-different-integers
0994-rotting-oranges
1004-max-consecutive-ones-iii
1008-construct-binary-search-tree-from-preorder-traversal
1020-number-of-enclaves
1036-rotting-oranges
1056-capacity-to-ship-packages-within-d-days
1171-shortest-path-in-binary-matrix
1248-count-number-of-nice-subarrays
1423-maximum-points-you-can-obtain-from-cards
1470-shuffle-the-array
1671-minimum-number-of-removals-to-make-mountain-array
1926-nearest-exit-from-entrance-in-maze
1929-concatenation-of-array
2038-nearest-exit-from-entrance-in-maze
2058-concatenation-of-array
2104-sum-of-subarray-ranges
2316-count-hills-and-valleys-in-an-array
2480-find-subarrays-with-equal-sum
2574-left-and-right-sum-differences
2596-check-knight-tour-configuration
3430-count-days-without-meetings
3507-minimum-pair-removal-to-sort-array-i

Hash Table

0001-two-sum
0003-longest-substring-without-repeating-characters
0041-first-missing-positive
0049-group-anagrams
0076-minimum-window-substring
0105-construct-binary-tree-from-preorder-and-inorder-traversal
0106-construct-binary-tree-from-inorder-and-postorder-traversal
0127-word-ladder
0141-linked-list-cycle
0142-linked-list-cycle-ii
0160-intersection-of-two-linked-lists
0169-majority-element
0202-happy-number
0217-contains-duplicate
0219-contains-duplicate-ii
0242-valid-anagram
0268-missing-number
0347-top-k-frequent-elements
0349-intersection-of-two-arrays
0424-longest-repeating-character-replacement
0442-find-all-duplicates-in-an-array
0448-find-all-numbers-disappeared-in-an-array
0451-sort-characters-by-frequency
0496-next-greater-element-i
0560-subarray-sum-equals-k
0645-set-mismatch
0653-two-sum-iv-input-is-a-bst
0816-design-hashset
0817-design-hashmap
0863-all-nodes-distance-k-in-binary-tree
0904-fruit-into-baskets
0930-binary-subarrays-with-sum
0974-subarray-sums-divisible-by-k
0987-vertical-order-traversal-of-a-binary-tree
0992-subarrays-with-k-different-integers
1248-count-number-of-nice-subarrays
1358-number-of-substrings-containing-all-three-characters
2480-find-subarrays-with-equal-sum
3507-minimum-pair-removal-to-sort-array-i

Math

0002-add-two-numbers
0007-reverse-integer
0009-palindrome-number
0048-rotate-image
0062-unique-paths
0066-plus-one
0069-sqrtx
0070-climbing-stairs
0168-excel-sheet-column-title
0189-rotate-array
0202-happy-number
0204-count-primes
0231-power-of-two
0263-ugly-number
0268-missing-number
0292-nim-game
0326-power-of-three
0342-power-of-four
0441-arranging-coins
0897-prime-palindrome
1013-fibonacci-number
1236-n-th-tribonacci-number
1248-count-number-of-nice-subarrays
1411-convert-binary-number-in-a-linked-list-to-integer
2481-strictly-palindromic-number

Linked List

0002-add-two-numbers
0019-remove-nth-node-from-end-of-list
0021-merge-two-sorted-lists
0023-merge-k-sorted-lists
0024-swap-nodes-in-pairs
0025-reverse-nodes-in-k-group
0061-rotate-list
0082-remove-duplicates-from-sorted-list-ii
0083-remove-duplicates-from-sorted-list
0086-partition-list
0092-reverse-linked-list-ii
0114-flatten-binary-tree-to-linked-list
0116-populating-next-right-pointers-in-each-node
0117-populating-next-right-pointers-in-each-node-ii
0141-linked-list-cycle
0142-linked-list-cycle-ii
0143-reorder-list
0148-sort-list
0160-intersection-of-two-linked-lists
0203-remove-linked-list-elements
0206-reverse-linked-list
0234-palindrome-linked-list
0237-delete-node-in-a-linked-list
0328-odd-even-linked-list
0622-design-circular-queue
0816-design-hashset
0817-design-hashmap
0838-design-linked-list
0876-middle-of-the-linked-list
0908-middle-of-the-linked-list
1411-convert-binary-number-in-a-linked-list-to-integer
2095-delete-the-middle-node-of-a-linked-list
2216-delete-the-middle-node-of-a-linked-list
3507-minimum-pair-removal-to-sort-array-i

Recursion

0002-add-two-numbers
0021-merge-two-sorted-lists
0024-swap-nodes-in-pairs
0025-reverse-nodes-in-k-group
0143-reorder-list
0203-remove-linked-list-elements
0206-reverse-linked-list
0231-power-of-two
0234-palindrome-linked-list
0326-power-of-three
0342-power-of-four
1013-fibonacci-number

Two Pointers

0019-remove-nth-node-from-end-of-list
0026-remove-duplicates-from-sorted-array
0027-remove-element
0028-find-the-index-of-the-first-occurrence-in-a-string
0042-trapping-rain-water
0061-rotate-list
0075-sort-colors
0082-remove-duplicates-from-sorted-list-ii
0086-partition-list
0141-linked-list-cycle
0142-linked-list-cycle-ii
0143-reorder-list
0148-sort-list
0160-intersection-of-two-linked-lists
0189-rotate-array
0202-happy-number
0234-palindrome-linked-list
0283-move-zeroes
0287-find-the-duplicate-number
0349-intersection-of-two-arrays
0647-palindromic-substrings
0653-two-sum-iv-input-is-a-bst
0876-middle-of-the-linked-list
0908-middle-of-the-linked-list
2095-delete-the-middle-node-of-a-linked-list
2216-delete-the-middle-node-of-a-linked-list
2481-strictly-palindromic-number

String

0003-longest-substring-without-repeating-characters
0014-longest-common-prefix
0020-valid-parentheses
0022-generate-parentheses
0028-find-the-index-of-the-first-occurrence-in-a-string
0032-longest-valid-parentheses
0049-group-anagrams
0058-length-of-last-word
0072-edit-distance
0076-minimum-window-substring
0127-word-ladder
0131-palindrome-partitioning
0168-excel-sheet-column-title
0242-valid-anagram
0257-binary-tree-paths
0297-serialize-and-deserialize-binary-tree
0402-remove-k-digits
0424-longest-repeating-character-replacement
0451-sort-characters-by-frequency
0516-longest-palindromic-subsequence
0583-delete-operation-for-two-strings
0647-palindromic-substrings
1030-smallest-string-starting-from-leaf
1250-longest-common-subsequence
1358-number-of-substrings-containing-all-three-characters
1910-remove-all-occurrences-of-a-substring

String Matching

0028-find-the-index-of-the-first-occurrence-in-a-string

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
0081-search-in-rotated-sorted-array-ii
0153-find-minimum-in-rotated-sorted-array
0154-find-minimum-in-rotated-sorted-array-ii
0162-find-peak-element
0209-minimum-size-subarray-sum
0222-count-complete-tree-nodes
0268-missing-number
0287-find-the-duplicate-number
0349-intersection-of-two-arrays
0441-arranging-coins
0540-single-element-in-a-sorted-array
0718-maximum-length-of-repeated-subarray
0792-binary-search
0875-koko-eating-bananas
0907-koko-eating-bananas
1004-max-consecutive-ones-iii
1056-capacity-to-ship-packages-within-d-days
1671-minimum-number-of-removals-to-make-mountain-array

Brainteaser

0292-nim-game
2481-strictly-palindromic-number

Dynamic Programming

0022-generate-parentheses
0032-longest-valid-parentheses
0042-trapping-rain-water
0045-jump-game-ii
0053-maximum-subarray
0055-jump-game
0062-unique-paths
0063-unique-paths-ii
0064-minimum-path-sum
0070-climbing-stairs
0072-edit-distance
0118-pascals-triangle
0121-best-time-to-buy-and-sell-stock
0122-best-time-to-buy-and-sell-stock-ii
0124-binary-tree-maximum-path-sum
0131-palindrome-partitioning
0198-house-robber
0213-house-robber-ii
0322-coin-change
0403-frog-jump
0416-partition-equal-subset-sum
0494-target-sum
0516-longest-palindromic-subsequence
0518-coin-change-ii
0542-01-matrix
0583-delete-operation-for-two-strings
0647-palindromic-substrings
0718-maximum-length-of-repeated-subarray
0907-sum-of-subarray-minimums
1013-fibonacci-number
1236-n-th-tribonacci-number
1250-longest-common-subsequence
1373-maximum-sum-bst-in-binary-tree
1671-minimum-number-of-removals-to-make-mountain-array

Greedy

0045-jump-game-ii
0055-jump-game
0122-best-time-to-buy-and-sell-stock-ii
0402-remove-k-digits
1671-minimum-number-of-removals-to-make-mountain-array

Stack

0020-valid-parentheses
0032-longest-valid-parentheses
0042-trapping-rain-water
0084-largest-rectangle-in-histogram
0094-binary-tree-inorder-traversal
0114-flatten-binary-tree-to-linked-list
0143-reorder-list
0144-binary-tree-preorder-traversal
0145-binary-tree-postorder-traversal
0173-binary-search-tree-iterator
0234-palindrome-linked-list
0402-remove-k-digits
0496-next-greater-element-i
0503-next-greater-element-ii
0735-asteroid-collision
0739-daily-temperatures
0901-online-stock-span
0907-sum-of-subarray-minimums
1008-construct-binary-search-tree-from-preorder-traversal
1910-remove-all-occurrences-of-a-substring
2104-sum-of-subarray-ranges

Monotonic Stack

0042-trapping-rain-water
0084-largest-rectangle-in-histogram
0402-remove-k-digits
0496-next-greater-element-i
0503-next-greater-element-ii
0739-daily-temperatures
0901-online-stock-span
0907-sum-of-subarray-minimums
1008-construct-binary-search-tree-from-preorder-traversal
2104-sum-of-subarray-ranges

Prefix Sum

0209-minimum-size-subarray-sum
0304-range-sum-query-2d-immutable
0560-subarray-sum-equals-k
0724-find-pivot-index
0930-binary-subarrays-with-sum
0974-subarray-sums-divisible-by-k
1004-max-consecutive-ones-iii
1248-count-number-of-nice-subarrays
1423-maximum-points-you-can-obtain-from-cards
2574-left-and-right-sum-differences

Bit Manipulation

0078-subsets
0090-subsets-ii
0136-single-number
0191-number-of-1-bits
0222-count-complete-tree-nodes
0231-power-of-two
0268-missing-number
0287-find-the-duplicate-number
0342-power-of-four
0645-set-mismatch

Divide and Conquer

0023-merge-k-sorted-lists
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
0148-sort-list
0169-majority-element
0191-number-of-1-bits
0215-kth-largest-element-in-an-array
0347-top-k-frequent-elements
0912-sort-an-array
0948-sort-an-array

Sorting

0049-group-anagrams
0056-merge-intervals
0075-sort-colors
0148-sort-list
0169-majority-element
0215-kth-largest-element-in-an-array
0217-contains-duplicate
0242-valid-anagram
0268-missing-number
0347-top-k-frequent-elements
0349-intersection-of-two-arrays
0451-sort-characters-by-frequency
0506-relative-ranks
0645-set-mismatch
0912-sort-an-array
0948-sort-an-array
0987-vertical-order-traversal-of-a-binary-tree
3430-count-days-without-meetings

Counting

0169-majority-element
0347-top-k-frequent-elements
0451-sort-characters-by-frequency
0992-subarrays-with-k-different-integers

Heap (Priority Queue)

0023-merge-k-sorted-lists
0215-kth-largest-element-in-an-array
0347-top-k-frequent-elements
0451-sort-characters-by-frequency
0506-relative-ranks
0912-sort-an-array
0948-sort-an-array
3507-minimum-pair-removal-to-sort-array-i

Design

0173-binary-search-tree-iterator
0297-serialize-and-deserialize-binary-tree
0304-range-sum-query-2d-immutable
0622-design-circular-queue
0816-design-hashset
0817-design-hashmap
0838-design-linked-list
0901-online-stock-span

Merge Sort

0023-merge-k-sorted-lists
0148-sort-list
0912-sort-an-array
0948-sort-an-array

Memoization

0070-climbing-stairs
1013-fibonacci-number
1236-n-th-tribonacci-number

Backtracking

0022-generate-parentheses
0039-combination-sum
0046-permutations
0051-n-queens
0078-subsets
0090-subsets-ii
0113-path-sum-ii
0131-palindrome-partitioning
0257-binary-tree-paths
0494-target-sum
1030-smallest-string-starting-from-leaf

Tree

0094-binary-tree-inorder-traversal
0098-validate-binary-search-tree
0099-recover-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
0110-balanced-binary-tree
0111-minimum-depth-of-binary-tree
0112-path-sum
0113-path-sum-ii
0114-flatten-binary-tree-to-linked-list
0116-populating-next-right-pointers-in-each-node
0117-populating-next-right-pointers-in-each-node-ii
0124-binary-tree-maximum-path-sum
0129-sum-root-to-leaf-numbers
0144-binary-tree-preorder-traversal
0145-binary-tree-postorder-traversal
0173-binary-search-tree-iterator
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
0450-delete-node-in-a-bst
0513-find-bottom-left-tree-value
0543-diameter-of-binary-tree
0653-two-sum-iv-input-is-a-bst
0662-maximum-width-of-binary-tree
0701-insert-into-a-binary-search-tree
0863-all-nodes-distance-k-in-binary-tree
0904-leaf-similar-trees
0938-range-sum-of-bst
0987-vertical-order-traversal-of-a-binary-tree
1008-construct-binary-search-tree-from-preorder-traversal
1030-smallest-string-starting-from-leaf
1373-maximum-sum-bst-in-binary-tree

Depth-First Search

0094-binary-tree-inorder-traversal
0098-validate-binary-search-tree
0099-recover-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
0116-populating-next-right-pointers-in-each-node
0117-populating-next-right-pointers-in-each-node-ii
0124-binary-tree-maximum-path-sum
0129-sum-root-to-leaf-numbers
0130-surrounded-regions
0144-binary-tree-preorder-traversal
0145-binary-tree-postorder-traversal
0199-binary-tree-right-side-view
0200-number-of-islands
0207-course-schedule
0210-course-schedule-ii
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
0463-island-perimeter
0513-find-bottom-left-tree-value
0543-diameter-of-binary-tree
0547-number-of-provinces
0653-two-sum-iv-input-is-a-bst
0662-maximum-width-of-binary-tree
0695-max-area-of-island
0733-flood-fill
0863-all-nodes-distance-k-in-binary-tree
0904-leaf-similar-trees
0938-range-sum-of-bst
0987-vertical-order-traversal-of-a-binary-tree
1020-number-of-enclaves
1030-smallest-string-starting-from-leaf
1373-maximum-sum-bst-in-binary-tree
2596-check-knight-tour-configuration
2685-count-the-number-of-complete-components

Binary Tree

0094-binary-tree-inorder-traversal
0098-validate-binary-search-tree
0099-recover-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
0110-balanced-binary-tree
0111-minimum-depth-of-binary-tree
0112-path-sum
0113-path-sum-ii
0114-flatten-binary-tree-to-linked-list
0116-populating-next-right-pointers-in-each-node
0117-populating-next-right-pointers-in-each-node-ii
0124-binary-tree-maximum-path-sum
0129-sum-root-to-leaf-numbers
0144-binary-tree-preorder-traversal
0145-binary-tree-postorder-traversal
0173-binary-search-tree-iterator
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
0450-delete-node-in-a-bst
0513-find-bottom-left-tree-value
0543-diameter-of-binary-tree
0653-two-sum-iv-input-is-a-bst
0662-maximum-width-of-binary-tree
0701-insert-into-a-binary-search-tree
0863-all-nodes-distance-k-in-binary-tree
0904-leaf-similar-trees
0938-range-sum-of-bst
0987-vertical-order-traversal-of-a-binary-tree
1008-construct-binary-search-tree-from-preorder-traversal
1030-smallest-string-starting-from-leaf
1373-maximum-sum-bst-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
0116-populating-next-right-pointers-in-each-node
0117-populating-next-right-pointers-in-each-node-ii
0127-word-ladder
0130-surrounded-regions
0199-binary-tree-right-side-view
0200-number-of-islands
0207-course-schedule
0210-course-schedule-ii
0226-invert-binary-tree
0297-serialize-and-deserialize-binary-tree
0322-coin-change
0404-sum-of-left-leaves
0463-island-perimeter
0513-find-bottom-left-tree-value
0542-01-matrix
0547-number-of-provinces
0653-two-sum-iv-input-is-a-bst
0662-maximum-width-of-binary-tree
0695-max-area-of-island
0733-flood-fill
0863-all-nodes-distance-k-in-binary-tree
0987-vertical-order-traversal-of-a-binary-tree
0994-rotting-oranges
1020-number-of-enclaves
1036-rotting-oranges
1171-shortest-path-in-binary-matrix
1926-nearest-exit-from-entrance-in-maze
2038-nearest-exit-from-entrance-in-maze
2596-check-knight-tour-configuration
2685-count-the-number-of-complete-components

Binary Search Tree

0098-validate-binary-search-tree
0099-recover-binary-search-tree
0108-convert-sorted-array-to-binary-search-tree
0173-binary-search-tree-iterator
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
0701-insert-into-a-binary-search-tree
0938-range-sum-of-bst
1008-construct-binary-search-tree-from-preorder-traversal
1373-maximum-sum-bst-in-binary-tree

Sliding Window

0003-longest-substring-without-repeating-characters
0076-minimum-window-substring
0209-minimum-size-subarray-sum
0219-contains-duplicate-ii
0424-longest-repeating-character-replacement
0718-maximum-length-of-repeated-subarray
0904-fruit-into-baskets
0930-binary-subarrays-with-sum
0992-subarrays-with-k-different-integers
1004-max-consecutive-ones-iii
1248-count-number-of-nice-subarrays
1358-number-of-substrings-containing-all-three-characters
1423-maximum-points-you-can-obtain-from-cards

Rolling Hash

0718-maximum-length-of-repeated-subarray

Hash Function

0718-maximum-length-of-repeated-subarray
0816-design-hashset
0817-design-hashmap

Matrix

0048-rotate-image
0054-spiral-matrix
0063-unique-paths-ii
0064-minimum-path-sum
0130-surrounded-regions
0200-number-of-islands
0304-range-sum-query-2d-immutable
0463-island-perimeter
0542-01-matrix
0695-max-area-of-island
0733-flood-fill
0994-rotting-oranges
1020-number-of-enclaves
1036-rotting-oranges
1171-shortest-path-in-binary-matrix
1926-nearest-exit-from-entrance-in-maze
2038-nearest-exit-from-entrance-in-maze
2596-check-knight-tour-configuration

Combinatorics

0062-unique-paths

Union Find

0200-number-of-islands
0695-max-area-of-island

Graph

0207-course-schedule
0210-course-schedule-ii

Topological Sort

0207-course-schedule
0210-course-schedule-ii

Simulation

0054-spiral-matrix
0735-asteroid-collision
1910-remove-all-occurrences-of-a-substring
1929-concatenation-of-array
2058-concatenation-of-array
2596-check-knight-tour-configuration
3507-minimum-pair-removal-to-sort-array-i

Trie

0014-longest-common-prefix

Bucket Sort

0347-top-k-frequent-elements
0451-sort-characters-by-frequency
0912-sort-an-array
0948-sort-an-array

Radix Sort

0912-sort-an-array
0948-sort-an-array

Counting Sort

0912-sort-an-array
0948-sort-an-array

Quickselect

0215-kth-largest-element-in-an-array
0347-top-k-frequent-elements

Enumeration

0204-count-primes

Number Theory

0204-count-primes
0897-prime-palindrome

Union-Find

0130-surrounded-regions
0200-number-of-islands
0547-number-of-provinces
1020-number-of-enclaves
2685-count-the-number-of-complete-components

Graph Theory

0547-number-of-provinces
2685-count-the-number-of-complete-components

Game Theory

0292-nim-game

Doubly-Linked List

3507-minimum-pair-removal-to-sort-array-i

Ordered Set

3507-minimum-pair-removal-to-sort-array-i

Queue

0622-design-circular-queue

Data Stream

0901-online-stock-span

Iterator

0173-binary-search-tree-iterator