DP with Bitmasking | Dynamic Programming Bootcamp | Day 6/6 | IIT Gandhinagar
Вставка
- Опубліковано 26 чер 2024
- Presenting the most comprehensive Dynamic Programming Bootcamp ever. This is the sixth and final lecture in a series of six lectures on DP. After completing this playlist, you can tackle any and all DP problems upto 1900 level on Codeforces. While this playlist might be useful for placements, after lecture 3, most of the stuff will be well above the things required in a normal DSA interview. The lectures will be pretty long so make sure to grab some snacks and keep a pen and paper handy with you.
Homework Problems:
leetcode.com/problems/minimum...
Link to the slides used in class:
docs.google.com/presentation/...
Timestamps:
0:00 Basic Introduction
0:32 A concept I bet you didn't know
17:26 Homework Problem 1
36:19 DP with Bitmasking
39:26 Motivation for Bitmasking
52:01 How to use DP along with Bitmasking
55:00 Constraint on N for Bitmasking
1:02:04 Problem Solving on DP with Bitmasking
1:26:39 State optimization in DP with Bitmasking
1:33:53 DP Bootcamp ends - normal chit-chat
Contact me here:
Twitter: / priyansh_31dec
LinkedIn: / priyansh-agarwal-88046...
Instagram: / priyansh31dec
Codeforces: codeforces.com/profile/Priyan...
CodeChef: www.codechef.com/users/priyan...
Discord: / discord
My Equipment:
⌨ Keyboard - Logitech G413 : amzn.to/3lk2YAQ
🖱 Mouse - Logitech M170 : amzn.to/2VqbBPr
💻 Monitor - Dell 24 Monitor-S2421HN : amzn.to/3rO0iwg
🎧 Earphones - OnePlus Bullets Wireless Z : amzn.to/2WN52qV
🎧 Ear Buds - amzn.to/3JQQ7iO
📸 Webcam - Logitech C920 : amzn.to/3flu4Up
📷 Tripod - Gorilla Tripod: amzn.to/3zX4j4P
💻 Laptop - MacBook Air M1: amzn.to/3DI24oa+
🎤 Mic - Boya Mic: amzn.to/3r38nzb
💡 Ring Light - Digitech: amzn.to/32RCPly
🖥 Table Mat - amzn.to/3tPhjJr
the first tip that you gave for tle was so helpful recently i gave a contest and just because of this issue i was getting tle in last testcase. Thanks alot!
Hey Priyansh......Please let us know at least the questions your are going to cover in day 7 at IIT Gandhinagar.
Thankyou for this playlist 🙏
Thanks u sir
I was not able to code the question taught in the class, could someone provide the code for it? I will definitely check it on GFG and other places, but if someone could provide the code as taught in the class then it would be much easier to relate and understand. Thank You !
I don't think traversing in memory space depends upon distance between two memory locations at all. It does matter when reading from HDD. Not even from SDD
When will tle eliminators 7 start?
Can anyone give c++ code of the question he had done.
Atleast let us know the problems which were solved in IIT Gandhi nagar.
I think it's from cses problem set .
Answer my question in the comments on the 2nd part of the dp series.
class Solution {
public:
int limit;
int find(vector&nums1,vector&nums2,int ind,int&mask,vector&dp)
{
if(mask==limit)
{
return 0;
}
if(dp[ind][mask]!=-1)
return dp[ind][mask];
int ans=INT_MAX;
for(int i=0;i>i&1)
continue;
int curr_score=nums1[ind]^nums2[i];
mask|=(1
Course is awsome but we are here to learn coding not learning concepts so at the end of every exploration and explanation you should be coding as well......
I hate your long pre written template because u should be going like
Bro one suggestion writing code is just converting your logic into code. It becomes way easier with time. If you know the concept, writing code will never be a problem.
@@diksha3157 yea but atleast show some example where that logic is applicable, there are millions of logics and tricks out there, give some kind of common example where that logic is applicable, otherwise it is as good a theoretical mathematics lecture. Interesting but of no use to people who are solving a pre-existing real world problem.