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.
Most of the codes given here are joining the two nos. and comparing them and then taking decisions which no wud come first. The logic is fine but we'll have problems in handling big nos. if its a 5-6 digit no. how wud u keep a 12 digit no in int variable ( it cud b bigger than 12 digits also)
- switch2switch October 13, 2012one approach i think is to reverse the nos. nd then sort them acc to the remainder they give wen divided by 10 ( we hav to do it recursively if last digit is same )
after sorting with this rule ... reverse the nos again back.