Maximum Circular Subarray Sum | Coding Interview | Arrays

In this article, I will explain the Maximum Circular Subarray Sum problem, which has been asked by Amazon and Microsoft.

The algorithm requires you to find the Maximum Subarray Sum (without the wrapping around part), also known as Kadane’s algorithm. Hence, we will discuss it first, and then we will use the kadane’s algorithm to solve the main problem.

We will discuss the code with an example in detail and its time and space complexity.