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

LeetCode Topics

Math

2409-count-days-spent-together

String

0072-edit-distance
0208-implement-trie-prefix-tree
0301-remove-invalid-parentheses
2409-count-days-spent-together

Hash Table

0106-construct-binary-tree-from-inorder-and-postorder-traversal
0146-lru-cache
0208-implement-trie-prefix-tree
0560-subarray-sum-equals-k

Design

0146-lru-cache
0155-min-stack
0208-implement-trie-prefix-tree

Trie

0208-implement-trie-prefix-tree

Array

0031-next-permutation
0046-permutations
0047-permutations-ii
0074-search-a-2d-matrix
0106-construct-binary-tree-from-inorder-and-postorder-traversal
0239-sliding-window-maximum
0240-search-a-2d-matrix-ii
0300-longest-increasing-subsequence
0329-longest-increasing-path-in-a-matrix
0419-battleships-in-a-board
0560-subarray-sum-equals-k
0875-koko-eating-bananas

Dynamic Programming

0072-edit-distance
0300-longest-increasing-subsequence
0329-longest-increasing-path-in-a-matrix

Depth-First Search

0098-validate-binary-search-tree
0116-populating-next-right-pointers-in-each-node
0329-longest-increasing-path-in-a-matrix
0419-battleships-in-a-board
0538-convert-bst-to-greater-tree
0797-all-paths-from-source-to-target

Breadth-First Search

0116-populating-next-right-pointers-in-each-node
0301-remove-invalid-parentheses
0329-longest-increasing-path-in-a-matrix
0797-all-paths-from-source-to-target

Graph Theory

0329-longest-increasing-path-in-a-matrix
0797-all-paths-from-source-to-target

Topological Sort

0329-longest-increasing-path-in-a-matrix

Memoization

0329-longest-increasing-path-in-a-matrix

Matrix

0074-search-a-2d-matrix
0240-search-a-2d-matrix-ii
0329-longest-increasing-path-in-a-matrix
0419-battleships-in-a-board

Directed Acyclic Graph

0329-longest-increasing-path-in-a-matrix
0797-all-paths-from-source-to-target

Tree

0098-validate-binary-search-tree
0106-construct-binary-tree-from-inorder-and-postorder-traversal
0116-populating-next-right-pointers-in-each-node
0538-convert-bst-to-greater-tree

Binary Search Tree

0074-search-a-2d-matrix
0098-validate-binary-search-tree
0240-search-a-2d-matrix-ii
0300-longest-increasing-subsequence
0538-convert-bst-to-greater-tree
0875-koko-eating-bananas

Binary Tree

0098-validate-binary-search-tree
0106-construct-binary-tree-from-inorder-and-postorder-traversal
0116-populating-next-right-pointers-in-each-node
0538-convert-bst-to-greater-tree

Backtracking

0046-permutations
0047-permutations-ii
0052-n-queens-ii
0077-combinations
0301-remove-invalid-parentheses
0797-all-paths-from-source-to-target

Stack

0155-min-stack

Linked List

0025-reverse-nodes-in-k-group
0116-populating-next-right-pointers-in-each-node
0146-lru-cache

Doubly-Linked List

0146-lru-cache

Sorting

0047-permutations-ii

Two Pointers

0031-next-permutation

Algorithm X

0052-n-queens-ii

Divide and Conquer

0106-construct-binary-tree-from-inorder-and-postorder-traversal
0240-search-a-2d-matrix-ii

Longest Increasing Subsequence

0300-longest-increasing-subsequence

Prefix Sum

0560-subarray-sum-equals-k

Recursion

0025-reverse-nodes-in-k-group

Queue

0239-sliding-window-maximum

Sliding Window

0239-sliding-window-maximum

Heap (Priority Queue)

0239-sliding-window-maximum

Monotonic Queue

0239-sliding-window-maximum

Range Minimum/Maximum Query

0239-sliding-window-maximum