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.
Partition problem .It is similar to finding whether we can get sum/2 value using arr.size()/2 elements. This can be solved using recursion or DP. The recursive Function call will be rec(0,arr.size()/2,sum/2);
where arr is the given array ,
sum is total sum of all values in the array.
and memoize is just for avoiding recalculation.
If this function returns true then its possible to partition otherwise not.
- shravanskie January 13, 2014