Advanced Algorithms

Content

16 Lessons
Overall Progress0%
1.

Divide and Conquer

Solving problems by breaking them into subproblems.

Sort an Array (Merge/Quick Sort)
Kth Largest Element in an Array
2.

Greedy Algorithms

Make the locally optimal choice at each step.

4 Lessons
3.

Backtracking

Search through possible solutions by undoing choices.

6 Lessons
4.

Dynamic Programming

Optimal substructure and overlapping subproblems.

4 Lessons