J'ai postulé en ligne. J'ai passé un entretien chez Amazon (Bengaluru) en avr. 2015
Entretien
one written and three face to face round. written round have 3 coding problem in hackerrank. written was quite simple. I had solved two problem. Then i have given two face to face round first they said to tell the algorithm if they satisfied then the allowed me to write the complete code.
Questions d'entretien [2]
Question 1
3 coding problem in hackerrank all of them are form basic algorithm.
first was find the number containing max frequency and its frequency.
second was given the max number of swaps create greatest after performing the given number of swaps.
1. give a first matrix and crate another second matrix containing all the shortest path from any given source of first matrix to all index there is also some blockage index.
2.given node having string and its children find rank of any given node parent have 1 rank. there are multiple node and we can add dynamically node.