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 there is a tricky way. Let 5 = 2^x, where x ~= 2.2 (I didn't solve it by computer. We say it is x = 2.2).
- cyubing June 05, 2011Therefore, 2^i*5^j = 2^i * (2^2.2)^j = 2^(i+2.2j). The problem can be reduced: increase i, j to sort the outputs. Then, it will become an "counting problem."
j=0, outputs are 1, 2, 3, 4, 5, 6, 7, 8, 9......
j=1, outputs are 2.2, 3.2, 4.2, 5.2, .....
j=2, outputs are 4.4, 5.4, 6.4, 7.4, .....
.
.
.
Tackling the sorting problem like this will be easier since it has a regular pattern (the incremental is 1 for each of j's).
You are welcome to comment on it. Thank you.