Algorithms (Advanced) Flashcards

1
Q

Kadane’s algorithm

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

Variable sliding window (window size varies up until sum)

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

Floyd’s Algorithm

A

For find the start of a cycle in a linked list

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

Reverse linked list

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

Merge 2 sorted linked lists

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

Deepcopy of LinkedList with random pointer

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

Djikstra

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

Prim’s algorithm

A

MST

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

Kruskal’s algorithm

A

MST

(Top part is for ‘min cost to connect all points’)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

Ford Fulkerson

A

Max flow

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

Bellman Ford

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

Merge sort

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

Quicksort

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

Topological sort

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

Floyd warshall

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

Insertion sort

A
17
Q

Radix sort

A