Maximum Sum Circular Subarray (Microsoft, Amazon) : Explanation ➕ Live Coding

[@codestorywithMIK]

Small correction at 3:40 Answer for {5, -3, 5} will be 7

[@nagmakhan3165]

Got it

[@navinojha5637]

Why bhaiya it should be 10 only correct ? because if we rotate (5, 5, -3) maximum will be 10 right ?

[@navinojha5637]

sorry got it, I mistaked it with normal subarray sum

[@souravjoshi2293]

Respect++ Support++ Your videos are addictive

[@DeepakKumar-pd3lc]

Brilliant explanation>>>>>>>>>>>>>>>>>

[@summisahani6415]

Really impressed with your explanation. Thanks a lot. Keep posting.

[@divyangdheer7292]

college walo nai ghanta kuch nhi padhaya kaden's humne khud pdha hai aap jaise youtubers ki help se

[@codestorywithMIK]

❤️❤️❤️

[@Badalkumar-me9ok]

I have gone to other videos but didn't understand this concept but your video is awesome and now I have no doubt about this, thank you so much bhayia.

[@codestorywithMIK]

Glad to hear that ❤️❤️😇😇

[@wooldan7007]

Really!! man at 8:00 time stamp my search for actual reason gets over. You are always truly amazing to highlight such important details.👍👍

[@codestorywithMIK]

Means a lot to me. Thank you so much 🙏😇

[@iamnoob7593]

WOW JUST WOW CRAZY GOOD EXPLANATION

[@raisanjeeb42]

Tried the same logic for almost 2 hours...everytime wrong answer on some cases...Then Finally video dekha and got the error ..Thanks for breaking it to easier subproblems.

[@codestorywithMIK]

❤️❤️❤️

[@codestorywithMIK]

I am so glad Sanjeeb that you tried on your own and gave it time. That’s how we learn. Keep it up

[@gui-codes]

you are just fantastic. deserves more subs 1 M

[@shabananoor9423]

Unbelievable explanation

[@boomburstshorts2347]

Whoooaaa!!!! Solid Explanation Brother 🔥

[@codestorywithMIK]

Thank you ❤️😇

[@sauravbiswajit8091]

Ohhhhh bhai ....great explanation 😮

[@codestorywithMIK]

Thanks a lot ❤️🙏😇

[@anmol3749]

Zabardastttt story building!!!!

[@arambh-gaur]

Great explaination !! Keep at it

[@komalkrishna7836]

Wow! Great explanation sir👏 Your explanation is awesome as always, Thank you 😊

[@codestorywithMIK]

Thanks a lot Komal

[@yashaggarwal825]

Excellent Sir!! just a small suggestion i would be beneficial to many students if you make videos on contests of leetcode,codechef and codeforces. Its true that your type of content is hard to make but it will influence more students towards better platforms. thank you so much for the videos

[@codestorywithMIK]

Thanks Yash. I understand your point. A little difficult with so less time but yeah; i will soon be planning to include those you mentioned. Slowly slowly will add more contents

[@zaviyakhurshid9097]

Superb, very well explained 🔥

[@codestorywithMIK]

Thanks a lot

[@JJ-tp2dd]

So so good bhai..mujhe bhulna ni sb millions subscribers honge apke

[@codestorywithMIK]

Thanks 😊 Sure 💕

[@gaurimandot5788]

As always awesome sir😍

[@nagmakhan672]

This is Art 🔥🔥🔥

[@alokgautam02]

Thanks for this awesome solution ..😇

[@vishalplayzz2580]

