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.
@Rakesh..you r technically correct, but there is one problem..it is not min time complexity..you are actually iterating the loop for n/2 time...that is also not required..suppose there is another number m, m< n/2
- Abhishek Chatterjee September 18, 2013n / (n/2) = 2 and n / m = x (say, since m< n/2), then x > 2 (say 3 or 3.33)
waht I feel is that you dont need to check till n/2, you can check upto m....because if there exists any number m < y < n/2, for which n%y=0 then (n /m) < (n / y) < 2....now if n/y=z, then n is also divisible by z....and while iterating upto m, you have already checked z....thus if n is not divisible by z then it is also not divisible by y....this logic is applicable for other numbers also...but i am not sure what is the minimal limit upto which we must check...