Розмір відео: 1280 X 720853 X 480640 X 360
Показувати елементи керування програвачем
Автоматичне відтворення
Автоповтор
This thing has so much potential.And there's not many people who are doing this.If you can continue doing this it will definitely add so much value.
Thanks a lot, sir for giving me an opportunity to be in the live stream with you.
us rahega bhai
Is there any reference material for the trick used to convert 2d knapsack to 1d knapsack?
Sir I have a question?The Google test you take is on typical difficulty or it is on the lower side of difficulty??
for q2, can removal be handled by changing x to x+removed element?
Bhaiya question number 2 add or remove wala isko segment trees se kr skte kya ?
same hi chiz karoge with extra logb
Cool
haan chhote bhaiyo
solution of 1:class Solution {public: int waysToPartition(vector& nums, int k) { mapmp; int sum=0; for(int i=0;i0){ cout
Thanks for the contribution.
This thing has so much potential.
And there's not many people who are doing this.
If you can continue doing this it will definitely add so much value.
Thanks a lot, sir for giving me an opportunity to be in the live stream with you.
us rahega bhai
Is there any reference material for the trick used to convert 2d knapsack to 1d knapsack?
Sir I have a question?
The Google test you take is on typical difficulty or it is on the lower side of difficulty??
for q2, can removal be handled by changing x to x+removed element?
Bhaiya question number 2 add or remove wala isko segment trees se kr skte kya ?
same hi chiz karoge with extra logb
Cool
haan chhote bhaiyo
solution of 1:
class Solution {
public:
int waysToPartition(vector& nums, int k) {
mapmp;
int sum=0;
for(int i=0;i0){
cout
Thanks for the contribution.