Скачать или смотреть Zero One Knapsack | Dynamic Programming and Greedy | In English | Java | Video_10

Description:

In this video, we start with the famous Knapsack problems and solve the 0-1 knapsack problem where we are required to fill a knapsack with weights up to certain capacity which have the greatest value.

Question Name:
Zero One Knapsack

Question Link:
Pepcoding Portal Link: https://www.pepcoding.com/resources/o...

Question Statement:
1. You are given a number n, representing the count of items.
2. You are given n numbers, representing the values of n items.
3. You are given n numbers, representing the weights of n items.
3. You are given a number "cap", which is the capacity of a bag you've.
4. You are required to calculate and print the maximum value that can be created in the bag without
overflowing it's capacity.

Note1 - Each item can be taken 0 or 1 number of times. You are not allowed to put the same item again and again

5. For more details watch the video.

Topic: #DynamicProgramming #DP #01knapsack

Used #DataStructure: #2DArrays #Recursion #Memoization #Tabulation

#TimeComplexity: O(2^n)

#SpaceComplexity: O(n*c) //where n is the total number of items and c is the capacity of the bag given to us

--------------------------------------------------------------

Smimilar Questions:

1. Unbounded Knapsack:

a. Pepcoding Portal Link: https://www.pepcoding.com/resources/o...

2. Fractional Knapsack:

a. Pepcoding Portal Link: https://www.pepcoding.com/resources/o...
--------------------------------------------------------------

Dependent Questions:

1. Unbounded Knapsack:

a. Pepcoding Portal Link: https://www.pepcoding.com/resources/o...

2. Fractional Knapsack:

a. Pepcoding Portal Link: https://www.pepcoding.com/resources/o...

--------------------------------------------------------------

More Youtube PlayList:

Level 1 In Java English :    • Java Level 1 In English  
Level 1 In Java Hindi :    • DSA - Level 1  
Level 2 In Java Hindi :    • DSA - Level 2  
Constructive Algorithm - Level 3 :    • Constructive Algorithm - Level 3  
Geometry - Level 3 :    • Geometry Level 3  
Maths for CP - Level 3 :    • Maths For CP - Level 3  
DP - Level 3 :    • DP - Level 3  
Euler Tour - Level 3 :    • Euler Tour - Level 3  
Ternary Search :    • Ternary Search  
Recursion & Backtracking - Level 1 :    • Recursion & Backtracking - Level 1  
Recursion & Backtracking - Level 2 :    • Backtracking - Level 2  
Graphs - Level 1 :    • Graphs - Level 1  
Dyanmic Programming - Level 1 :    • Dynamic Programming - Level 1  
Generic Trees - Level 1 :    • Generic Trees - Level 1  
Time and Space - Level 1 :    • Time and Space - Level 1  



---------------------------------------------------------------

Pepcoding has taken the initiative to provide counselling and learning resources to all curious, skillful and dedicated Indian coders. This video is part of the series to impart industry-level web development and programming skills in the community.



We also provide professional courses with live classes and placement opportunities.


For more visit our website: https://bit.ly/2ZCS68a
For more free study resources, visit: https://bit.ly/3liICaJ
Have a look at our result: https://bit.ly/2YcmDZR

Follow us on our Youtube page:    / pepcoding  
Follow us on our FB page:   / pepcoding  
Follow us on Instagram:   / pepcoding  
Follow us on LinkedIn:   / pepcoding-education  
Follow us on Pinterest:   / _created  
Follow us on Twitter:   / pepcoding  


.

.

.

Happy Programming !!! Pep it up

----------------------------------------------------------------

#DP #DynamicProgramming #01knapsack