The same two pointer idea you mentioned is written on GFG (here) and it fails on the above case. Is there a way to do this in O(n) time and O(1) auxiliary space ? Complexity of the solution isO(N*log(N)) For every indexiwe'll try and find the smallest length subarray such th...