subarray

DSA: sliding window

Intuition
For a list of size n, you can form a total of (n*(n+1))/2 subarrays. For each new element added to a subarray, we can form exactly n more subarrays.

Implementation

#Brute force find all subarrays
 
array = [1, 2, 3, 4]
for i in range(len(array)):
	for j in range(i+1, len(array)+1)
		unique_subarray = array[i:j]

Visual