code of brute force on submitting giving a tle code : class Solution { public: void rotate(vector&a,int n) {int temp=a[0]; for(int i=0;i

[@codestorywithMIK]

Glad you tried brute force. It’s always a good practice to go for brute force

[@rguktiiit371]

Bro make a video on time complexities and how to properly read the constraints mentioned in the question

[@codestorywithMIK]

Sure. Thanks for the suggestion Added to my list

[@HimanshuPatel-wn6en]

@@codestorywithMIK Bhaiyia Please make video on how to read constraints and understand that which tc solution will work

[@aditimahabole1761]

muje aapke charan chune ....aap itnaa achaa kese padhaaa sakteeeeeeee.

[@yashisrivastava6196]

Nyc explanation 💯

[@codestorywithMIK]

Thank you 🙏😇

[@vaibhavgupta2130]

nice explanation...thanks

[@Ramneet04]

Hi! were you able to come up with this approach. As even I tried for so long but what did like running kadens algorithm only but having two pointer approach from front and back but it didn't work. As this was a bit biased problem,not so intuitive.? How to like start this approach, infact that rotate array then find maximum makes more sense!!!!

[@codestorywithMIK]

Hi there, Actually i remember when I had solved this problem first time, I couldn’t come up with the exact same approach. I think it’s fine to not being able to come up with such an amazing approach in one go. But once you get this, you can definitely think similar approaches in other similar problems.

[@Ramneet04]

@@codestorywithMIK 🙃 Btw explanation is top notch no doubt 👉👈

[@Ramneet04]

We can also do if (circular sum==0)return maxsum; Else return max(maxsum,circularsum);

[@ashishrawat8819]

great video

[@thekindspill]

Legend

[@danishsinghjamwal627]

awesome

[@codestorywithMIK]

Thanks a lot ❤️❤️❤️

[@prnvsgr]

respect

[@apuljain6625]

🤯

[@tarifzaman]

You are love

[@AdityaSingh-ui4tr]

In [5,-3,5] this case 5+(-3)+5+5 can also be a subarray

[@codestorywithMIK]

Actually we can’t take any element twice. The 5 of index 0 is taken twice in “5+(-3)+5+5” which is not valid

[@tauquirahmed1879]

Bhaiya topic tags mein Dynamic Programming aur Monotonic Queue q diya h? Usse bhi koi approach ho skta h kya?

[@shanayagupta4002]

haa sir, same question

[@codestorywithMIK]

Yes. However i will cover them in separate play lists

[@tauquirahmed1879]

@@codestorywithMIK ok bhaiya... Pressed the bell bell icon already ♥️

[@codestorywithMIK]

Tysm ❤️❤️❤️

[@shanayagupta4002]

@@codestorywithMIK ohk got it

[@guptashashwat]

Guruji

[@codestorywithMIK]

❤️🙏

[@JJ-tp2dd]

bhai aj ka leetcode ni ayega?

[@codestorywithMIK]

Being uploaded. Taking some time. Stay tuned 😃

[@niteshk0487]

kadanes max int sum = 0; int maxi = INT_MIN; for(int i=0; i

[@tauquirahmed1879]

I guess mini = min(mini, sum) If (sum>0) sum = 0

[@niteshk0487]

@@tauquirahmed1879 bro sum>0 fir to always negative me ayega

[@tauquirahmed1879]

@@niteshk0487 yes you have to find the minimum know... Do it in two loops or take two sums, one to find minimum and one to find maximum. I am not sure it will work or not

[@tauquirahmed1879]

@@niteshk0487 my solution works. // code class Solution { public: int maxSubarraySumCircular(vector& nums) { int max_sum=INT_MIN, min_sum=INT_MAX, total_sum=0, circular_sum; int n = nums.size(); int curr_max_sum = 0, curr_min_sum = 0; for(int i = 0; i

[@chitransh73]

bruteforce class Solution { public: //This code will give TLE int Kadane(vector& nums) { int n=nums.size(); int maxsum=0; int sum=INT_MIN; for(int i=0;i

[@piyushacharya7696]

support++

[@ManinderSingh-xr6ir]

//Brute force, got tle after passing 102/111 test cases😅😅 int kadane(vector &arr,int n){ int maxi = INT_MIN; int sum = 0; for(int i = 0;i

[@codestorywithMIK]

Good that you tried Brute force. Great job

[@codestorywithMIK]

And i liked your rotation part 👍🏻

[@ManinderSingh-xr6ir]

@@codestorywithMIK Thank you sir. Learning a lot from your channel❤

[@husler7424]

Why cant we just return directly "return max(circularMaxSum, maxSum);" instead of ?? if(maxSum > 0) return max(circularMaxSum, maxSum); return maxSum;

[@codestorywithMIK]

If you notice, I shared an example in my explanation : {-1,-1,-1} In cases like these, you will return wrong answer if you only do max(curcular, maxSum) Try to dry run this small case

[@husler7424]

@@codestorywithMIK yes got it. So for handling all negative elements we are doing it right?

[@codestorywithMIK]

Indeed correct

[@husler7424]

@@codestorywithMIK thank you 💜

[@ghayoorhussain8930]

/** * Sir Brute force se TLE araha h but able to 102 testcases out of 111 */ class Solution { private int kadane(int[] arr) { int currSum = 0; int n = arr.length; int maxSum = Integer.MIN_VALUE; for(int i = 0; i < n; i++) { currSum += arr[i]; if (currSum > maxSum) maxSum = currSum; if (currSum < 0) currSum = 0; } return maxSum; } private void rotate(int arr[], int n) { int i, temp; temp = arr[0]; for (i = 0; i < n - 1; i++) arr[i] = arr[i + 1]; arr[i] = temp; } public int maxSubarraySumCircular(int[] nums) { int res = Integer.MIN_VALUE; int n = nums.length; for(int i = 0; i < n; i++) { rotate(nums, n); res = Math.max(res, kadane(nums)); } return res; } }

[@codestorywithMIK]

Yes that’s expected because of the constraints. But i am glad you tried brute force also, it’s a good thing to practice because it helps in interviews

[@alphadrones23]

I think the interviewer may stress optimizing it in a single pass...

[@codestorywithMIK]

Yep you can simply write all in a single pass. Click my code link in the description Both codes are available

[@molyoxide8358]

Bro Kadane's Algo se [5,-3,5] ka maxSum subarray 7 hoga na, 5 kaise??

[@skillup638]

Yeah 7 but his mistake

[@codestorywithMIK]

My bad. That’s a silly. Thanks for pointing

[@molyoxide8358]

@@codestorywithMIK Bro Highlight karne ke point se nhi bola bura math maan na. Mujhe5 minute tak smj nhi aaya tha ki hua kaise. That's it par ab smj gya.

[@codestorywithMIK]

No worries. Thanks for your feedback 😇

[@coderletscode]

Kadan's algo nhi karaye bhai

[@adhikari669]

Bhaya m algorithm kaha s or kaise pdu

[@codestorywithMIK]

I think for Algorithm, you can go through GfG . That’s good But then make sure to solve Qns and apply algorithmic knowledge in them. If you get stuck in problems, feel free to visit my channel for clear explanations

[@adhikari669]

Kon kon s algorithm pdu?

[@codestorywithMIK]

I would suggest first start basic topics like Array (it will have sorting algorithms, binary search etc) Then further advancing, sliding window algo etc. Basically, you need to choose a data structure to start with and then it will have certain different algorithms.

[@adhikari669]

Bhaya I can solve graph,tree problem , this kadanes algorithm that you mentioned without knowing about it I solved finding maximum subarray in result making my own sadanes algorithm,I did some greedy problem also,some divide and conquer.. I wanted to ask that ki is there a structured method of learning just like the dsa or its random just learning algorithms when encountering those questions

[@codestorywithMIK]

Yes there is a structured way. First you should have cleared all algorithms based on Arrays Such as Binary Search Sliding Window Kadanes Algo is also based on Arrays and so on

[@k-CE-OmkarPathak]

awesome