THank you! Your explanation allows to grow analytical skills and setup the way of thinking about the problem. I also discovered that we can reach any `n` if the `prefixSum` of existing numbers more then `n`, but I couldn't code the solution :(
WHY GREEDY WORKS _TO PROVE_ ----> If the greedy algorithm needs to patch k numbers to cover [1,n] it is impossible to patch less than k numbers to do the same. _Proof by contradiction_ let's say for a given value of n and an array nums GREEDY gives x1 < x2 < x3 < ... < xk patches (total K patches) ANOTHER SOLUTION gives y1
![BRASIL vs. URUGUAY [1-1] | RESUMEN | ELIMINATORIAS SUDAMERICANAS | FECHA 12](http://i.ytimg.com/vi/-hWBAuxF1eY/mqdefault.jpg)
How to balance College & CP - ruclips.net/video/79rxV2d86ww/видео.html
You and Neetcode are the only people I understand
Good thing that this guy uploads daily, solely responsible for my streak
Aryan Bhai Aaj pehli baar leetcode contest mei 4 problems solve kiye, your segment tree video is really great, thanks a lot
can you explain 3 problem i tried with class Solution {
public:
bool possible(int p,int check)
{
if(p==check-1 || p==check+1 || p==check+2 || p==check-2)
{
return false;
}
return true;
}
long long maximumTotalDamage(vector& power) {
sort(power.begin(), power.end());
int maxValue = *max_element(power.begin(), power.end());
long long pow=maxValue+2;
vectordp(maxValue + 4, 0);
for(int i=1;i=0;j--)
{
if (possible(power[i-1], j)) {
dp[j]= max(dp[j],power[i-1] + dp[power[i-1]]);
}
}
}
return dp[pow];
}
}; with this it was giving tle
THank you! Your explanation allows to grow analytical skills and setup the way of thinking about the problem. I also discovered that we can reach any `n` if the `prefixSum` of existing numbers more then `n`, but I couldn't code the solution :(
prefix sum find's us subarray sum? but here we can get through any possible combination isn't it?
Superb explanation!! Thank you so much Aryan! 👍
Some simple observation that number such as ((1
Thank you Aryan ❤.
beautiful explanation!
Great Explanation brother !!
Awesome explanation man !
Can you write a bit of a big text
WHY GREEDY WORKS
_TO PROVE_
----> If the greedy algorithm needs to patch k numbers to cover [1,n] it is impossible to patch less than k numbers to do the same.
_Proof by contradiction_
let's say for a given value of n and an array nums
GREEDY gives x1 < x2 < x3 < ... < xk patches (total K patches)
ANOTHER SOLUTION gives y1
weekly contest problem ??
Coming sir🫡❤️
Let him breath haha.
@@PalakKalsi he is expert ,so he need to be quick😅
When we add 2 then we can make 3. Now 1 and 3 van make 4 so why you add 4 here
bhaiya dimag kharab hogya ye question samajhte samajhte
ab pehle iska code likhunga, fir subah uth kr dry rrun krunga 2-3 baar
Great explanation sir !! Saluting your efforts even on Sunday morning !!🫡🫡🫡
🫡🫡🫡
bro your english prickles my ear please work on it or speak in hindi you are so repeatitive man !!! just speak to the point and move on
wtf, he is doing it for free! respect that dumbo