Leetcode

LeetCode Topics

Hash Table

0105-construct-binary-tree-from-preorder-and-inorder-traversal
0106-construct-binary-tree-from-inorder-and-postorder-traversal
0863-all-nodes-distance-k-in-binary-tree
0987-vertical-order-traversal-of-a-binary-tree
3016-minimum-number-of-pushes-to-type-word-ii
3518-smallest-palindromic-rearrangement-ii
3731-find-missing-elements

Tree

0101-symmetric-tree
0105-construct-binary-tree-from-preorder-and-inorder-traversal
0106-construct-binary-tree-from-inorder-and-postorder-traversal
0199-binary-tree-right-side-view
0222-count-complete-tree-nodes
0236-lowest-common-ancestor-of-a-binary-tree
0297-serialize-and-deserialize-binary-tree
0662-maximum-width-of-binary-tree
0863-all-nodes-distance-k-in-binary-tree
0987-vertical-order-traversal-of-a-binary-tree

Depth-First Search

0101-symmetric-tree
0199-binary-tree-right-side-view
0236-lowest-common-ancestor-of-a-binary-tree
0297-serialize-and-deserialize-binary-tree
0662-maximum-width-of-binary-tree
0863-all-nodes-distance-k-in-binary-tree
0987-vertical-order-traversal-of-a-binary-tree
3310-remove-methods-from-project

Breadth-First Search

0101-symmetric-tree
0199-binary-tree-right-side-view
0297-serialize-and-deserialize-binary-tree
0662-maximum-width-of-binary-tree
0863-all-nodes-distance-k-in-binary-tree
0987-vertical-order-traversal-of-a-binary-tree
3310-remove-methods-from-project

Sorting

0628-maximum-product-of-three-numbers
0987-vertical-order-traversal-of-a-binary-tree
1464-maximum-product-of-two-elements-in-an-array
3016-minimum-number-of-pushes-to-type-word-ii
3731-find-missing-elements

Binary Tree

0101-symmetric-tree
0105-construct-binary-tree-from-preorder-and-inorder-traversal
0106-construct-binary-tree-from-inorder-and-postorder-traversal
0199-binary-tree-right-side-view
0222-count-complete-tree-nodes
0236-lowest-common-ancestor-of-a-binary-tree
0297-serialize-and-deserialize-binary-tree
0662-maximum-width-of-binary-tree
0863-all-nodes-distance-k-in-binary-tree
0987-vertical-order-traversal-of-a-binary-tree

String

0006-zigzag-conversion
0297-serialize-and-deserialize-binary-tree
3014-minimum-number-of-pushes-to-type-word-i
3016-minimum-number-of-pushes-to-type-word-ii
3518-smallest-palindromic-rearrangement-ii

Array

0105-construct-binary-tree-from-preorder-and-inorder-traversal
0106-construct-binary-tree-from-inorder-and-postorder-traversal
0486-predict-the-winner
0628-maximum-product-of-three-numbers
0877-stone-game
1406-stone-game-iii
1464-maximum-product-of-two-elements-in-an-array
3725-count-ways-to-choose-coprime-integers-from-rows
3731-find-missing-elements

Math

0486-predict-the-winner
0628-maximum-product-of-three-numbers
0877-stone-game
1406-stone-game-iii
3014-minimum-number-of-pushes-to-type-word-i
3518-smallest-palindromic-rearrangement-ii
3725-count-ways-to-choose-coprime-integers-from-rows

Heap (Priority Queue)

1464-maximum-product-of-two-elements-in-an-array

Combinatorics

3518-smallest-palindromic-rearrangement-ii
3725-count-ways-to-choose-coprime-integers-from-rows

Counting

3016-minimum-number-of-pushes-to-type-word-ii
3518-smallest-palindromic-rearrangement-ii

Greedy

3014-minimum-number-of-pushes-to-type-word-i
3016-minimum-number-of-pushes-to-type-word-ii

Dynamic Programming

0486-predict-the-winner
0877-stone-game
1406-stone-game-iii
3725-count-ways-to-choose-coprime-integers-from-rows

Recursion

0486-predict-the-winner

Game Theory

0486-predict-the-winner
0877-stone-game
1406-stone-game-iii

Binary Search

0222-count-complete-tree-nodes

Bit Manipulation

0222-count-complete-tree-nodes

Minimax

1406-stone-game-iii

Zero-Sum Game

1406-stone-game-iii

Divide and Conquer

0105-construct-binary-tree-from-preorder-and-inorder-traversal
0106-construct-binary-tree-from-inorder-and-postorder-traversal

Graph Theory

3310-remove-methods-from-project

Matrix

3725-count-ways-to-choose-coprime-integers-from-rows

Number Theory

3725-count-ways-to-choose-coprime-integers-from-rows

Design

0297-serialize-and-deserialize-binary-tree