Amazon Interview Question
Software DevelopersCountry: India
Interview Type: In-Person
pair[] feature; // goes up or down
pair {
p1;
p2;
type; // ladder or snake
}
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]){
if(feature[ind].type == ladder) players[k] = ladder.p1;
else players[k] = ladder.p2;
}
jump[i] += 1;
}
return recursion (players, feature, jump);
}
- kp June 17, 2020