Video

sorry but very poor explaination i think i have to watch others

Great explanation and very simple code

Thanks you made it easy.. its hell of a task to resume after a gap of 15 days at leetcode

Kaha ho didi ap

bad time complexity

Wow 🔥😍

Better explanation for this question.✨✨

thanks 🙏

done thanks

Nice solution btw

Dp

nice explanation ma'am, i am little confused about subsequence but you just made it easy. So thank you

Why order is not preserved if we start from index 0.

Thanks for clear explanation Priyanshi , I everyday practise seeing your solution.

how many if you watching the solution after getting blank to see this question. You don't even get how to write the recursion???

Nicely explained 🔥

I watch other videos but not able to understand .Dry run part of DP clear all my doubts .Thanks for the explanation .

Thank you for this crisp explanation🙂

Nice explaination

Explanation 👌

Great solution!

Congratulations for 1K 🎉

Understood the concepts so well. Very helpful. Thank you ma'am 👍🏻

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.

1k soon. 🎉

Somehow came across this video and iski wajah see I learnt the histogram question and this one. Thanks!

Great Explanation 💯💯

Hi sister, Can you please explain java solution along with your c++ solution ?

public int minOperations(int[]nums,int k){ for(int num:nums) k^=num; return Integer.bitCount (k); } 🎉❤

Great Explanation 💯💯

Sorry for the bad throat! 🙊

Amazing explanation

Do you use some sort of stylus pen, I too upload Lc solutions but i use pen and paper lol

Great Explanation 💯

Great Explanation 💯💯

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

Nice ..

Great Explanation 💯💯

good explanation what is the time and space complexity?

Nice explaination

Well explained!

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);

Great Explanation 💯💯

why are you not posting videos😢

Impressive, keep going!

Amazing video and great explanation

nice explanation

Greatest of all other solutions 🙏🏻😊🫂

Great Explanation 💯💯

upload late hua :(