int sum=0,ans=0,l=0,r=0; //sum will store curr_sum,l will point to left boundary and r will point ot right boundary,ans will store length of longest segment. Subarray starting with 4: 4 2 1 is a ...

[LC581](https://leetcode.com/problems/shortest-unsorted-continuous-subarray/description/) Given an integer array, you need to find one continuous subarray that if you ...