Envié una solicitud electrónica. Acudí a una entrevista en Amazon en ene 2019
Entrevista
Given an underected connected graph with n nodes labeled 1..n. A bridge (cut edge) is defined as an edge which, when removed, makes the graph disconnected (or more precisely, increases the number of connected components in the graph). Equivalently, an edge is a bridge if and only if it is not contained in any cycle. The task is to find all bridges in the given graph. Output an empty list if there are no bridges.
Acudí a una entrevista en Amazon (South San Jose Hills, CA)
Entrevista
Gave OA and after 2 months got scheduled. Onsite was 1 LLD - file search system + 20 min LP, 1 dsa round, 1 LP. After loop I got mail that I passed but got waitlisted.
Envié una solicitud electrónica. Acudí a una entrevista en Amazon (Seattle, WA) en feb 2025
Entrevista
Standard amazon sde process. first round is OA + work simulation, 2nd round is a 3-round zoom interviews. several Behavioral questions and follow ups + coding questions(similar to the leetcode question) + object oriented design questions. And then the second round is the final round, result will be available within 5 business days.
Preguntas de entrevista [1]
Pregunta 1
A OOD design question: design a pizza shop in any language.
Envié una solicitud electrónica. Acudí a una entrevista en Amazon (Dublín, Dublín) en nov 2024
Entrevista
4 steps:
1 OA (quite hard)
2 coding skill of 30mins where we just did some basic stuff.
3 three meetings:
-3.1 quite simple was about technical stuff like linked list
-3.2 all about stories (quite hard)
-3.3 was a mix but was quite a mess