The longest consistens substring of sum = 4 [on hold]

I have a task to do. I have to find the longest consistent substring of sum = 4 but I don't have any ideas to write it in O(n) or O(nlogn) Help me pls.. I use c++ ;)