Algorithms (basic) Flashcards
1
Q
Binary tree DFS
A
2
Q
Binary tree BFS
A
3
Q
Deleting a specified node from a BST using DFS
A
4
Q
Converting edges to an adjacency list
A
5
Q
DFS on a graph from an adjacency list
A
6
Q
BFS on a graph from an adjacency list
A
7
Q
Heap/priority queue
A
8
Q
Binary search
A
9
Q
Backtracking
A
10
Q
Djikstra’s on a graph
A
11
Q
Using monotonic stack to find largest area of a histogram
A
12
Q
DP 1D
A
13
Q
DP Multi
A
