Upload Button Icon Add office photos
Engaged Employer

i

This company page is being actively managed by Amazon Team. If you also belong to the team, you can get access from here

Amazon Verified Tick

Compare button icon Compare button icon Compare

Filter interviews by

Amazon Front end Developer Interview Questions and Answers

Updated 18 Nov 2024

Amazon Front end Developer Interview Experiences

3 interviews found

Interview experience
5
Excellent
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Coding Test 

Coding a frontend UI from provided image. And creating a fucntional star rating system

Round 2 - Technical 

(2 Questions)

  • Q1. Designing a Component API in React using Typescript.
  • Ans. 

    Designing a Component API in React using Typescript involves defining props, state, and methods for the component.

    • Define the props interface to specify the expected input data for the component

    • Use typescript types to ensure type safety and prevent runtime errors

    • Define the state interface to manage the internal state of the component

    • Implement methods to handle user interactions and component logic

    • Document the component ...

  • Answered by AI
  • Q2. Create a function that can clear all the timer ids at once.
  • Ans. 

    Function to clear all timer ids at once

    • Create an array to store all timer ids

    • Iterate through the array and clear each timer id using clearTimeout() function

  • Answered by AI

Skills evaluated in this interview

Interview experience
5
Excellent
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Technical 

(1 Question)

  • Q1. Given a matrix zeros and ones find minimum distance for each one to a zero.
  • Ans. 

    Given a matrix of zeros and ones, find the minimum distance for each one to a zero.

    • Use breadth-first search (BFS) to find the minimum distance from each one to a zero.

    • Start by initializing a queue with all the zeros in the matrix.

    • While the queue is not empty, dequeue a zero and enqueue its neighboring ones.

    • Keep track of the distance from each one to the nearest zero.

    • Repeat until all ones have been visited.

    • Return the ma...

  • Answered by AI

Skills evaluated in this interview

Front end Developer Interview Questions Asked at Other Companies

Q1. Non-Decreasing Array Problem Statement Given an integer array ARR ... read more
Q2. Find Unique Element in Array You have been provided an integer ar ... read more
asked in JUSPAY
Q3. Dijkstra's Shortest Path Problem Statement You are given an undir ... read more
asked in JUSPAY
Q4. Encode N-ary Tree to Binary Tree Problem Statement You are provid ... read more
Q5. Check If Linked List Is Palindrome Given a singly linked list of ... read more
Interview experience
5
Excellent
Difficulty level
Hard
Process Duration
2-4 weeks
Result
Not Selected

I applied via LinkedIn and was interviewed before Aug 2023. There were 3 interview rounds.

Round 1 - Aptitude Test 

30mins aptitude test

Round 2 - Coding Test 

90 mins coding test for 3 questions

Round 3 - HR 

(2 Questions)

  • Q1. Why are you choosing this role
  • Ans. 

    I am choosing this role because of my passion for creating user-friendly and visually appealing websites.

    • Passion for front end development

    • Enjoy creating user-friendly interfaces

    • Excited about the creative aspect of web design

  • Answered by AI
  • Q2. Why should we write you
  • Ans. 

    I am a dedicated and skilled front end developer with a passion for creating user-friendly interfaces.

    • I have a strong understanding of HTML, CSS, and JavaScript

    • I have experience with responsive design and cross-browser compatibility

    • I am proficient in using front end frameworks like React and Angular

  • Answered by AI

Interview questions from similar companies

Interview experience
5
Excellent
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Not Selected

I applied via LinkedIn and was interviewed in Feb 2024. There was 1 interview round.

Round 1 - Technical 

(2 Questions)

  • Q1. About JS in general
  • Q2. Basic JS concepts

Interview Preparation Tips

Interview preparation tips for other job seekers - Get your JS fundamentals clear

What people are saying about Amazon

View All
cigerrateaddict
1d
works at
Ernst & Young
1,300 Jobs Gone. Because AI Can Now Do It Faster.
Glassdoor and Indeed just laid off 1,300 people yes, the same platforms that help people find jobs are now letting go of their own. Why? cz their parent company is going all-in on AI to “streamline” hiring. Most of these layoffs hit R&D, HR, and sustainability teams in the US. Even glassdoor’s CEO is stepping down. The plan now is to merge glassdoor into Indeed and let AI take over a big chunk of the backend work. Their CEO literally said “AI is changing the world, and we need to move faster and fix what’s broken. Today, about one-third of their code is written by AI. Soon, that could be 50%. And they’re not alone Microsoft, Google, Amazon… all are cutting jobs while letting AI do more of the work. Just last week, Intel cut 4,000 jobs, Microsoft let go of 6,000 CrowdStrike laid off 5% of its staff And all of this, even when profits were up. Scary, isn’t it?
Got a question about Amazon?
Ask anonymously on communities.
Interview experience
4
Good
Difficulty level
Moderate
Process Duration
2-4 weeks
Result
Not Selected

