Subarray With Given Sum
Sliding window expands and shrinks boundaries to match target sum.
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 subarray_sum(arr, target):
curr = arr[0]; start = 0
for i in range(1, len(arr) + 1):
while curr > target and start < i - 1:
curr -= arr[start]
start += 1
if curr == target:
return start, i - 1
if i < len(arr):
curr += arr[i]
return -1Embed this visualization
Drop a live, looping Subarray With Given Sum canvas into a blog post or course page.
<iframe src="/embed/subarray-with-given-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 Subarray With Given Sum?
Subarray With Given Sum runs in O(n) time and O(1) auxiliary space.
Is the Subarray 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 Subarray With Given Sum in interviews?
Subarray With Given Sum shows up in interviews at Oracle, Cisco, PayPal.
How does the 3D visualization of Subarray 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.