Minimum Number of Taps to Open to Water a Garden | Full Dry Run | ATLASSIAN | Leetcode - 1326

[@codestorywithMIK]

(Have been very busy today, apologies I couldn't reply to comments) Hi everyone, upon seeing so many requests for DP video for this problem. The DP video for this problem is being uploaded now. Hope it will help Thank you all ❣

[@dhairyachauhan6622]

really awesome bhiya u r the best :)

[@chaitanya812]

Thanks bhaiya for solving using 2 different approach

[@codestorywithMIK]

Glad to hear that it helped you guys. Thank you for watching 😇❤️

[@sh1vvyy]

after listening to your story, i literally can write the code without any errors and this totally feels like magic i swear, thank you so much!!

[@RajanSingh-xr7cf]

before 2 monts i was not capable for solving the easy level question ------- after watching the 100 video of array playlist ----- get confidence ------------- now accessing the greedy ---------------- BE honestly ..... hardly i will clear the coding round ...... i am in 3rd year (5_sem) ......... BE honsetly ----- i work so hard ----- access almost all the playlist as much as posible__ mera din bhaiya k concept s and night bhiii ____

[@souravjoshi2293]

I won't get tired of saying "YOU ARE THE KING OF DSA"

[@sauravchandra10]

Solved it using greedy by modifying the merge intervals approach. Less efficient than your approach though. Here is the code: class Solution { public: int minTaps(int n, vector& ranges) { vector intervals; for(int i=0;i

[@iamnoob7593]

Wow i had to see this video 2 times to get the intution regarding currEnd , Thanks

[@codestorywithMIK]

If anyone is wondering why currEnd is used to increment the tap (tap++), Actually, If at any point we find that the current position cannot be watered from any previous tap, the garden cannot be completely watered, we open a tap (tap++)

[@wearevacationuncoverers]

got it . thanks a lot

[@aniketnama8390]

we can check it or update it when we are changing maxend is it we ?

[@singerpranavmodi]

The way you explain specially in Hindi is just brilliant. Keep up the great work. Subscriber earned.

[@codestorywithMIK]

Thanks a lot 😊

[@kunalwadhai777]

Thank you very much sir for providing such content which helps me to solve leetcode's daily streak problems....and just because of this all your effort sir I earned an August month badge.

[@wqffeqf]

Mast question hai Very nicely explained. After hearing story it got easy. Thank you bro ❤❤❤

[@thekindspill]

Awesome explanation. 13:20 is the reason why I love this channel. However, I never like greedy problems, they are always very irritating. Please also make DP video for this.

[@floatingpoint7629]

very helpful explanation -- thanks for it and dry running the examples.

[@yikes3807]

Thanks for your videos sir boht acchese samzate ho

[@dayashankarlakhotia4943]

class solution { Public int min Tap(int n,int []range){ int start =0,end =0,tap=0; while (end

[@k.vabhavmishra]

LC 1024 is also similar Problem name is Video Stitching in which it is asked the minimum number of clips needed so that we can cut the clips into segments that cover the entire sporting event

[@chaitanya812]

Thanks for this..... Also asked in Intuit tooo

[@dayashankarlakhotia4943]

Public class solution { Public int min Tap(int n,int []range){ int[]arr=new int [n+1]; Array. fill (arr,0); for(int i=0;i

[@ganeshmula4508]

Thank you sir💥💥💫🙏🙏🙏

[@shivaggarwal4073]

at 3:21, we cannot take index = 5 because [4,5) will be unwatered and only [5,5] range will be watered, we can instead take index 4 and our whole range of garden will be watered.

[@YashSinghal]

nice solution and explained amazingly

[@dhairyachauhan6622]

Bhiya if possible can u make a video for the same question using dp. It will be really helpfull also you can add that to the dp questions and concepts playlist 😅🔥

[@codestorywithMIK]

Definitely 😇❤️🙏

[@codestorywithMIK]

See my Pinned comment ☺❣

[@mohithadiyal6083]

The best explanation

[@adilkhatri7475]

3 times dekha tab samja but samj gaya.

[@anuppatankar4294]

Great Video 🔥

[@rajkrishanmahajan2373]

for who those want to solve similar question search no (45)Jump Game II && (1024) Video Stitching

[@AmarjeetKumar-to9ub]

Thank You :)

[@vineethkumar8094]

It would be great if you could post such informative videos in English as in IT industry we are going to communicate in English..Looks like your videos will be useful only for Hindi knowing audience...Pls take it as a humble suggestion. Thanks a lot for the video

[@TheProblemSolvers38]

You didn't tell the reason why we are increasing the taps count when i > currEnd. This is same like memorizing the code.

[@codestorywithMIK]

Hi there , Apologies if you felt so. I ensure that my videos are never memorised. However if you felt so in this video, i will try to improve it. Let me try it here. Whenever you are at any index i, you know two things : 1) What is the maxend on right side which is watered by any past tap. If you have already crossed it (i.e. i > maxEnd) It means that even after maintaining the maxEnd till now, i reached out of bound of maxEnd which indicates that it’s not possible to water the garden. 2) you have not crossed the maxEnd but you have crossed the limit of your last seen tap. For example : when you are at index 0, you set maxEnd to something but you never incremented the tap count because if the beginning your current limit you assumed was 0 and now as soon as you moved to index 1 and you realised that you have crossed your currlimit that was index 0, you should have opened the tap. So we do tap++ in that case. I really appreciate your feedback but i want to ensure that I never try to make any video on concepts which people have to memorise because that will defeat the purpose of my teaching. Thank you so much ❤️❤️❤️ Also kindly check out my DP video for this same problem.

[@TheProblemSolvers38]

@@codestorywithMIK Hey, really loved your positive spirit.....Just saw your Dp solution and I understood the dp solution in an easy way. Greedy solution is a bit complicated.

[@codestorywithMIK]

@EnglishTracks Totally agree brother. Thank you for your feedback and response 😇❤️🙏

[@YashSinghal]

was not able to memoize my recursive solution 😅 class Solution { public: int solve(int n, vector& ranges, int idx, vector watered){ if(idx==n){ for(int i = 0; i

[@YashSinghal]

the greedy approach is almost impossible to think if not already seen before

[@codestorywithMIK]

See my Pinned comment ☺❣

[@dayashankarlakhotia4943]

dp solution. class solution { Public int minTap(int n,int[]range){ final int INF=(int)1e9; int[]dp=new int [n+1[; Array. fill (dp,INF); dp[0]=0; for(int i=0;i

[@053_tanweer7]

Please write memorize version

[@dhairyachauhan6622]

SOLUTION USING DP class Solution { public: int dp[(int)1e4+7]; int solve(vector&startEnd,int idx){ int n = startEnd.size(); if(startEnd[idx].second >= n-1){ return 1; } int ans = 1e9; if(dp[idx]!= -1){ return dp[idx]; } for(int j = idx+1;j startEnd[idx].second){ break; // cant go ahead } int val = 1 + solve(startEnd,j); ans = min(ans,val); } return dp[idx] = ans; } int minTaps(int n, vector& ranges) { vectorstartEnd; // step 1 make the table of ranges for(int i = 0;i

[@codestorywithMIK]

See my Pinned comment ☺❣

[@nikeshsingh2081]

Add similar type questions for hw

[@chetnamittal9537]

Not quite understood the use of current end

[@suvamroy6205]

I still dont get whats the need for currentEnd?

[@chaitanya812]

can you upload the dp solution too as when i saw it dp was my initial thought

[@codestorywithMIK]

Same 😇

[@codestorywithMIK]

See my Pinned comment ☺❣

[@saquibabbas1709]

Mik Sir can you explain #DynamicProgramming Approach

[@codestorywithMIK]

See my Pinned comment ☺❣

[@unknown47896]

i really hate greedy problems

[@sarthakyadav9950]

Bhai ye greedy problems ka koi tod batao intuition build karne ka boht difficult jata hai

[@darshandesale]

apne kya steps follow kiye the batao na me karne ke liye tayar hu

[@phoddaal7130]

Sir aapke jump game 2 wale solution mein if( i == curEnd), wali condition use hui hia and isme aapne if( i > curEnd), iska kya reason hai, ye difference kyon aya hai . Is it because in this question tap ka effect peeche wali side bhi and jump game wale question mein sirf effect of jump forward direction mein hi hai. So, we can go ahead and check if there is need to on the tap later. But in jumping, we have to jump prior coz i cannot move forward if i don't increase jump so i have to increase the point i cannot move index

[@ishwarkoki1119]

ye maine dp se solve kiya, greedy mereko nhi chamka

[@codestorywithMIK]

Actually Greedy problems are always a pain. I hope when I share DP solution that will be more helping ❤️🙏

[@053_tanweer7]

Greedy se jyada ab dp chamkta hai

[@codestorywithMIK]

See my Pinned comment ☺❣

[@top_g755]

Sir maine aapke unique binary search tree wale video par ek question puch h please reply kariye

[@factsmadeiteasy9943]

bhaiya are you currently working in some comapny?

[@tutuimam3381]

❤❤❤

[@sachinmohanty4577]

Please MIK post DP solution also today itself if possible 😢

[@codestorywithMIK]

See my Pinned comment ☺❣

[@MrUnknown-g4u]

I can't understand why it can't water when n = 3 and arr ={1,0,0,1}

[@darshandesale]

bhaiya apse samz leta hu par khudse nahi solve ho pate he kya karu please batao na bohot pareshani me hu

[@audumbarchinchkar5262]

if we set currEnd =-1 before starting and change the order of last for loop will this work?

[@TheProblemSolvers38]

Try

[@audumbarchinchkar5262]

@@TheProblemSolvers38 I did dry but it does work for some cases but not for all and I am unable to decipher why?

[@yashgarg3027]

bhaiya jump game 2 i have solved using dp please bhaiya by today only upload dp solution of this as well

[@amitguptapc]

not able to understand why currentEnd is used😢

[@codestorywithMIK]

Actually Greedy problems are always a pain to understand most of the times. I hope when I share DP solution that will be more helping ❤️🙏

[@codestorywithMIK]

Actually, If at any point we find that the current position cannot be watered from any previous tap, the garden cannot be completely watered, we open a tap (tap++)

[@amitguptapc]

@@codestorywithMIK Thanks a lot bro. I really enjoy all your videos. Thank u for addressing my query. Wishing ur channel great success.

[@codestorywithMIK]

@amitguptapc means a lot ❤️😇

[@thekindspill]

@@codestorywithMIK Thanks lot. I got it.

[@raganaroak182]

🙏🙏🙏

[@Rajat_maurya]

Jump game II toh DP and memo se ban gaya

[@codestorywithMIK]

See my Pinned comment ☺❣

[@dayashankarlakhotia4943]

good explanation dp solution ka Tc0(n*n); ha please tell me

[@codestorywithMIK]

Yes DP is quadratic

[@codestorywithMIK]

See my Pinned comment ☺❣

[@3011hi]

@codestorywithMIK sir after ur last guidance video sir.. I started arrays ,2d arrays and vectors and completed it.. Now I wanna do leetcode questions as u told in video but not understanding which to do.. If possible in ur next video can u pls give list of pure topic wise questions sir ( without mixed concept).. It will be very helpful.. Can we expect the video on this sunday

[@xiaoshen194]

Yr 😭😭. I failed firse. Main kabse DP try kr rha tha (choose-not choose). Pta hi nhi chalta greedy h Ki dp

[@codestorywithMIK]

Trust me you didn’t fail. There is a DP solution as well. I will be sharing DP video on this soon and will also explain why “choose-not choose” is not suitable for this problem

[@xiaoshen194]

@@codestorywithMIK thnk U😃🙏

[@Ashwani64323]

​@@codestorywithMIKrespected sir kya aap wo video aaj hi upload krenge ...ho ske to aaj hi kr dijiyega...Maine bhi dp se try kia tha

[@codestorywithMIK]

See my Pinned comment ☺❣

[@39_jatinjain4]

today's question is little bit confusing

[@codestorywithMIK]

Actually Greedy problems are always a pain. I hope when I share DP solution that will be more helping ❤️🙏

[@39_jatinjain4]

@@codestorywithMIK yes now it's easy but when I will try to do this after some time then definitely it creates problem

[@codestorywithMIK]

See my Pinned comment ☺❣

[@RahulGuptaa29]

DP is technique, Greedy is art

[@codestorywithMIK]

Indeed See my pinned comment 😇

[@aravindkumarn1776]

Tell me whats the use of creating education content in hindi?Did any tier1 and tier2 ask you explain the solution in hindi in any interview? What about people from south or who dont know hindi and having keen on solving problem in leetcode using your channel?

[@rahulmaurya6451]

bhai... yeh koi English Education Lecture ni hai ,, Yha concepts milta hai and all of us here only for the valuable concepts and Only MIK can explain these concepts perfectly in a very Layman terms ... Even someone who don't know coding can easily learn these concepts from MIK. For those who don't know their own mother tongue they should try to learn Hindi first not the Foreign One.

[@thekindspill]

@@rahulmaurya6451 Totally agree with you bhai. Also @aravindkumarn1776, I would suggest you to use any online translator. But, I don't agree with your point "whats the use of creating education content in hindi" It's totally upto the guy how he wants to create his content. I understand that making videos in English might make it reachable to many more But the point is for people who don't understand English well, or those who like things in Hindi or friendly way, this content is gold. Please don't mind if any of my words hurt anyone, but I am speaking as per what I have seen in my college. People have gone crazy for this channel and literally everyone watches his channel in my college.

[@wearevacationuncoverers]

@@rahulmaurya6451 💯

[@wearevacationuncoverers]

Hey @aravindkumarn1776, I am also from South. Fortunately my flatmate understands Hindi and he explains it to me where I don't understand some Hindi words. But I think you can use online AI tools like dubverse . They automatically add English subtitles to the video. Hope that helps bro

[@aravindkumarn1776]

@@wearevacationuncoverers Thanks brother for suggesting new tool. tell me, In case if no one from your circle dont know hindi, then definitely you can feel the pain