01 Knapsack using Recursion | Building Intuition

  Рет қаралды 51,453

Techdose

Techdose

3 жыл бұрын

This video explains the concept of 01 knapsack as well as explains all the details and in-depth explanation using simple examples on how to build intuition to write a recursive code for 01 knapsack.I have first explained what is 01 knapsack and its constraints.After that, I have shown what all things should be considered for solving such problem.I have shown the idea of solving this problem using recursion and at the end of the video, I have also shown how to build the code logic and the final code using previous ideas and concepts.The time complexity of this approach is exponential. If you find any difficulty or have any query then do COMMENT below. PLEASE help our channel by SUBSCRIBING and LIKE our video if you found it helpful...CYA :)
========================================================================
Join this channel to get access to perks:
/ @techdose4u
INSTAGRAM : / surya.pratap.k
SUPPORT OUR WORK: / techdose
LinkedIn: / surya-pratap-kahar-47b...
WEBSITE: techdose.co.in/
TELEGRAM Channel LINK: t.me/codewithTECHDOSE
TELEGRAM Group LINK: t.me/joinchat/SRVOIxWR4sRIVv5...
=======================================================================
#01knapsack #knapsack #dynamicprogramming

Пікірлер: 134
@adityasarin39
@adityasarin39 3 жыл бұрын
This explanation is the best I have ever found for recursion! Covering each and every small detail, step by step 👌
@Sky-nt1hy
@Sky-nt1hy 3 жыл бұрын
wtf i seriously don't understand why you have only 38K subs. I've been working on Algorithm on my own for the last 6 months and have seen more than 100 channels. They're all great but I have never seen a channel better than yours. I will spread this out to help more people. Thanks always bro.
@sridharanshooriya772
@sridharanshooriya772 3 жыл бұрын
You are a life saver! Even coursera course on dsa didn't explain as beautifully as you did. Reading out of a slide made it hard to understand. Your teaching method works like a charm! I'm honoured that you do these videos balancing your work life. Thank you surya!
@hardiksrivastava6395
@hardiksrivastava6395 2 жыл бұрын
This is by far the BEST explanation compared to all coding platform giants. Your videos on DSA are superb and to the point. Much much appreciation and love !! You are great !!!!
@pramodsharma4508
@pramodsharma4508 3 жыл бұрын
I think you should do more dp problems with their recursive solution first...it really helps in building the thought process of the problem...
@123liveo
@123liveo 2 жыл бұрын
This explanation is absolutely superb. This at the next one about memoization really helped. Recommending it on my uni algorithm course. Cheers!
@haqinzmamul12
@haqinzmamul12 Жыл бұрын
Bro I scroll upto 10 times down videos on KZbin for dp there are so many great I watched all of them one by one but you're hero among all of them.... keep going you'll be remarkable one day
@maryam1777
@maryam1777
Man my God keep you in great happiness.. YOU ARE MY LEGEND
@ihsannuruliman3656
@ihsannuruliman3656 2 жыл бұрын
this is a great channel, even better than I was thought.
@prabhatmishra6753
@prabhatmishra6753 2 жыл бұрын
I was very furious about English explaination but when I started watching him , his explanation is enough to understand you what actually a code wants from you as well as very clear explanation
@AlbtzGaming
@AlbtzGaming 3 жыл бұрын
You make us falling love in coding !! Thank you very much for your effort !!!
@abhijitroy1958
@abhijitroy1958 2 жыл бұрын
best explanation till now of knapsack
@kush-cp8kc
@kush-cp8kc 2 жыл бұрын
thank you so much for this much detailed and pin poined thing ....it was really really helpful and the best till now... .
@RCavivhal
@RCavivhal 2 жыл бұрын
Thank u for this tutorial, great explanation.
@nicknack9908
@nicknack9908 3 жыл бұрын
This was a great explaination! Helped me a lot with my coding homework in university, which I could not solve. (Currently studying computer science in Germany.) Keep the great work going!
@sridharanshooriya772
@sridharanshooriya772 3 жыл бұрын
The naive approach was explained intuitively. Thank you!
@CodingRegion
@CodingRegion Жыл бұрын
Thank you for this video💙
@noc12
@noc12 2 жыл бұрын
I am following this channel when it has 10k..finally got what u deserve..congrats for 100k subs
@malikwaseem1983
@malikwaseem1983 3 жыл бұрын
This is explained really well. Thanks Tech Dose. I love your channel.
@abhishekkumarjhariya1340
@abhishekkumarjhariya1340 2 жыл бұрын
Great explanation .
01 Knapsack using Memoization | Concept of Memoization
18:03
Techdose
Рет қаралды 37 М.
He sees meat everywhere 😄🥩
00:11
AngLova
Рет қаралды 9 МЛН
Did you believe it was real? #tiktok
00:25
Анастасия Тарасова
Рет қаралды 13 МЛН
The Backtracking Blueprint: The Legendary 3 Keys To Backtracking Algorithms
13:44
Mastering Dynamic Programming - How to solve any interview problem (Part 1)
19:41
Jonathan Blow on computer science curriculum
8:36
Anton Swifton
Рет қаралды 81 М.
5 Simple Steps for Solving Any Recursive Problem
21:03
Reducible
Рет қаралды 1,2 МЛН
The 0/1 Knapsack Problem (Demystifying Dynamic Programming)
20:30
Back To Back SWE
Рет қаралды 202 М.
This Algorithm is 1,606,240% FASTER
13:31
ThePrimeagen
Рет қаралды 749 М.
5 Simple Steps for Solving Dynamic Programming Problems
21:27
Reducible
Рет қаралды 1 МЛН
How I would learn Leetcode if I could start over
18:03
NeetCodeIO
Рет қаралды 284 М.
P vs. NP and the Computational Complexity Zoo
10:44
hackerdashery
Рет қаралды 3,4 МЛН
0-1 Knapsack problem - Inside code
10:54
Inside code
Рет қаралды 8 М.
He sees meat everywhere 😄🥩
00:11
AngLova
Рет қаралды 9 МЛН