## Amazon Interview Question for Software Developers

Country: India
Interview Type: In-Person

Comment hidden because of low score. Click to expand.
0
of 0 vote

``````board: 99 is home
99 98 ...  90
80 ...     89

20         29
10         19
0          9

pair[] feature; // goes up or down
pair {
p1;
p2;
}
int players [N] = 0 // starting
int winner = recursion(players, features, jumps);
int minjump = min(jumps[winner]);

// recurion
int recursion(int[] players, pair[] feature, int []jump){
for(int i=0; i< players.length; i++){
if (players[i] == 99) return i;
}
for( int i=0; i<players.length; i++){
int kv = 1 + Math.random()*6;
players[k] = players[k] + kv;
if(feature[ind] == players[k]){
}
jump[i] += 1;
}
return recursion (players, feature, jump);
}``````

Comment hidden because of low score. Click to expand.
0
of 0 vote

pair[] feature; // goes up or down
pair {
p1;
p2;
}
int players [N] = 0 // starting
int winner = recursion(players, features, jumps);
int minjump = min(jumps[winner]);

// recurion
int recursion(int[] players, pair[] feature, int []jump){
for(int i=0; i< players.length; i++){
if (players[i] == 99) return i;
}
for( int i=0; i<players.length; i++){
int kv = 1 + Math.random()*6;
players[k] = players[k] + kv;
if(feature[ind] == players[k]){
}
jump[i] += 1;
}
return recursion (players, feature, jump);
}

Name:

Writing Code? Surround your code with {{{ and }}} to preserve whitespace.

### Books

is a comprehensive book on getting a job at a top tech company, while focuses on dev interviews and does this for PMs.

### Videos

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.