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

Channel:

codestorywithMIK

Subscribers:

92,300

Published on January 18, 2023 6:50:35 AM ● Video Link: https://www.youtube.com/watch?v=Za8V4wkZKkM

Duration: 30:55

1,385 views

96

This is our 33rd Video on our Array Playlist.
In this video we will try to solve a very very popular and good Qn "Maximum Sum Circular Subarray" (Leetcode-918)
This is a Hard Version of Kadane's Algorithm, but I will make it easy for you. Trust me, watch this video.

We will do live coding after explanation and see if we are able to pass all the test cases.

Problem Name : Maximum Sum Circular Subarray
Company Tags : Microsoft, Amazon
My solutions on Github : https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/Arrays/Maximum%20Sum%20Circular%20Subarray.cpp
Leetcode Link : https://leetcode.com/problems/maximum-sum-circular-subarray/


My GitHub Repo for interview preparation : https://github.com/MAZHARMIK/Interview_DS_Algo
Subscribe to my channel : https://www.youtube.com/channel/UCaw58edcO3ZqMw76Bvs0kGQ


╔═╦╗╔╦╗╔═╦═╦╦╦╦╗╔═╗
║╚╣║║║╚╣╚╣╔╣╔╣║╚╣═╣
╠╗║╚╝║║╠╗║╚╣║║║║║═╣
╚═╩══╩═╩═╩═╩╝╚╩═╩═╝

0:00 - Intro and Understanding Qn
2:10 - What is Kadane's Algorithm
3:21 - Brute Force
7:35 - Optimal Approach
18:30 - steps
20:05 - Revisiting Kadane's Algorithm
22:36 - Final Story
26:56 - Live Coding from Story

#coding #helpajobseeker #easyrecipes #leetcode #leetcodequestionandanswers #leetcodesolution #leetcodedailychallenge #leetcodequestions #leetcodechallenge #hindi #india #hindiexplanation #hindiexplained #easyexplaination #interview #interviewtips
#interviewpreparation #interview_ds_algo #hinglish