Ho presentato la mia candidatura online. La procedura ha richiesto 2 giorni. Ho sostenuto un colloquio presso Amazon Flex (Nuova Delhi) nel mese di giu 2022
Colloquio
it was a good experience overall. I learn so many things and I will implement this in next interview.
Longest Alternating Subsequence: DP[i][0] = LAS ending at index i and last element greater than its previous element; DP[i][1] = LAS ending at index i and last element smaller than previous element.
Domande di colloquio [1]
Domanda 1
Longest Alternating Subsequence: DP[i][0] = LAS ending at index i and last element greater than its previous element; DP[i][1] = LAS ending at index i and last element smaller than previous element.
Ho presentato la mia candidatura online. La procedura ha richiesto 3 settimane. Ho sostenuto un colloquio presso Amazon Flex nel mese di gen 2023
Colloquio
The interview is very hard for freshers especially with lack of skills. I found its too pre flexed . completely motivated. I hope they lower little bit difficulty. Interview is conducted by a senior team.
Ho presentato la mia candidatura tramite l'università. Ho sostenuto un colloquio presso Amazon Flex nel mese di ago 2021
Colloquio
There was an initial competitive coding round. The coding round was moderate and doable. The next step was a technical interview. The interviewer was very friendly and open. This helped me be more calm and focus in the interview. In the interview I had to solve two coding questions and the way of assessing was by evaluating how we approach problems and if we are able to arrive at a good solution. I did not make it past the technical interview but there was a HR round as well
Domande di colloquio [1]
Domanda 1
How do you find the smallest integer not present in an unsorted array.