00:00/00:00
Lecture 1 of 28
Recursion
Course Content
0 / 28 completedSection 1: Recursion3 videos
Recursion
9mNow Playing
The Greatest Common Divisor
1h 3m
Josephus' problem
17m
Section 2: Greedy algorithms1 videos
Greedy algorithms
32m
Section 3: Backtracking2 videos
Backtracking
18m
Chess and Backtracking
40m
Section 4: Divide and Conquer2 videos
Divide and Conquer
24m
Normalised Squares
16m
Section 5: Sorting algorithms1 videos
Sorting algorithms
29m
Section 6: Dynamic Programming8 videos
Memoization
11m
Basic examples
29m
Words, Dynamic Programming and Backtracking
16m
Chess and Dynamic Programming
23m
Catalan numbers
30m
Dynamic Programming and Probabilities
25m
Application The Bridge and Torch Problem
23m
Dynamic Programming, Games, Paths and other Applications
44m
Section 7: Binary Search4 videos
Binary Search
47m
The Longest Increasing Subsequence and Related Problems
35m
Ternary Search
21m
Application Square Fencing
25m
Section 8: Matrix Exponentiation1 videos
Matrix Exponentiation
38m
Section 9: Sliding Window Technique1 videos
Sliding Window Technique
50m
Section 10: Advanced Dynamic Programming3 videos
Advanced Dynamic Programming
41m
The Travelling Salesman Problem
32m
Dynamic Programming and Computational Geometry
28m
Section 11: Branch and Bound1 videos
Branch and Bound
38m
Section 12: Meet in the middle technique1 videos
Meet in the middle technique
23m