I appeared for an interview in Mar 2025, where I was asked the following questions.

  • Q1. Js Round output based question
  • Q2. React JS Machine coding round
Interview experience
2
Poor
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Not Selected

I applied via Referral and was interviewed in May 2024. There was 1 interview round.

Round 1 - Coding Test 

There was an online coding test on signal consisting of leetcode easy medium and hard

I appeared for an interview before Dec 2020.

Round 1 - Coding Test 

(2 Questions)

Round duration - 90 minutes
Round difficulty - Hard

This was an online coding round where we were supposed to solve 2 questions under 90 minutes . Both the questions in my set were related to Graphs and were quite tricky and heavy to implement.

  • Q1. 

    Path Counting in Directed Graph

    Given a directed graph with a specified number of vertices V and edges E, your task is to calculate the total number of distinct paths from a given source node S to all ot...

  • Q2. 

    Course Schedule II Problem Statement

    You are provided with a number of courses 'N', some of which have prerequisites. There is a matrix named 'PREREQUISITES' of size 'M' x 2. This matrix indicates that fo...

Round 2 - Face to Face 

(2 Questions)

Round duration - 60 Minutes
Round difficulty - Medium

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

  • Q1. 

    Merge Intervals Problem Statement

    You are provided with 'N' intervals, each containing two integers denoting the start time and end time of the interval.

    Your task is to merge all overlapping intervals a...

  • Q2. 

    Longest Route Problem Statement

    Given a 2-dimensional binary matrix called Mat of size N x M that consists solely of 0s and 1s, find the length of the longest path from a specified source cell to a destina...

  • Ans. 

    Find the length of the longest path from a source cell to a destination cell in a binary matrix.

    • Use depth-first search (DFS) to explore all possible paths from source to destination.

    • Keep track of visited cells to avoid revisiting them.

    • Return the length of the longest path found, or -1 if no path exists.

  • Answered by AI
Round 3 - Face to Face 

(2 Questions)

Round duration - 50 Minutes
Round difficulty - Medium

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. 

    Longest Increasing Subsequence Problem Statement

    Given an array of integers with 'N' elements, determine the length of the longest subsequence where each element is greater than the previous element. This...

  • Q2. 

    Search In Rotated Sorted Array Problem Statement

    Given a rotated sorted array ARR of size 'N' and an integer 'K', determine the index at which 'K' is present in the array.

    Note:
    1. If 'K' is not present...
Round 4 - Face to Face 

(2 Questions)

Round duration - 50 Minutes
Round difficulty - Medium

This was also a DSA round with 2 questions of Medium to Hard difficulty . I was expected to follow some clean code and OOPS principles to write the code in this round .

  • Q1. 

    Rank from Stream Problem Statement

    Given an array of integers ARR and an integer K, determine the rank of the element ARR[K].

    Explanation:

    The rank of any element in ARR is defined as the number of elem...

  • Q2. 

    LRU Cache Design Question

    Design a data structure for a Least Recently Used (LRU) cache that supports the following operations:

    1. get(key) - Return the value of the key if it exists in the cache; otherw...

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPAFacebook interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Aptitude, OOPSTime required to prepare for the interview - 4 MonthsInterview preparation tips for other job seekers

Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.

Application resume tips for other job seekers

Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.

Final outcome of the interviewSelected

Skills evaluated in this interview

Are these interview questions helpful?

I appeared for an interview before Dec 2020.

Round 1 - Face to Face 

(2 Questions)

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...

  • 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...

Round 2 - Face to Face 

(2 Questions)

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...

  • 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
  • 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:
    ...
Round 3 - Face to Face 

(2 Questions)

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...

  • 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...

  • 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
Round 4 - Face to Face 

(2 Questions)

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...

  • Answered by AI
  • Q2. How does Facebook implement graph search?
Round 5 - Face to Face 

(2 Questions)

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...

  • Answered by AI
  • Q2. How does Facebook Chat work?

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPAFacebook interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Aptitude, OOPSTime required to prepare for the interview - 5 MonthsInterview preparation tips for other job seekers

Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.

Application resume tips for other job seekers

Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.

Final outcome of the interviewSelected

Skills evaluated in this interview

I appeared for an interview before Mar 2021.

Round 1 - Face to Face 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Easy

In first round they asked me 2 coding questions where he asked me to code as close as possible to the actual one.

  • Q1. 

    Ninja and Sorted Array Merging Problem

    Ninja is tasked with merging two given sorted integer arrays ARR1 and ARR2 of sizes 'M' and 'N', respectively, such that the merged result is a single sorted array w...

  • Q2. 

    Word Distance Calculation

    Given a document represented as an array/list ARR of words with length N, find the smallest distance between two given words for multiple queries. The distance is defined as the ...

Round 2 - Face to Face 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Easy

