GitHub

# LC00581_Shortest_Unsorted_Continuous_Subarray.py

# Given an integer array nums, you need to find one continuous subarray such that # if you only sort this subarray in non-decreasing order, then the whole array will # be sorted in non-decreasing ...
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)): ...