Please Login To Continue
Dynamic Programming: Fibonacci Numbers (in Hindi)
Lesson 2 of 9 • 4 upvotes • 8:28mins
Akansha Aggarwal
Fibonacci numbers takes exponential time with standard recursive method but using dynamic programming the time complexity of this problem is reduced to order of n.
(Hindi) Dynamic Programming
9 lessons • 1h 50m
1
Introduction (in Hindi)
13:13mins
2
Dynamic Programming: Fibonacci Numbers (in Hindi)
8:28mins
3
Assembly Line Scheduling (in Hindi)
12:36mins
4
Assembly Line Scheduling: Example (in Hindi)
13:35mins
5
Longest Common Subsequence (in Hindi)
10:15mins
6
Longest Common Subsequence: Example (in Hindi)
14:50mins
7
Matrix Chain Multiplication (in Hindi)
9:49mins
8
Matrix Chain Multiplication: Example (in Hindi)
14:58mins
9
Subset Sum Problem (in Hindi)
12:56mins
Crack GATE - Iconic Pro with Unacademy
Get subscription and access unlimited live and recorded courses from India's best educators
Structured syllabus
Daily live classes
Ask doubts
