Algorithm

• Brute-force
• Divide And Conquer
• Dynamic Programming
• Greedy
• Combinatorial Search
• Bisection Method
• Ternary Search
• Number Theory
• Computational Geometry
• Bitmask
• Partial Sum (Prefix Sum)
• Data Structures
• String
• Tree
• Binary Search Tree
• Segment Tree

LeetCode Topics

Array

0001-two-sum
0004-median-of-two-sorted-arrays
0011-container-with-most-water
0046-permutations
0048-rotate-image
0066-plus-one
0120-triangle
0136-single-number
1288-remove-covered-intervals
1331-rank-transform-of-an-array
1732-find-the-highest-altitude
1967-number-of-strings-that-appear-as-substrings-in-word
3286-find-a-safe-walk-through-a-grid
3532-path-existence-queries-in-a-graph-i
3838-weighted-word-mapping

Hash Table

0001-two-sum
0003-longest-substring-without-repeating-characters
1189-maximum-number-of-balloons
1331-rank-transform-of-an-array
1358-number-of-substrings-containing-all-three-characters
3532-path-existence-queries-in-a-graph-i

Math

0002-add-two-numbers
0007-reverse-integer
0009-palindrome-number
0048-rotate-image
0066-plus-one
0069-sqrtx
0070-climbing-stairs
3754-concatenate-non-zero-digits-and-multiply-by-sum-i

Backtracking

0046-permutations

Linked List

0002-add-two-numbers
0021-merge-two-sorted-lists

Recursion

0002-add-two-numbers
0021-merge-two-sorted-lists

String

0003-longest-substring-without-repeating-characters
1189-maximum-number-of-balloons
1358-number-of-substrings-containing-all-three-characters
1967-number-of-strings-that-appear-as-substrings-in-word
3838-weighted-word-mapping

Sliding Window

0003-longest-substring-without-repeating-characters
1358-number-of-substrings-containing-all-three-characters

Binary Search

0004-median-of-two-sorted-arrays
0069-sqrtx
3532-path-existence-queries-in-a-graph-i

Divide and Conquer

0004-median-of-two-sorted-arrays

Matrix

0048-rotate-image
3286-find-a-safe-walk-through-a-grid

Tree

0094-binary-tree-inorder-traversal
0104-maximum-depth-of-binary-tree

Depth-First Search

0094-binary-tree-inorder-traversal
0104-maximum-depth-of-binary-tree
2492-minimum-score-of-a-path-between-two-cities

Breadth-First Search

0104-maximum-depth-of-binary-tree
2492-minimum-score-of-a-path-between-two-cities
3286-find-a-safe-walk-through-a-grid

Binary Tree

0094-binary-tree-inorder-traversal
0104-maximum-depth-of-binary-tree

Bit Manipulation

0136-single-number

Dynamic Programming

0070-climbing-stairs
0120-triangle

Stack

0094-binary-tree-inorder-traversal

Database

0175-combine-two-tables
0176-second-highest-salary
0178-rank-scores
0181-employees-earning-more-than-their-managers
0182-duplicate-emails
0183-customers-who-never-order
0184-department-highest-salary
0185-department-top-three-salaries
0511-game-play-analysis-i
0577-employee-bonus
0584-find-customer-referee
0596-classes-with-at-least-5-students
0610-triangle-judgement
0619-biggest-single-number
0620-not-boring-movies
1327-list-the-products-ordered-in-a-period

Prefix Sum

1732-find-the-highest-altitude

Simulation

3838-weighted-word-mapping

Counting

1189-maximum-number-of-balloons

Memoization

0070-climbing-stairs

Two Pointers

0011-container-with-most-water

Greedy

0011-container-with-most-water

Graph Theory

2492-minimum-score-of-a-path-between-two-cities
3286-find-a-safe-walk-through-a-grid
3532-path-existence-queries-in-a-graph-i

Heap (Priority Queue)

3286-find-a-safe-walk-through-a-grid

Shortest Path

3286-find-a-safe-walk-through-a-grid

Union-Find

2492-minimum-score-of-a-path-between-two-cities
3532-path-existence-queries-in-a-graph-i

Sorting

1288-remove-covered-intervals
1331-rank-transform-of-an-array

Enumeration

1291-sequential-digits