The best part about your explanation is that you always develop the intuition first. That helps me a lot in solving other similar problems. Keep making more videos of interviewbit problems. Thanks a lot.
thanks for the approach, I understand the concept clearly, but one thing I want to say is that changing input may not be feasible always, so it's better to keep a variable which ++ and -- accordingly.
your way of teaching is really superb when ever i understand any problem by you it clear my concepts. thanks Alisha didi di can you tell me how should i make dsa notes ? or make a video how to make dsa notes
for java users - public static int[] flip(String A) { int left = -1, right = -1; int sum = 0, maxSum = 0, currleft = 0; for (int i = 0; i < A.length(); i++) { sum += A.charAt(i) == '0' ? 1 : -1; if (sum < 0) { sum = 0; currleft = i + 1; } if (sum > maxSum) { maxSum = sum; left = currleft; right = i; } } if (left == -1 && right == -1) return new int[0]; return new int[]{left + 1, right + 1}; }
Actually in this approach, we are considering only the best flipping which will give us the maximum no. of ones. So, we are constantly updating our L and R values and only return the best pos. Hope this will help.
At the timestamp 7:22 in the kadane algorighm. the solution will not work for all the negative integer array. For example if the array is {-2,-4,-9,-3,-1} The maximum subarray sum will be -1. But with the above pseudo code, it will be 0.
The best part about your explanation is that you always develop the intuition first. That helps me a lot in solving other similar problems. Keep making more videos of interviewbit problems. Thanks a lot.
Thanks Avinash!
Just came across this channel. One of the best and easy-to-understand content. Thank you
Thank you Manik!
Really loved the way you have explained the concept and related the two problems.
Top notch explanation. Thank you for existing
Glad you liked it!
I really like your way of explaining
thanks for the approach, I understand the concept clearly, but one thing I want to say is that changing input may not be feasible always, so it's better to keep a variable which ++ and -- accordingly.
Tysm mam, it was great, loved it, big fan of u mam
Just got to know that you are an alumni of my college IIT Bombay, your videos are really helpful.
Great Explanation
very nice explaination along with related topic so you to go nowhere for 1 question.
Great job
nice explanation(intution part)
Thank you so much
Make more videos you are really awesome
your way of teaching is really superb when ever i understand any problem by you it clear my concepts.
thanks Alisha didi
di can you tell me how should i make dsa notes ? or make a video how to make dsa notes
fantastic !!
Thanks for the video!
Beauty with brain....very nice explanation mam!
for java users -
public static int[] flip(String A) {
int left = -1, right = -1;
int sum = 0, maxSum = 0, currleft = 0;
for (int i = 0; i < A.length(); i++) {
sum += A.charAt(i) == '0' ? 1 : -1;
if (sum < 0) {
sum = 0;
currleft = i + 1;
}
if (sum > maxSum) {
maxSum = sum;
left = currleft;
right = i;
}
}
if (left == -1 && right == -1) return new int[0];
return new int[]{left + 1, right + 1};
}
Hey Alisha Plz tell the way how to remember ,truth table of all flip flops quite confusing
I guess you skip this part "return the lexicographically smallest pair of L and R."
but code still runs. Why?
Actually in this approach, we are considering only the best flipping which will give us the maximum no. of ones. So, we are constantly updating our L and R values and only return the best pos.
Hope this will help.
At the timestamp 7:22 in the kadane algorighm. the solution will not work for all the negative integer array.
For example if the array is {-2,-4,-9,-3,-1}
The maximum subarray sum will be -1. But with the above pseudo code, it will be 0.
just init maxSum with arr[0]
for that take the value of max_sum as INT_MAX
hi , answer could be one or more right ...how did u check lexicographically for the same
More than half test cases failed with this solution. Explaination good for the question and kadane algo but figuring out index not explained.
can u plzz share your code
can you please drop your linkedIn id
hi mam I wanna Connect With you can i get your LinkedIn ID