Amazon Java Developer Interview Questions and Answers

Round duration - 60 Minutes
Round difficulty - Medium

This was a Data Structures and Algorithms round with preety good questions . I was expected to come up with an efficient approach and code it as well .

Q1. 
K Closest Points to Origin Problem Statement
Your house is located at the origin (0,0) of a 2-D plane. There are N neighbors living at different points on the plane. Your goal is to visit exactly K neighb...read more
Ans. 
Find the K closest points to the origin in a 2-D plane using Euclidean Distance.
• Calculate the Euclidean Distance of each point from the origin

• Sort the points based on their distances

• Return the first K points as the closest neighbors
Answered by AI
Add your answer
Q2. 
Power Set Generation
Given a sorted array of 'N' integers, your task is to generate the power set for this array. Each subset of this power set should be individually sorted.
A power set of a set 'ARR' i...read more
Ans. 
Generate the power set of a sorted array of integers with individually sorted subsets.
• Use recursion to generate all possible subsets by including or excluding each element in the array.

• Sort each subset before adding it to the power set.

• Handle base cases for empty array and single element array.

• Ensure the subsets are unique by using a set data structure.

• Time complexity can be exponential due to the nature of generating ...read more
Answered by AI
Add your answer

Round duration - 50 Minutes
Round difficulty - Hard

This was also a DSA round where I was asked to code only one of the questions but I eventually ended up coding both as I had some spare time and explained my approches very smoothly to the interviewer . This round went preety well .

Q1. 
Roman Numeral to Integer Conversion
Convert a string representing a Roman numeral into its integer equivalent and return the result.
Explanation:
Roman numerals are represented by seven different symbol...read more
Ans. 
Convert a Roman numeral string to its integer equivalent.
• Create a mapping of Roman numeral symbols to their integer values.

• Iterate through the input string and add the corresponding integer values.

• Handle cases where subtraction is needed (e.g., IV = 4, IX = 9).
Answered by AI
Add your answer
Q2. 
Pair Sum Problem Statement
You are given an integer array 'ARR' of size 'N' and an integer 'S'. Your task is to find and return a list of all pairs of elements where each sum of a pair equals 'S'.
Note:
...read more
Ans. 
Find pairs of elements in an array that sum up to a given value, sorted in a specific order.
• Iterate through the array and for each element, check if the complement (S - current element) exists in a hash set.

• If the complement exists, add the pair to the result list.

• Sort the result list based on the criteria mentioned in the question.

• Return the sorted list of pairs.
Answered by AI
Add your answer

Round duration - 50 Minutes
Round difficulty - Medium

This was also a DSA round with 2 questions . One was implementation heavy and the other was related to recursion and so I handled it carefully so that my code does not run into TLE or Segmentation Fault.

Q1. 
Arithmetic Expression Evaluation Problem Statement
You are provided with a string expression consisting of characters '+', '-', '*', '/', '(', ')' and digits '0' to '9', representing an arithmetic express...read more
Ans. 
Evaluate arithmetic expressions in infix notation with given operators and precedence rules.
• Parse the infix expression to postfix using a stack.

• Evaluate the postfix expression using a stack.

• Handle operator precedence and parentheses while evaluating.

• Ensure no division by zero cases and operands fit in 32-bit integer.
Answered by AI
Add your answer
Q2. 
Remove Duplicates from Sorted Array Problem Statement
You are given a sorted integer array ARR of size N. Your task is to remove the duplicates in such a way that each element appears only once. The outpu...read more
Ans. 
Remove duplicates from a sorted array in-place with O(1) extra memory.
• Use two pointers - one for iterating through the array and another for placing unique elements.

• Compare current element with next element to identify duplicates and skip them.

• Update array in-place by moving unique elements to the front.

• Return the length of the array after removal of duplicates.
Answered by AI
Add your answer

Round duration - 50 Minutes
Round difficulty - Medium

This was a typical System Design round where I was asked about the various features of Facebook and what sort of data structures and algorithms are used in implementing them .

Q1. How does Facebook store likes and dislikes?
Ans. 
Facebook stores likes and dislikes using a combination of databases and algorithms.
• Likes and dislikes are stored in databases such as MySQL or Cassandra.

• Algorithms are used to analyze user behavior and recommend content based on likes and dislikes.

• User interactions with posts, pages, and ads are tracked to determine likes and dislikes.

• Likes and dislikes may also be used to personalize the user's feed and target ads mor...read more
Answered by AI
Add your answer
Q2. How does Facebook implement graph search?
Ans. 
Facebook implements graph search using a graph database to efficiently search for connections between users and their interests.
• Facebook uses a graph database to store connections between users, pages, groups, etc.

• The graph search algorithm traverses the graph to find relevant connections based on user queries.

• It takes into account factors like user relationships, interests, and interactions to provide personalized sea...read more
Answered by AI
Add your answer

Round duration - 50 Minutes
Round difficulty - Medium

This was a preety intense round as I was grilled more on my System Design concepts but eventually I was able to asnwers all the questions with some help from the interviewer.

Q1. What is Hadoop and why is it used?
Ans. 
Hadoop is a framework for distributed storage and processing of large data sets.
• Hadoop is used for storing and processing big data across a distributed network of computers.

• It is based on the MapReduce programming model, which allows for parallel processing of data.

• Hadoop consists of HDFS for storage and YARN for resource management.

• It is used for tasks like data warehousing, log processing, recommendation systems, and...read more
Answered by AI
Add your answer
Q2. How does Facebook Chat work?
Ans. 
Facebook Chat works by using a combination of websockets, long polling, and push technology to deliver real-time messaging.
• Facebook Chat uses websockets for real-time communication between the client and server.

• Long polling is used to check for new messages when websockets are not supported.

• Push technology is used to notify users of new messages even when the chat window is not open.

• Messages are stored in a database an...read more
Answered by AI
Add your answer