1
00:00:00,330 --> 00:00:05,100
In the previous video, we have understood the coding interview problem given to us.

2
00:00:05,130 --> 00:00:10,080
Now let's take a look at the approaches that we are going to discuss in the subsequent videos.

3
00:00:10,320 --> 00:00:15,270
At a high level, we are going to discuss two approaches for solving this question.

4
00:00:15,300 --> 00:00:22,050
Now the first approach is going to be a slight modification of what we have seen so far.

5
00:00:22,050 --> 00:00:28,860
And for that reason, when we are discussing approach number one, we will directly start with the tabulation

6
00:00:28,860 --> 00:00:30,900
way of solving this question.

7
00:00:30,900 --> 00:00:36,840
After we are done discussing approach number one, we will discuss another approach which is approach

8
00:00:36,840 --> 00:00:37,740
number two.

9
00:00:37,740 --> 00:00:41,730
And this approach will have a better time complexity.

10
00:00:41,760 --> 00:00:47,580
Now when we go ahead and discuss this, we will first discuss the recursive solution.

11
00:00:47,580 --> 00:00:49,770
And then we will go ahead and memorize it.

12
00:00:49,770 --> 00:00:56,190
And after we are done with the memoization approach, we will go ahead and implement the tabulation

13
00:00:56,190 --> 00:00:57,270
approach as well.

14
00:00:57,270 --> 00:01:03,270
So this is a high level overview of what we are going to do in the upcoming videos.
