All Subarrays With Given Sum
Finds all contiguous windows whose sum equals target value.
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 all_subarrays_sum(arr, k):
res = []
for i in range(len(arr)):
s = 0
for j in range(i, len(arr)):
s += arr[j]
if s == k: res.append((i, j))
return resEmbed this visualization
Drop a live, looping All Subarrays With Given Sum canvas into a blog post or course page.
<iframe src="/embed/all-subarrays-with-sum" 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 All Subarrays With Given Sum?
All Subarrays With Given Sum runs in O(n²) time and O(n) auxiliary space.
Is the All Subarrays With Given Sum 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 All Subarrays With Given Sum in interviews?
All Subarrays With Given Sum shows up in interviews at Spotify, Google, Airbnb.
How does the 3D visualization of All Subarrays With Given Sum 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.