Ho presentato la mia candidatura tramite l'università. La procedura ha richiesto 3 giorni. Ho sostenuto un colloquio presso Amazon (Hyderabad) nel mese di ago 2012
Colloquio
First round was a online test held by careercup at the campus. Quetions were typically same as being posted on the sites.
After then there were 4 face to face interview rounds.
Interview rounds are purely Technical. Concern is shown for proper coding.
first interview round : 2 question were asked one from trees and other from semaphore and hash tables combined.
second interview round : this round deals with real life programming.1 program related to graph was asked. 5-6 theortical questions related to networking, computer architecture was asked
third round : 1 programming question related to binary tree was asked.
5-6 theorical question related to DBMS, C , object oriented design.
fourth round: technical and Hr mix. 3 programming question related to stacks, backtracking and nary trees.
Domande di colloquio [2]
Domanda 1
given a binary search tree with root node r. now a specific node n is changed to root. write a function so that the after modification tree remains binary search tree.
create a data structure for node of a nary tree other than child-sibling node. now a nary tree is given with cb node. convert it into a tree with the nodes defined by you. inorder traverse the tree.
Ho presentato la mia candidatura tramite l'università. Ho sostenuto un colloquio presso Amazon (Dublino, Dublino)
Colloquio
Online techincal assessment. Had to screen share and complete basic coding tasks similar to Leet Code. Could choose a language of your choice. Overall a very fair system and judged based on merit.
Domande di colloquio [1]
Domanda 1
Technical assessment so a basic leet code style question about reversing the orders of long numerical strings.
Loop — 4 rounds, all on the same day
Round 1 — Coding (DSA)
Interviewer was a senior SDE, very friendly.
Warm-up + behavioral: "Tell me about a time you took ownership of something outside your responsibilities."
Main question: Given a list of meeting intervals, find the minimum number of conference rooms required. I used a heap. He then asked a follow-up: what if meetings could be reassigned to minimize total idle time? We discussed approaches but didn't fully code it.
He cared a lot about how I talked through edge cases out loud.
Round 2 — Coding + Problem Solving
LP question: "Describe a situation where you disagreed with a teammate."
Coding: LRU Cache implementation from scratch. I used a hashmap + doubly linked list. He pushed on thread-safety and what happens at capacity 0.
Round 3 — Behavioral (Bar Raiser)
This was the toughest round — no coding, all Leadership Principles, very deep STAR-format probing.
Questions I got:
"Tell me about a time you failed and what you learned."
"A time you had to deliver something with a tight deadline and limited information."
The bar raiser kept drilling: "What was your specific contribution?" "What would you do differently?" "What data did you use?" Have 6–8 strong stories ready with metrics.
Round 4 — Low-Level Design
Design: Design a parking lot system (classes, vehicle types, spot allocation, pricing). Then he asked me to code the findSpot() and releaseSpot() methods.
Domande di colloquio [1]
Domanda 1
Most coding questions were LeetCode Medium. Common themes: graphs, heaps, sliding window, hashmaps, and LRU/design., system design,
Great interview process with three rounds, including a technical assessment and a technical interview. The interviewers were professional and supportive throughout the process. The questions mainly focused on DSA, problem-solving, and core technical concepts. The discussions were engaging and provided a good opportunity to demonstrate technical skills. Overall, the process was well-structured, smooth, transparent, and a very positive experience.
