Search for notes by fellow students, in your own course and all over the country.
Browse our notes for titles which look like what you need, you can preview any of the notes via a sample of the contents. After you're happy these are the notes you're after simply pop them into your shopping cart.
Title: Dynamic programming - coding
Description: In my college the first company to visit was Nutanix, who offered 22lpa base salary Flipkart has 16lpa. Nutaix only visited our college for Interns. The first question they asked us was on a derivative of Matrix chain multiplication which is of course DP. In a DP problems we will always be given a choice Choice in a sense. If recursion have overlapping subproblems then DP can be applied to DP problems. DP problems always ask for something optimal. There is always a probability of DP First. If a function has two or more functions call, DP is applied. DP can be applied here. Please consider applying DP Point First Finished. Point Second : Optimal things will be asked What I mean by optimal here ? 1. Minimum 2. Maximum 3. Largest These all are optimal things Eg : Maximum Profit of an expression 2 * 5+3 Calculate the maximum value it can attend. In DP basically there are these 10 problems 10 PROBLEMS 0-1 knapsack. DP has many parent problems with many variations of themselves. All of these variations can easily be solved. But writing code by yourself is a big deal okay ? Soo Got it right ? 1. will write a. recursive solution 2. will do memoization 3. and then tabulation. and then write solution for tabulation DP But dont ever go for the tabulation directly. We gon na solve only one problem and we will easily be able to solve all its variations. These 80 problems of Dynamic Programming need not to be understood separately. So solve these 10 problems And develop concepts for 80. From the next video we will be picking up knapsack oaky ? Then we gon na discuss knapsacks really well with its Recursive solution with memoization and tabulation too
Description: In my college the first company to visit was Nutanix, who offered 22lpa base salary Flipkart has 16lpa. Nutaix only visited our college for Interns. The first question they asked us was on a derivative of Matrix chain multiplication which is of course DP. In a DP problems we will always be given a choice Choice in a sense. If recursion have overlapping subproblems then DP can be applied to DP problems. DP problems always ask for something optimal. There is always a probability of DP First. If a function has two or more functions call, DP is applied. DP can be applied here. Please consider applying DP Point First Finished. Point Second : Optimal things will be asked What I mean by optimal here ? 1. Minimum 2. Maximum 3. Largest These all are optimal things Eg : Maximum Profit of an expression 2 * 5+3 Calculate the maximum value it can attend. In DP basically there are these 10 problems 10 PROBLEMS 0-1 knapsack. DP has many parent problems with many variations of themselves. All of these variations can easily be solved. But writing code by yourself is a big deal okay ? Soo Got it right ? 1. will write a. recursive solution 2. will do memoization 3. and then tabulation. and then write solution for tabulation DP But dont ever go for the tabulation directly. We gon na solve only one problem and we will easily be able to solve all its variations. These 80 problems of Dynamic Programming need not to be understood separately. So solve these 10 problems And develop concepts for 80. From the next video we will be picking up knapsack oaky ? Then we gon na discuss knapsacks really well with its Recursive solution with memoization and tabulation too
Document Preview
Extracts from the notes are below, to see the PDF you'll receive please use the links above
In my college the first company to visit was Nutanix, who offered 22lpa base salary Flipkart
has 16lpa
...
The first question they asked us was on
a derivative of Matrix chain multiplication which is of course DP
...
If recursion have overlapping subproblems then
DP can be applied to DP problems
...
There is
always a probability of DP First
...
DP can be applied here
...
Point Second :
Optimal things will be asked What I mean by optimal here ? 1
...
Maximum 3
...
In DP basically there are these 10 problems 10 PROBLEMS 0-1 knapsack
...
All of these variations can easily be
solved
...
will write a
...
will do memoization 3
...
and then write solution for
tabulation DP But dont ever go for the tabulation directly
...
These 80 problems of Dynamic
Programming need not to be understood separately
...
From the next video we will be picking up knapsack oaky ? Then
we gon na discuss knapsacks really well with its Recursive solution with memoization and
tabulation too
Title: Dynamic programming - coding
Description: In my college the first company to visit was Nutanix, who offered 22lpa base salary Flipkart has 16lpa. Nutaix only visited our college for Interns. The first question they asked us was on a derivative of Matrix chain multiplication which is of course DP. In a DP problems we will always be given a choice Choice in a sense. If recursion have overlapping subproblems then DP can be applied to DP problems. DP problems always ask for something optimal. There is always a probability of DP First. If a function has two or more functions call, DP is applied. DP can be applied here. Please consider applying DP Point First Finished. Point Second : Optimal things will be asked What I mean by optimal here ? 1. Minimum 2. Maximum 3. Largest These all are optimal things Eg : Maximum Profit of an expression 2 * 5+3 Calculate the maximum value it can attend. In DP basically there are these 10 problems 10 PROBLEMS 0-1 knapsack. DP has many parent problems with many variations of themselves. All of these variations can easily be solved. But writing code by yourself is a big deal okay ? Soo Got it right ? 1. will write a. recursive solution 2. will do memoization 3. and then tabulation. and then write solution for tabulation DP But dont ever go for the tabulation directly. We gon na solve only one problem and we will easily be able to solve all its variations. These 80 problems of Dynamic Programming need not to be understood separately. So solve these 10 problems And develop concepts for 80. From the next video we will be picking up knapsack oaky ? Then we gon na discuss knapsacks really well with its Recursive solution with memoization and tabulation too
Description: In my college the first company to visit was Nutanix, who offered 22lpa base salary Flipkart has 16lpa. Nutaix only visited our college for Interns. The first question they asked us was on a derivative of Matrix chain multiplication which is of course DP. In a DP problems we will always be given a choice Choice in a sense. If recursion have overlapping subproblems then DP can be applied to DP problems. DP problems always ask for something optimal. There is always a probability of DP First. If a function has two or more functions call, DP is applied. DP can be applied here. Please consider applying DP Point First Finished. Point Second : Optimal things will be asked What I mean by optimal here ? 1. Minimum 2. Maximum 3. Largest These all are optimal things Eg : Maximum Profit of an expression 2 * 5+3 Calculate the maximum value it can attend. In DP basically there are these 10 problems 10 PROBLEMS 0-1 knapsack. DP has many parent problems with many variations of themselves. All of these variations can easily be solved. But writing code by yourself is a big deal okay ? Soo Got it right ? 1. will write a. recursive solution 2. will do memoization 3. and then tabulation. and then write solution for tabulation DP But dont ever go for the tabulation directly. We gon na solve only one problem and we will easily be able to solve all its variations. These 80 problems of Dynamic Programming need not to be understood separately. So solve these 10 problems And develop concepts for 80. From the next video we will be picking up knapsack oaky ? Then we gon na discuss knapsacks really well with its Recursive solution with memoization and tabulation too