Ho presentato la mia candidatura online. La procedura ha richiesto 2 settimane. Ho sostenuto un colloquio presso Adobe (Bengaluru) nel mese di giu 2023
Colloquio
4 Rounds including 1 managerial & 1 Director round.
1st and 2nd Round - Technical - DSA questions, Tree traversal, Medium level DP, famous balanced parentheses problem,
3 - managerial - Basic design round based on an Elevator system
4 - Director - Behavioural Question, previous exp
Ho presentato la mia candidatura tramite segnalazione di un dipendente. La procedura ha richiesto un giorno. Ho sostenuto un colloquio presso Adobe (Noida) nel mese di ott 2017
Colloquio
First round was Hackerrank round which included aptitude and 2 coding questions . They called me for f2f interviews then .
1st round
Questions based on resume , difference between soa and microservices ,2 coding questions , one was longest unique substring and other was tree question . Given a small amount of memory , you have to represent 1 to 1 billion numbers in it . Question which would be asked is whether the number is present in the memory or not .
2nd round
Design round , design a queuing mechanism , high level as well as low level design .
3rd round
2 puzzles followed by a ds question .I asked the interviewer , if we could use extra space , he said yes , so I stopped thinking about avoiding extra space . Interviewer should have told in this case to avoid extra space . I could have then think other way round .
Did not get through the next rounds .
Domande di colloquio [2]
Domanda 1
. Given a small amount of memory , you have to represent 1 to 1 billion numbers in it . Question which would be asked is whether the number is present in the memory or not .
Ho presentato la mia candidatura tramite l'università. Ho sostenuto un colloquio presso Adobe (Dhanbād) nel mese di ott 2016
Colloquio
First there was apptitue test, then coding round of 2 question. then there was 1-1 inverview round 3, then HR round.
In Interview round they have asked question-related to algorithm and OS . they were also asking puzzle.