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.
Hi Gus,
- parikshitsinghtomar1857 April 06, 2016My solution passes test cases but marks was very less. Can anyone point out problems in below code
public static int totalPass(int input1,int input2,int input3) {
int N = input1;
int M = input2;
int L = input3;
int max = 0;
int index = 0;
int totalPasses = 0;
int[] arr = new int[N];
while (max != M) {
int currentPass = arr[index];
currentPass= currentPass+1;
arr[index] =currentPass;
max = Math.max(max, currentPass);
if (max == M) {
break;
}
totalPasses++;
if (currentPass % 2 == 0) {
for (int i = 1; i <= L+1; i++) {
index--;
if (index == -1) {
index = N - 1;
}
}
} else {
for (int i = 1; i <= L+1; i++) {
index++;
if (index == N) {
index = 0;
}
}
}
}
return totalPasses;
}