Dynamic Programming | Master Algorithms in 7 Days | Day 2 | FACE Prep's #WeekOfCode

In this video, we'll discuss the basics of Dynamic Programming. This video is part of FACE Prep's Week Of Code - Mastering Algorithms.

What is Week of Code?
FACE Prep's Week of Code is a 7-day event wherein you'll spend around 30 mins every day learning concepts of programming/coding.

********Today's Playground***********

Here's the schedule of this 7-day event.
Day 1 (30 April):
Thinking Recursively

Day 2 (1 May):
Dynamic Programming

Day 3 (2 May):
Divide & Conquer Methods

Day 4 (4 May):
Greedy Method/Strategy

Day 5 (5 May):
Backtracking Method

Day 6 (6 May):
Branch and Bound Method

Day 7 (7 May):
Playground Solutions Discussion and More

Do like and share this video. Post all your questions in the comments below.

One-stop placement prep:

More on Algorithms:

More on Data Structures:

[venkateshs]

The explanations given are very clear and simple. I liked the way in which tabulation and memoization are differentiated. I would like another session with a much difficult question.

[mogovanjonathan]

Thank you man love it! I suscribed to you because of your good content and explanation! Continue like that!

[bhavyagarg]

In house rob prblm, if we start from end and compare ka value of last house with the previous house and if the value of previous house is less than current house then we don't rob it and check wid third last and soo on ..
We only rob when the value of any house becomes greater than the current house in this case last house.
Is this approach correct? Or it will be possible only for this case?

[anupagrawal]

45:25 Couldn't understand the house rob problem when i=3. a is updated as 10, and the comparison is after the update. But you considered the previous value of a during the comparison. Kindly enlighten.

[aniruddha]

Was the last problem using the greedy approach also?

[harishkarnam]

Can you say how to calculate time complexity and space complexity for a algorithm

[varun]

how to find path in maxsum problem while using dp approach?

[salmonrajdommeti]

You are given a number N, you've to find the number of different ways to write it as the sum of 1, 3 and 4.
how to solve this...?