BS 19. Painter's Partition and Split Array - Largest Sum
HTML-код
- Опубликовано: 26 июл 2024
- Painter's partition: bit.ly/3XM8oFS
Split Array - Largest Sum: bit.ly/3Ck7UwL
Notes/C++/Java/Python codes:
We have solved the problem, and we have gone from brute force and ended with the most optimal solution. Every approach's code has been written in the video itself. Also, we have covered the algorithm with intuition.
Full Course: bit.ly/tufA2ZYt
You can follow me across social media, all my handles are below:
Linkedin/Instagram/Telegram: linktr.ee/takeUforward
0:00 Introduction of Course
You''ll realize what a good teacher this guy is when you come to that point when you solve the problem before watching the video. Thank you.
Exactly in the middle of the video I realized it can be solved using Books Allocation logic.
I have gotten so addicted to watching these videos at 2× that when I listen to the original "inspiration" song it seems to be so slow. Inspiration at 2x ( the one at the end of each of striver's video) is much better lol😂
WE ALL LOVE YOU and your ** DSA SHEET **......You are the one who has taught me and many others the amount of DSA we know......Thank you for that
solved on own, thanks man, because of your structured playlist, we are able to solve on our own. keep doing the great work.
Thanks striver I was able to solve question without seeing your video as these approaches you had told earlier.I am again seeing this video as to check whether any diiferent approach is present or not.Please continue this series
Understood! Super fantastic explanation as always, thank you so so much for your effort!!
Sir, you are the best teacher I have ever seen, and you explain the logic for solving the question very well.
Understood Sir, thanks a lot I have solved both the problem on my own and now I am feeling good because of it.
Who is here who is in 4th year and starting DSA now
Konse college se h bhai?
NIT Kurukshetra @@darknessmatters23
Me
@@VaishnavI-me8bz no still struggling and now I understand DSA is rubbish and overhipped. for 6-15 lpa no dsa required
@@VaishnavI-me8bz what are you thinking is I am fool . MS , Google stop faking first .
for the second question i passed all the test cases except for one by myself. And that understanding is developed after continuous practice...thanks striver bro
Did it all by myself !!!
Thanks Striver you r the best!!!
These videos are helping a lot striver !!
Thank you for this !!
Thanks striver this is the first time I was able to solve this problem before watching the video
Please complete this series ..
Increase the frequency of videos per day
Bro he has a job as well
So far the best explanation
First time i visualise how should one can learn or understand the pattern of the problem thankyou ❤
Hello Striver, please do upload the videos asap cause to keep up the continuity. I love your explanation its the best. That is why I want your videos and not other's.
Banda cp karta tha isiliye uska explanation baki log se alag hai and clear cut hai
solved the question without watching the video, but still watching to get the learning deep seated in my mind
Amazing Explanation sir!
❤ He is born for a reason, for a revolution. Thanks Bhai ❤❤❤
bro again i coded the painters problem by myself....kudos
Understood !! was able to solve the question on my own!!😄
nice video
please don't stop uploading video
Plz complete this BS series as soon as possible , very less time in left placement
understoood
oh waao this was wonderful...
Great Work
similar to leetcode #1101 problem but still thank you so much for the time to explain the problem.
PLEASE ADD GFG LINKS BACK TO A TO Z DSA SHEET
yes we use them to revise the stuff we've solved.Cause some questions aren't on leetcode so we have to go through them .@takeUforward @Striver
there's a chrome extension for that you can use it
Bhaiya plz upload more and more videos as soon as possible.......plz bhaiya request you bhaiya.....
Understood, thank you.
Thank you, sir.
a2z sheet me CN ki jagah gfg ke links wapas daal do sir please 🙏
bhaiya please finish this series as soon as possible
Do you have any idea when will this series get completed?
understood sir, when will you start linked list data structure
Thank you 😇
understood 😇
Understood 🎉
Bhai, thanks for the lecture , please increase the frequency of videos per day, we are waiting for stck, linked list, stack , queue, bit manipulation, . Atleast upload 11-15 videos per week if not 20. this course is going on for sooooo long. also put gfg link instead of CN
sir will be there any playlilst for strings??
Understood !! 😎😎
Sir please add gfg link in your sheet
in the painter brute force solition why is the conditon
understood❤
thanks
Is there an edge case in the cbook allocation problem where in the students counter go beyond students required? and also can the pagesStudent go beyond the pages?
Yeh ques mien sochna ni pada seedha code likha maine (submitted this ques within 5 min) just becoz aapne peeche similar ques bahut hi zada ache se explain kr rkhe the, This guy means it when he says No youtube playlist or paid course is better then a2z dsa course
RUclips video bss comment krne ke liye kholi thi aur bss, really thankful for this course bhaiya.
Understood it
Hey striver there’s a request if you can increase the pace of uploading videos it would be much better .
Bhai Please Start The Strings as soon as possible I will watch only your videos it is the best so please make videos as soon as possible PLACEMENT IS NEARING
If the constraint of consecutive jobs is removed, does it become a DP problem ?
Understood
i have a query if the question would have asked for the subsequence then we have to use DP ?
cout
❤❤❤❤❤
understood :)
Agar har 15 days me sirf 1 video aayi to engineering complete hogi par course complete nahi hoga 😕
understood
is there a method to solve it without binary search
like using recursion
Guess who's back. Back again.
Done
What if interviewer ask why you don't think of recursion and dp?
Dada will AI replace software engineers in future ?? Please reply Karo ❤
one day one video please
problem: You have a list of numbers that are sorted in increasing order. You also have two numbers, K and X. Your task is to find the K numbers in the list that are closest to X. If two numbers are equally close to X, you should choose the smaller one.
For example, if the list A is [2, 6, 7, 10] and K is 2 and X is 8, then the closest numbers to 8 are 7 and 6.
Hi. Could you create a binary search video for this "K closest element problem".😶
ps: I have been following your binary search playlist and I am happy that I found exact pattern of updating low, mid and high for all the problems. But in the above problem is there a way to follow the same binary search pattern?
I have seen many videos on youtube but everywhere they are updating high = mid and while condition is also different. It is like while(low
perform normal binary search on that number and at some point low >high . i.e low will point to next element and finally peform check if(arr[low]>arr[high] return high else return low ;
❤❤
Your submission failed for the following input
A : 1
C : [ 10 ]
Somehow it is getting failed for this value, can anyone help?
Happy teacher's day🎉❤😊 @raj
actually i solved painters partition earlier but seeing another problem i got confused that how to solved, then i jump to video solution and in the first 30 sec of video striver bhaiiya give hint that the problem is smililar so i solved problem using painters partition approach but my queastion is , how to recognize the pattern ?
👍
Can anyone explain why we took range like that??
"understood"
please explain the testcase
[2,3,1,1,1,1,1] with k=5
your code returns 4 possibleSubArray and its accepted , shouldnt it be 5 subArrays
I have got the same doubt it's the only test case in leetcode that is not passing if u use a answer variable for storing the mid instead of using the low pointer , but if you use low pointer to return the answer it is passing the test case , I think because the partition that is expected is {2} {3} {1,1} {1,1} {1} but according to strivers algo the partition is {2},{3},{1,1,1},{1} that is actually 4 and hence it is giving error
can this problem can be sloved by sliding window i mean for this test case the answer should be 10 4 5 10 9 10
k=4 ans =28? if not y?
please add GFG LINKS 😣😣😣😣😣😣😣😣😣🙏🙏🙏🙏🙏🙏🙏🙏🙏🙏🙏🙏
I do not know dsa at all. I just started a to z dsa course but here all the videos are not uploaded yet so what should I do?
Follow the sheet, it has many, the ones you don't find do a yt search, someone will definitely have one video on it
@@takeUforward thankyou
@@takeUforward Plz complete the BS series as soon so possible , the placements are coming
@@takeUforward please add back gfg links in another section.We use those links to revise the codes which i have already submitted coz some questions aren't on leetcode.
solved it in one go before watching the video !! than you striver
Sir please.... upload the videos fast...
What a guys should choose Metallurgy branch in jadavpur university or csc in jalpaiguri govt engineering college ?? Please help .....
None. Take Construction Engineering in LPU.
bhai mai toh solution dekhne aaya tha ...vo toh explain karta.
giving wrong ans
Thankyou for this course.Indeed the best explanation, Please start strings as in no RUclips channel strings explanation is upto mark🤍
Understood
understood
Understood
Understood
Understood
Understood
Understood
understood
understood
understood
understood
understood