Home Courses Interview Preparation Course Multi Stage Graph

Multi Stage Graph

Instructor: admin Duration: 30 mins

This content is restricted. Please Login

Prev
Next
Floyd Warshall Algorithm as Dynamic Programming
Greedy Algorithms: Fractional Knapsack
1.1
Why study DS and Algorithms?

20 min
2.1
Recursion tree method

15 min
2.2
Master theorem

21 min
2.3
Extended Master Theorem

9 min
2.4
Inadmissible cases & Shortcuts

6 min
2.5
Substitution method.

15 min
3.1
Factorial: Time and Space complexity

21 min
3.2
Recursion vs iteration

7 min
3.3
Tail recursion/Tail-Call Optimization

14 min
4.1
Solved Problem 1
4 min
4.2
Fibonacci: Time Complexity
7 min
4.3
Solved Problem 2
6 min
4.4
Solved Problem 3
7 min
4.5
Solved Problem 4 + Master Theorem Shortcut
6 min
4.6
Solved Problem 5
3 min
4.7
Solved Problem 6
4 min
4.8
Solved Problem 7
5 min
4.9
Solved Problem 8
8 min
4.10
Solved Problem 9
8 min
4.11
Solved Problem 10
7 min
5.1
Linear Search: intuition and code
10 min
6.1
Intuition
19 min
6.2
Pseudo code
9 min
8.1
Greedy Algorithms: Fractional Knapsack
30 min
8.2
Solved Problem 1
10 min
8.3
Huffman Coding for Data Compression
31 min
8.4
Solved Problem 2
7 min
8.5
Solved Problem 3
4 min
8.6
Solved Problem 4
4 min
8.7
Job Sequencing with deadlines
16 min
8.8
Solved Problem 5
5 min
8.9
Optimal Merge Pattern
14 min
8.10
Solved Problem 6
5 min
8.11
Solved Problem 7
4 min
8.12
Minimum Spanning Trees: Prim's algorithm
20 min
8.13
Minimum Spanning Trees: Greedy Kruskal's Algorithm
15 min
8.14
Greedy Algorithm: Dijkstra's algorithm
16 min