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.
Since the constraint is not specified, I will assume the number of digits is ~20. The question asks to divide the number into several parts, so a n-digit number can be divided at at most n-points ( between every two adjacent digits and minus point before first digit ). Hence, use backtrack to iterate through all 2^n possibilities and check for the condition.
- tungnk1993 November 17, 2012Complexity should be O(2^n) and number for index i to index j can be pre-calculated