1 unavailable video is hidden
Play all
Play all

Dynamic Programming Playlist | Coding | Interview Questions | Tutorials | Algorithm

This playlist explains Dynamic Programming in a concise way. Explaining how to approach a Dynamic Programming problem and moreover how to identify it first.
1
2

2 Types of knapsack

3

3 01 Knapsack Recursive

4

4 01Knapsack Memoization

5

5 01 Knapsack Top Down DP

6
7

7 Subset Sum Problem

8

Equal Sum Partition Problem

9
10

10 Minimum Subset Sum Difference

11
12

12 Target sum

13

13 Unbounded Knapsack

14

14 Rod Cutting Problem

15
16
17

17 Coin change problem Contd.

18
19
20
21
22

22 Longest Common Substring

23
24

24 Shortest Common SuperSequence

25
26
27
28
29

30 Longest repeating subsequence

30

31 Sequence Pattern Matching

31
32
33
34
35
36
37
38
39
40

41 Scrambled String Recursive

41

42 Scrambled String Memoized

42

43 Egg Dropping Problem Recursive

43
44
45
46
47

48 Diameter of a Binary Tree

48
49