Пікірлер
@Manishkumar-ej3yt 2 күн бұрын
sorry but very poor explaination i think i have to watch others
@adityayadav2568 8 күн бұрын
Great explanation and very simple code
@shreyaverma6538 17 күн бұрын
Thanks you made it easy.. its hell of a task to resume after a gap of 15 days at leetcode
@RohanPatil-gz6un 28 күн бұрын
Kaha ho didi ap
@swarajpatil-pl2xu 28 күн бұрын
bad time complexity
@ashishkulkarni2350 Ай бұрын
Wow 🔥😍
@yashpaunikar671 Ай бұрын
Better explanation for this question.✨✨
@think9543 Ай бұрын
thanks 🙏
@akashghosh9335 Ай бұрын
done thanks
@RohitMahanandi-ij4zp Ай бұрын
Nice solution btw
@PriyankaKumari-zz4xy Ай бұрын
Dp
@abhisheksinghdhangar6539 Ай бұрын
nice explanation ma'am, i am little confused about subsequence but you just made it easy. So thank you
@ajitpalsingh606 Ай бұрын
Why order is not preserved if we start from index 0.
@akashghosh9335 Ай бұрын
Thanks for clear explanation Priyanshi , I everyday practise seeing your solution.
@amanmaurya7646 Ай бұрын
how many if you watching the solution after getting blank to see this question. You don't even get how to write the recursion???
@shashankpatel9635 2 ай бұрын
Nicely explained 🔥
@shiveshsingh2110 2 ай бұрын
I watch other videos but not able to understand .Dry run part of DP clear all my doubts .Thanks for the explanation .
@amitkumarbehera976 2 ай бұрын
Thank you for this crisp explanation🙂
@AnkitSingh-tm5dp 2 ай бұрын
Nice explaination
@manishakamble7473 2 ай бұрын
Explanation 👌
@LearntoCodewithNayan 2 ай бұрын
Great solution!
@LearntoCodewithNayan 2 ай бұрын
Congratulations for 1K 🎉
@visheshjoshi6809 2 ай бұрын
Understood the concepts so well. Very helpful. Thank you ma'am 👍🏻
@242deepak 2 ай бұрын
What is the proper logic/reasoning to the intuition that you told. Ideally if our strategy is to maximize the capacity usage of every boat (so as to minimize the number of boats), we should be greedy about using max weight with next max weight such that limit condition is satisfied. And indeed this approach gives correct answer but with O(n^2) solution. Not sure what is the proper reasing behind two pointer appoach.
@LearntoCodewithNayan 2 ай бұрын
1k soon. 🎉
@preetu391 2 ай бұрын
Yep 😁🚀
@musicalminute1287 2 ай бұрын
Somehow came across this video and iski wajah see I learnt the histogram question and this one. Thanks!
@pankajvishwakarma3246 2 ай бұрын
Great Explanation 💯💯
@preetu391 2 ай бұрын
Thank you!
@rrnayak9251 2 ай бұрын
Hi sister, Can you please explain java solution along with your c++ solution ?
@preetu391 2 ай бұрын
Sure in future I definitely will. Actually I don't code in Java that's the reason I don't, and immediately I will not because I am not much familiar with it, but I definitely have plans to do that.
@dayashankarlakhotia4943 2 ай бұрын
public int minOperations(int[]nums,int k){ for(int num:nums) k^=num; return Integer.bitCount (k); } 🎉❤
@pankajvishwakarma3246 2 ай бұрын
Great Explanation 💯💯
@preetu391 2 ай бұрын
Thank you!
@preetu391 2 ай бұрын
Sorry for the bad throat! 🙊
@UCSPathikDey 2 ай бұрын
Amazing explanation
@Kauliflower-yl8te 2 ай бұрын
Do you use some sort of stylus pen, I too upload Lc solutions but i use pen and paper lol
@preetu391 2 ай бұрын
Yep I use pen tablet
@pankajvishwakarma3246 2 ай бұрын
Great Explanation 💯
@pankajvishwakarma3246 2 ай бұрын
Great Explanation 💯💯
@ayeshasultana5508 2 ай бұрын
Ur approach to solving problem good. But difficult to understand. Don't no whether it's speed or high level explanation or writing.. I wanted to learn from u. Hardly I can watch 1 mint bcz I won't understanding
@preetu391 2 ай бұрын
Noted. Will try to improve on this
@yashkalia2311 2 ай бұрын
She has explained it really well!
@ayeshasultana5508 2 ай бұрын
Thank you@@preetu391
@kumarnishantnitallahabad160 2 ай бұрын
Nice ..
@pankajvishwakarma3246 2 ай бұрын
Great Explanation 💯💯
@mohdkhaleeq7468 2 ай бұрын
good explanation what is the time and space complexity?
@maheshprasad2598 2 ай бұрын
Nice explaination
@LearntoCodewithNayan 2 ай бұрын
Well explained!
@dayashankarlakhotia4943 2 ай бұрын
public int minFallingPathSum(int[][]grid){ int n=grid.length; for(int i=1;i<n;i++){ int p=0,min=grid[i-1][0],nmin=Integer.MAX_VALUE; for(int j=0;j<n;j++) if(grid[i-1][j]<min){ min=grid[i-1][j]; p=j; } for(int j=0;j<n;j++) if(j!=p&&grid[i-1][j]>=min&&grid[i-1][j]<nmin){ nmin=grid[i-1][j]; } for(int j=0;j<n;j++){ if(j!=p) grid[i][j]+=min; else grid[i][j]+=nmin; } } intvans=Integer.MAX_VALUE; for(int i=0;i<grid[0].length;i++) ans=Math.min(ans,grid[n-1][i]); return ans; } Tc=0(n*n); sc=0(1);
@pankajvishwakarma3246 2 ай бұрын
Great Explanation 💯💯
@RohanPatil-gz6un 2 ай бұрын
why are you not posting videos😢
@preetu391 2 ай бұрын
Posted
@codingkart245 3 ай бұрын
Impressive, keep going!
@BadalKumar-gv3xu 3 ай бұрын
Amazing video and great explanation
@vinaymaurya9201 3 ай бұрын
nice explanation
@dsa-videos48020 3 ай бұрын
Greatest of all other solutions 🙏🏻😊🫂
@pankajvishwakarma3246 3 ай бұрын
Great Explanation 💯💯
@saiei 3 ай бұрын
upload late hua :(