vinay
BAN USER
Comments (5)
Reputation 0
CareerCup is the world's biggest and best source for software engineering interview preparation. See all our resources.
is a comprehensive book on getting a job at a top tech company, while focuses on dev interviews and does this for PMs.
CareerCup's interview videos give you a real-life look at technical interviews. In these unscripted videos, watch how other candidates handle tough questions and how the interviewer thinks about their performance.
Most engineers make critical mistakes on their resumes -- we can fix your resume with our custom resume review service. And, we use fellow engineers as our resume reviewers, so you can be sure that we "get" what you're saying.
Our Mock Interviews will be conducted "in character" just like a real interview, and can focus on whatever topics you want. All our interviewers have worked for Microsoft, Google or Amazon, you know you'll get a true-to-life experience.
I think this can be solve in similar way as done by the merge sort.
- vinay January 12, 20121) for each index, call a recursive function, which will check the right & left sum(including itself).
2) maintain a counter of max sub array length ( and their indexes)
3) If the sum is not equal in this recursive function, then call the same function (itself) with the left & right subarrray.
Complexity O(nlogn)
What do u guys think??