How maximum is being calculated here plzz tell.
Also want to tell that u guys have not made good videos for array and pointers.kindly increase the understanding.
How max sum maximum sum
@Madhavendra-Gupta-2240591552663161 hey Madhavendra there are three method for calculating the maximum subarray sum which one you want to learn.
WHY THE HELL THOSE THREE METHODS ARE NOT EXPLAINED IN THE VIDEOS??
@Madhavendra-Gupta-2240591552663161 hey krishna there was three video maximum subarray sum 1, maximum subarray sum 2 (cumulative sum) approach and the third one is kadane algorithm
The method is brute force method and complexity of this method is o(n^3) and second approach computes in o(n^2) and last approach computes in linear time I would recommend to watch all three video first and let me know if any confusion arrives I will explain in brief.
I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.
On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.