When you practicing the DP problems for beginners then you will find 01 Knapsack problem as one of the highlighted problems in the pool.
Let me tell you that when you are going to learn the 01 knapsack problem (link provided below) you will find it interesting and you will see it as a
magical way to solve a problem which is in the foundation of many computing problems.
Any dynamic programming tutorial is incomplete without the 0/1 knapsack problem. But understanding the knapsack problem is an easy deal.
The complexity begins when you have to implement it to solve the dynamic programming problems based on it.
When you are preparing dynamic programming for coding interviews then practicing questions which are based on popular DP problems is required.
Joey tries to bring for you such dynamic programming examples which are spin-offs of the existing dynamic programming problems like Knapsack problem.
This DP problem is based on the 01 knapsack problem. The plot of this problem is intriguing and it is evident from its title only.
'Check if all people can vote on 2 voting machines'
So, what does this problem says?
Let's understand the problem in following steps-
There N people in line to vote.
There are 2 voting machines available. These machines will only be up and running for X minutes.
If the ith person takes a[i] minutes to vote, then you need to find out if all people can vote on 2 machines within the time X.
Here's the data -
N=3
X= 5 mins
A = 2,5,3
So, there are 3 people to vote. P1 takes 2 mins, P2 takes 5 mins and P3 takes 3 mins.
To design the dynamic programming algorithm of this DP problem, you must watch this video of Joey'sTech till the end.
21 окт 2024
