Kadane's Algorithm (Max Subarray)
Finds the contiguous subarray with maximum sum in linear O(n) time using dynamic programming accumulators.
Live loop — open the studio to scrub, add your own array, or race it in Battle Arena.
Asked in interviews at
Reference implementation (Python)
def max_subarray_sum(arr):
max_so_far = curr_max = arr[0]
for i in range(1, len(arr)):
curr_max = max(arr[i], curr_max + arr[i])
max_so_far = max(max_so_far, curr_max)
return max_so_farEmbed this visualization
Drop a live, looping Kadane's Algorithm (Max Subarray) canvas into a blog post or course page.
<iframe src="/embed/kadane" width="100%" height="380" style="border:1px solid #e6e8ec;border-radius:14px" loading="lazy" title="3D algorithm visualization by CodeWithMunnaX"></iframe>Frequently asked
What is the time and space complexity of Kadane's Algorithm (Max Subarray)?
Kadane's Algorithm (Max Subarray) runs in O(n) time and O(1) auxiliary space.
Is the Kadane's Algorithm (Max Subarray) visualizer free?
The core 3D visualizer, Web Audio chimes and step intuition are free. A one-time ₹49 Pro Pass unlocks advanced algorithms, large custom arrays, Battle Arena and reel export.
Which companies ask Kadane's Algorithm (Max Subarray) in interviews?
Kadane's Algorithm (Max Subarray) shows up in interviews at Amazon, Microsoft, LinkedIn, Apple.
How does the 3D visualization of Kadane's Algorithm (Max Subarray) work?
Each array value becomes a 3D pillar whose height maps to its value. Comparisons glow amber, swaps flash red, and settled elements lock green while a floating pointer badge tracks the active index — synchronized line-by-line with the Python code.