GitHub

12_Longest Subarray with given Sum K.py

# Method 1:- Brute Force :- TC O(n^3) and SC O(1) # maxLength = 0 # for startIndex in range(len(nums)): # for endIndex in range(startIndex,len(nums)): ...