Me postulé en línea. Acudí a una entrevista en Amazon en sept 2022
Entrevista
I gave the written round so far. The exam was on hacker earth with two not so difficult questions.
Both were medium level questions from leet code. One related the priority queue and the other one was basic math based question.
You are also suppose to answer two subjective questions. In that you will have to tell them the approach that you used while solving the question with space and time complexity.
Preguntas de entrevista [1]
Pregunta 1
Amazon | OA | Prime Air time
28.0K
VIEWS
17
Last Edit: February 23, 2022 6:42 AM
Anonymous User
Position: SDE 1
Location: Bengaluru, India.
YoE: 1 year 3 months.
Platform: Hackerrank
Problem:
This problem is a variant of closest pair sum. You'll be given two arrays
arr1 = { {1, 2000}, {2, 3000}, {3, 4000} }
arr2 = { { 1, 5000 }, {2, 3000} }
the first element of every pair represents id and the second value represents the value.
and a target x = 5000
Find the pairs from both the arrays whose vaue add upto a sum which is less than given target and should be closest to the target.
Output for the above example:
{ {1, 2} } // Note that the output should be in id's
It was an AI round, and I was given a Java and Spring boot application with access to AI and asked to do debugging in the repo. There were a lot of different test cases.
Me postulé en línea. Acudí a una entrevista en Amazon (Bengaluru) en may 2026
Entrevista
First there was an online coding round, followed by a DSA round.
However, they had mentioned the DSA round, but the interviewer had asked me a System design question instead.
Preguntas de entrevista [1]
Pregunta 1
Design a real time system that reads twitter feeds and then creates a graph of the customer input hashtags that would allow the client to monitor the usage of those tweets in real time, for marketing, advertisement, political reasons, etc.
Me postulé a través de un reclutador. El proceso tomó 1 día. Acudí a una entrevista en Amazon (Pune) en abr 2026
Entrevista
1. DSA - leetcode medium ( full code is required)
2. DSA - leetcode hard (full code is required)
3. desing - Book My Show LLD ( no code, only design discussion)
4. Stock broker variation HLD