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.
Step1: Sort the digits {8,7,6,1,0}
Step2: if least number is not zero , return false
Step3: construct any array with reminders {2,1,0,1,0}
Step4: get the sum of reminders and get the reminder of this sum from 3. (2+1+0+1+0)%3 = 4 %3 = 1
step5: if reminder is zero, format the number from sorted array and print it. If reminder is not zero, move to next step
Step6: Check if the reminder exists in the list.
step7: if YES, remove the least number yielding that reminder. {2,1,0,1,0} -- remove 1 in this case
if NO, start removing the least numbers that yield non-zero reminders, so that the sum of reminders of removed numbers equal to calculated reminder.
Format the number with remaining digits.
Code:
- bharath reddy June 24, 2013