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.
Get all sub-sets of the questions set [which can be can have as many as (2^sizeOfSet)-1 elements].
int maxNumOfSubsets = (2^set.size())-1
Getting all sub-sets can be done by using the binary representation of all integers between 1 and maxNumOfSubsets.
The simply sum each sub-set, if the sum is zero then you have an answer.
- Justin February 15, 2015