Amazon [off-campus]|Programmer Analyst|Hyderabad(India)|September 2021 [Offered]
- Result
- Offer
- Location
- Hyderabad, India
- Posted
- 13 Oct 2021
Summary
I recently interviewed for the Programmer Analyst role at Amazon as a new graduate and successfully received an offer after completing five rounds of technical and behavioral assessments.
How it went
I interviewed off-campus for the Programmer Analyst position at Amazon in Hyderabad. As a new graduate from a Tier 3 institution, I was excited to go through their rigorous interview process.
Round 1: Online Assessment (2 hours)
This round was conducted on HackerEarth and consisted of three programming questions.Round 2: Technical Interview (1 hour)
This round started with my self-introduction, followed by two coding questions.- The first question was a twist on the 'Next Greater Element' problem. Instead of finding the next greater element itself, I had to find the index of the next greater element. If no greater element was present, I had to return -1. An example provided was
arr = [72,73,74,70,69,70,75,76,73,72], with the expected output being[1, 1, 4, 3, 1, 1, 1, -1, -1, -1]. - The second question was the classic Two Sum Problem.
Round 3: Technical Interview (1 hour)
Similar to the previous round, I began with a self-introduction. The interviewer then asked me to explain my projects in depth and elaborated on the Programmer Analyst role. Two more coding questions were presented:- The first was to check whether a given tree is a Binary Search Tree (BST) or not.
- The second was to find the Nth last node of a Linked List.
Round 4: Technical + Behavioral Interview (1 hour)
This round was primarily focused on my projects and situation-based behavioral questions.Round 5 (Final): Technical + Behavioral Interview (1 hour)
This was considered the 'bar raiser' round. The discussion primarily revolved around my internship experience and specific projects I had worked on during that time. I was asked several behavioral questions:- "Tell me about a time where you worked with a customer."
- "Tell me about a time where you didn’t satisfy the customer requirements."
- Given two Binary Trees, I had to check if one tree is a mirror of another tree or not.
Verdict: Offered
Questions asked (7)
- 01
Next Greater Element Index
Data Structures & Algorithms · Medium
Open the problemGiven an array
arr, for each element, find the index of the next greater element. If no such element exists, return -1. For example, givenarr = [72,73,74,70,69,70,75,76,73,72], the output should be[1, 1, 4, 3, 1, 1, 1, -1, -1, -1]. - 02
Two Sum
Data Structures & Algorithms · Easy
Open the problemGiven an array of integers
numsand an integertarget, return indices of the two numbers such that they add up totarget. - 03
Validate Binary Search Tree
Data Structures & Algorithms · Medium
Open the problemGiven the
rootof a binary tree, determine if it is a valid binary search tree (BST). - 04
Remove Nth Node From End of List
Data Structures & Algorithms · Medium
Open the problemGiven the
headof a linked list, remove then-th node from the end of the list and return its head. - 05
Worked with a customer
Behavioral
Tell me about a time where you worked with a customer.
- 06
Didn't satisfy customer requirements
Behavioral
Tell me about a time where you didn’t satisfy the customer requirements.
- 07
Symmetric Tree
Data Structures & Algorithms · Easy
Open the problemGiven the
rootof a binary tree, check whether it is a mirror of itself (i.e., symmetric around its center).