Amazon [off-campus]|Programmer Analyst|Hyderabad(India)|September 2021 [Offered]

amazon logo
amazon
Programmer AnalystHyderabad, IndiaOffer
October 13, 20215 reads

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.

Full Experience

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.
  1. 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].
  2. The second question was the classic Two Sum Problem.
After the coding, the interviewer asked me about the most challenging task I'd undertaken in my academics or projects. I also had the opportunity to ask questions.

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:
  1. The first was to check whether a given tree is a Binary Search Tree (BST) or not.
  2. The second was to find the Nth last node of a Linked List.
The interviewer also inquired about how I dived deep into the projects I had completed. I concluded by asking my own questions.

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."
There were also a few conceptual questions related to accuracy, precision, and recall, major concepts in Machine Learning and Deep Learning. Finally, I was given a coding question:
  • Given two Binary Trees, I had to check if one tree is a mirror of another tree or not.
The round concluded with some questions about my final year project and an opportunity for me to ask questions to the interviewer.

Verdict: Offered

Interview Questions (7)

Q1
Next Greater Element Index
Data Structures & AlgorithmsMedium

Given an array arr, for each element, find the index of the next greater element. If no such element exists, return -1. For example, given arr = [72,73,74,70,69,70,75,76,73,72], the output should be [1, 1, 4, 3, 1, 1, 1, -1, -1, -1].

Q2
Two Sum
Data Structures & AlgorithmsEasy

Given an array of integers nums and an integer target, return indices of the two numbers such that they add up to target.

Q3
Validate Binary Search Tree
Data Structures & AlgorithmsMedium

Given the root of a binary tree, determine if it is a valid binary search tree (BST).

Q4
Remove Nth Node From End of List
Data Structures & AlgorithmsMedium

Given the head of a linked list, remove the n-th node from the end of the list and return its head.

Q5
Worked with a customer
Behavioral

Tell me about a time where you worked with a customer.

Q6
Didn't satisfy customer requirements
Behavioral

Tell me about a time where you didn’t satisfy the customer requirements.

Q7
Symmetric Tree
Data Structures & AlgorithmsEasy

Given the root of a binary tree, check whether it is a mirror of itself (i.e., symmetric around its center).

Discussion (0)

Share your thoughts and ask questions

Join the Discussion

Sign in with Google to share your thoughts and ask questions

No comments yet

Be the first to share your thoughts and start the discussion!