Leetcode

LeetCode Topics

Math

0062-unique-paths
0070-climbing-stairs
0900-reordered-power-of-2
1013-fibonacci-number
1236-n-th-tribonacci-number
2238-a-number-after-a-double-reversal
2288-count-operations-to-obtain-zero

Array

0014-longest-common-prefix
0015-3sum
0037-sudoku-solver
0039-combination-sum
0042-trapping-rain-water
0049-group-anagrams
0053-maximum-subarray
0056-merge-intervals
0073-set-matrix-zeroes
0074-search-a-2d-matrix
0135-candy
0198-house-robber
0215-kth-largest-element-in-an-array
0287-find-the-duplicate-number
0322-coin-change
0347-top-k-frequent-elements
0455-assign-cookies
0496-next-greater-element-i
0503-next-greater-element-ii
0575-distribute-candies
0645-set-mismatch
0724-find-pivot-index
0739-daily-temperatures
0747-min-cost-climbing-stairs
0777-toeplitz-matrix
0792-binary-search
0860-design-circular-queue
1137-height-checker
1424-maximum-candies-you-can-get-from-boxes
1497-design-a-stack-with-increment-operation
2144-maximum-difference-between-increasing-elements
2292-counting-words-with-a-given-prefix
2362-minimum-rounds-to-complete-all-tasks
2766-find-the-prefix-common-array-of-two-arrays
3309-count-prefix-and-suffix-pairs-i
3689-maximum-total-subarray-value-i

Binary Search

0074-search-a-2d-matrix
0287-find-the-duplicate-number
0792-binary-search

Divide and Conquer

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

Dynamic Programming

0032-longest-valid-parentheses
0042-trapping-rain-water
0053-maximum-subarray
0062-unique-paths
0070-climbing-stairs
0198-house-robber
0322-coin-change
0747-min-cost-climbing-stairs
1013-fibonacci-number
1236-n-th-tribonacci-number

Two Pointers

0015-3sum
0042-trapping-rain-water
0151-reverse-words-in-a-string
0287-find-the-duplicate-number
0455-assign-cookies
0541-reverse-string-ii
0680-valid-palindrome-ii

Stack

0020-valid-parentheses
0032-longest-valid-parentheses
0042-trapping-rain-water
0144-binary-tree-preorder-traversal
0155-min-stack
0225-implement-stack-using-queues
0232-implement-queue-using-stacks
0496-next-greater-element-i
0503-next-greater-element-ii
0739-daily-temperatures
0937-online-stock-span
1497-design-a-stack-with-increment-operation
2221-check-if-a-parentheses-string-can-be-valid

Monotonic Stack

0042-trapping-rain-water
0496-next-greater-element-i
0503-next-greater-element-ii
0739-daily-temperatures
0937-online-stock-span

String

0014-longest-common-prefix
0020-valid-parentheses
0032-longest-valid-parentheses
0038-count-and-say
0049-group-anagrams
0151-reverse-words-in-a-string
0242-valid-anagram
0387-first-unique-character-in-a-string
0541-reverse-string-ii
0680-valid-palindrome-ii
2221-check-if-a-parentheses-string-can-be-valid
2292-counting-words-with-a-given-prefix
2365-percentage-of-letter-in-string
3309-count-prefix-and-suffix-pairs-i

Trie

0014-longest-common-prefix
3309-count-prefix-and-suffix-pairs-i

Rolling Hash

3309-count-prefix-and-suffix-pairs-i

String Matching

0572-subtree-of-another-tree
2292-counting-words-with-a-given-prefix
3309-count-prefix-and-suffix-pairs-i

Hash Function

0572-subtree-of-another-tree
3309-count-prefix-and-suffix-pairs-i

Greedy

0135-candy
0455-assign-cookies
0680-valid-palindrome-ii
2221-check-if-a-parentheses-string-can-be-valid
2362-minimum-rounds-to-complete-all-tasks
3689-maximum-total-subarray-value-i

Hash Table

0037-sudoku-solver
0049-group-anagrams
0073-set-matrix-zeroes
0242-valid-anagram
0347-top-k-frequent-elements
0387-first-unique-character-in-a-string
0496-next-greater-element-i
0575-distribute-candies
0645-set-mismatch
0900-reordered-power-of-2
1029-vertical-order-traversal-of-a-binary-tree
2362-minimum-rounds-to-complete-all-tasks
2766-find-the-prefix-common-array-of-two-arrays

Bit Manipulation

0287-find-the-duplicate-number
0645-set-mismatch
2766-find-the-prefix-common-array-of-two-arrays

Breadth-First Search

0102-binary-tree-level-order-traversal
0322-coin-change
1029-vertical-order-traversal-of-a-binary-tree
1424-maximum-candies-you-can-get-from-boxes
2121-find-if-path-exists-in-graph

Graph

1424-maximum-candies-you-can-get-from-boxes
2121-find-if-path-exists-in-graph

Combinatorics

0062-unique-paths

Backtracking

0037-sudoku-solver
0039-combination-sum

Matrix

0037-sudoku-solver
0073-set-matrix-zeroes
0074-search-a-2d-matrix
0777-toeplitz-matrix

Prefix Sum

0724-find-pivot-index

Design

0155-min-stack
0225-implement-stack-using-queues
0232-implement-queue-using-stacks
0789-kth-largest-element-in-a-stream
0860-design-circular-queue
0937-online-stock-span
1497-design-a-stack-with-increment-operation

Data Stream

0789-kth-largest-element-in-a-stream
0937-online-stock-span

Sorting

0015-3sum
0049-group-anagrams
0056-merge-intervals
0215-kth-largest-element-in-an-array
0242-valid-anagram
0347-top-k-frequent-elements
0455-assign-cookies
0645-set-mismatch
0900-reordered-power-of-2
1029-vertical-order-traversal-of-a-binary-tree
1137-height-checker

Heap (Priority Queue)

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

Quickselect

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

Linked List

0860-design-circular-queue

Queue

0225-implement-stack-using-queues
0232-implement-queue-using-stacks
0387-first-unique-character-in-a-string
0860-design-circular-queue

Memoization

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

Tree

0102-binary-tree-level-order-traversal
0144-binary-tree-preorder-traversal
0236-lowest-common-ancestor-of-a-binary-tree
0543-diameter-of-binary-tree
0572-subtree-of-another-tree
0789-kth-largest-element-in-a-stream
1029-vertical-order-traversal-of-a-binary-tree

Binary Search Tree

0789-kth-largest-element-in-a-stream

Binary Tree

0102-binary-tree-level-order-traversal
0144-binary-tree-preorder-traversal
0236-lowest-common-ancestor-of-a-binary-tree
0543-diameter-of-binary-tree
0572-subtree-of-another-tree
0789-kth-largest-element-in-a-stream
1029-vertical-order-traversal-of-a-binary-tree

Bucket Sort

0347-top-k-frequent-elements

Counting

0347-top-k-frequent-elements
0387-first-unique-character-in-a-string
0900-reordered-power-of-2
2362-minimum-rounds-to-complete-all-tasks

Depth-First Search

0144-binary-tree-preorder-traversal
0236-lowest-common-ancestor-of-a-binary-tree
0543-diameter-of-binary-tree
0572-subtree-of-another-tree
1029-vertical-order-traversal-of-a-binary-tree
2121-find-if-path-exists-in-graph

Counting Sort

1137-height-checker

Union Find

2121-find-if-path-exists-in-graph

Recursion

1013-fibonacci-number

Enumeration

0900-reordered-power-of-2

Simulation

2288-count-operations-to-obtain-zero