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.
explanation:
- anand.shenoy14 April 13, 20141. check if sum=0 and count is odd [one end case of recursion]
2. check if sum<0 or length<0 [recursion lands into out of boundary cases]
3. check if the sum to be found is lesser than last element of array considered as it is sorted if yes ....dont consider last element and recurse.
4. if the sum is greater than the last element, it[last element] can or cannot be a part of the numbers which are involved in the odd sum. so consider once in recursion "or" dont consider