Then in the second round they asked a little about tree and told me to code 2 codes.

  • Q1. 

    Level Order Traversal Problem Statement

    Given a binary tree of integers, return the level order traversal of the binary tree.

    Input:

    The first line contains an integer 'T', representing the number of te...
  • Ans. 

    The problem requires implementing a function to return the level order traversal of a binary tree.

    • Implement a function that takes the root of the binary tree as input and returns the level order traversal of the tree.

    • Use a queue data structure to perform level order traversal.

    • Process each level of the tree one by one, starting from the root node.

    • Print the node values at each level in the order they appear from left to ...

  • Answered by AI
  • Q2. 

    Combination Sum Problem Statement

    Given an array of distinct positive integers ARR and a non-negative integer 'B', find all unique combinations in the array where the sum is equal to 'B'. Numbers can be c...

Round 3 - HR 

Round duration - 30 minutes
Round difficulty - Easy

HR round with typical behavioral problems.

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPALinkedIn interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Aptitude, OOPSTime required to prepare for the interview - 5 monthsInterview preparation tips for other job seekers

Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.

Application resume tips for other job seekers

Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.

Final outcome of the interviewSelected

Skills evaluated in this interview

I appeared for an interview before Mar 2021.

Round 1 - Coding Test 

(3 Questions)

Round duration - 60 minutes
Round difficulty - Medium

This was a online test round where I was given 3 DSA questions to be solved in 60 minutes.

  • Q1. 

    Count Ways to Reach the N-th Stair Problem Statement

    You are provided with a number of stairs, and initially, you are located at the 0th stair. You need to reach the Nth stair, and you can climb one or tw...

  • Q2. 

    Optimal Strategy for a Coin Game

    You are playing a coin game with your friend Ninjax. There are N coins placed in a straight line.

    Here are the rules of the game:

    1. Each coin has a value associated wit...
  • Q3. 

    Generate All Parentheses Combinations

    Given an integer N, your task is to create all possible valid parentheses configurations that are well-formed using N pairs. A sequence of parentheses is considered w...

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPALinkedIn interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Aptitude, OOPSTime required to prepare for the interview - 4 monthsInterview preparation tips for other job seekers

Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.

Application resume tips for other job seekers

Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.

Final outcome of the interviewRejected

Skills evaluated in this interview

Amazon Interview FAQs

How many rounds are there in Amazon Front end Developer interview?
Amazon interview process usually has 2 rounds. The most common rounds in the Amazon interview process are Technical, Coding Test and Aptitude Test.
What are the top questions asked in Amazon Front end Developer interview?

Some of the top questions asked at the Amazon Front end Developer interview -

  1. Create a function that can clear all the timer ids at on...read more
  2. Given a matrix zeros and ones find minimum distance for each one to a ze...read more
  3. Designing a Component API in React using Typescri...read more

Tell us how to improve this page.

Overall Interview Experience Rating

4.7/5

based on 6 interview experiences

Difficulty level

Hard 100%

Duration

2-4 weeks 100%
View more

Interview Questions from Similar Companies

Uber Interview Questions
4.2
 • 156 Interviews
Expedia Group Interview Questions
3.7
 • 78 Interviews
LinkedIn Interview Questions
4.2
 • 69 Interviews
OLX Interview Questions
3.8
 • 60 Interviews
Facebook Interview Questions
4.3
 • 55 Interviews
Uplers Interview Questions
3.9
 • 43 Interviews
Groupon Interview Questions
3.1
 • 42 Interviews
Fareportal Interview Questions
3.3
 • 32 Interviews
Yahoo Interview Questions
4.6
 • 30 Interviews
Airbnb Interview Questions
3.7
 • 25 Interviews
View all
Amazon Front end Developer Salary
based on 58 salaries
₹10.6 L/yr - ₹19.7 L/yr
125% more than the average Front end Developer Salary in India
View more details

Amazon Front end Developer Reviews and Ratings

based on 11 reviews

3.9/5

Rating in categories

4.0

Skill development

3.4

Work-life balance

3.4

Salary

3.3

Job security

4.1

Company culture

3.2

Promotions

4.2

Work satisfaction

Explore 11 Reviews and Ratings
Customer Service Associate
4k salaries
unlock blur

₹1.8 L/yr - ₹5 L/yr

Transaction Risk Investigator
3.1k salaries
unlock blur

₹2.4 L/yr - ₹6.5 L/yr

Associate
3.1k salaries
unlock blur

₹2 L/yr - ₹5.5 L/yr

Senior Associate
2.6k salaries
unlock blur

₹4 L/yr - ₹9 L/yr

Software Developer
2.4k salaries
unlock blur

₹23.3 L/yr - ₹43.4 L/yr

Explore more salaries
Compare Amazon with

Flipkart

3.9
Compare

TCS

3.6
Compare

Google

4.4
Compare

Netflix

4.0
Compare
write
Share an Interview