Hello guys, I'm looking for some algorithm with complexity O(N) to find the largest continuous sub-array of an array V of size N, with sum equal to S. I know there are algorithms with complexity O(NlogN), but I don't know if it's possible with complexity O(N).

Can someone help me?

I'm learning about "sweep line". Could you send me basic problems involving this topic? I don't know how to identify this idea inside the problems.