Here is the problem statement- if u can login — https://bytecode.interviewstreet.com/challenges/dashboard/#problem/4f497b0018bad
otherwise — http://pastebin.ca/2121976
Make a cumulative sum array.
Now for every index starting from 0, do binary search for k, k+mod, k + 2*mod, ..., k + 76*mod on range limited by previous max-length found, i.e. if we already have found an array of length L, which sum upto k (after doing mod) , then accordingly we have to modify the binary-search space, because we do not require a shorter-length answer.
Will this approach time-out ? As I can't submit there anymore, I need your help to see whether it is correct approach or not.