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 React Js Frontend Developer Interview Questions and Answers

Updated 20 Aug 2024

Amazon React Js Frontend Developer Interview Experiences

1 interview found

Interview experience
4
Good
Difficulty level
Moderate
Process Duration
2-4 weeks
Result
Not Selected

I appeared for an interview before Aug 2023.

Round 1 - Coding Test 

Not remember now what they had asked.

Round 2 - HR 

(2 Questions)

  • Q1. Tell me about yourself?
  • Ans. 

    I am a passionate React Js Frontend Developer with experience in building user-friendly and responsive web applications.

    • Experienced in developing web applications using React Js

    • Proficient in HTML, CSS, and JavaScript

    • Familiar with state management tools like Redux

    • Strong understanding of responsive design principles

    • Ability to work collaboratively in a team environment

  • Answered by AI
  • Q2. What is your expectation ctc ?
  • Ans. 

    My expectation for CTC is competitive based on my experience and skills.

    • I am looking for a salary that reflects my expertise in React Js development.

    • I expect a compensation package that aligns with industry standards.

    • I am open to negotiation based on the overall benefits offered by the company.

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - It was good experience

Interview questions from similar companies

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

React Js Frontend Developer Interview Questions Asked at Other Companies

asked in Simform
Q1. 1. What is difference between abstract class and interface ?
asked in Simform
Q2. What is the difference between a primary key and a unique key?
asked in Simform
Q3. What is an arrow function in JavaScript?
asked in TCS
Q4. How can we mimic lifecycle methods using useEffect in functional ... read more
asked in Simform
Q5. 5. Why we require interface and what is interface in java ?

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

What people are saying about Amazon

View All
cigerrateaddict
4d
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.

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

Interview Preparation Tips

Skills: SQL, Algorithm, Data structure
College Name: NA

Interview Preparation Tips

Round: Test
Experience: Three questions of increasing difficulty level. The first one was on string manipulation, the second was based on the iterative version of the merge sort algorithm and the last one on dynamic programming.
Total Questions: 3

Round: Other Interview
Experience: Eight students were selected for this stage which consisted of three separate interviews. The first one was on algorithms and programming, the second on system design and the third was HR. In the algorithms and programming interview I was asked two questions. The interviewer asked me to first explain the proposed algorithm and then I was expected to write the code on a white board they had provided. Three weeks after the interviews the selected candidates were informed through the concerned placement coordinator.

General Tips: Don't panic, the interviewers don't expect you to come up with the optimum result directly and they will give you enough time to refine your solution.
Skill Tips: No special preparation is required. Just make sure that you have understood the fundamentals
of Data Structures and Algorithms well.
College Name: NIT SURATHKAL
Are these interview questions helpful?

I appeared for an interview before Mar 2021.

Round 1 - Coding Test 

(3 Questions)

Round duration - 60 minutes
Round difficulty - Medium

This was a 1 hour online coding round on hackerrank platform. 3 DSA questions were given.

  • Q1. 

    Stock Trading Maximum Profit Problem

    Given the stock prices for 'N' days, your goal is to determine the maximum profit that can be achieved. You can buy and sell the stocks any number of times but can onl...

  • Q2. 

    Ninja's Complement Problem Statement

    Every day, Ninja dreams of a number but does not understand its significance. Upon investigation, Ninja discovers that converting this number to binary, taking its com...

  • Ans. 

    Convert a number to binary, take its complement, and convert back to decimal.

    • Convert the given number to binary representation

    • Take the complement of the binary number by swapping '1's and '0's

    • Convert the complement back to decimal representation

    • Return the complement number for each test case

  • Answered by AI
  • Q3. 

    Bit Majority Number Generation

    You are given an array arr consisting of N integers. Construct a number from these integers such that, for each bit position, if the quantity of set bits (1s) is greater tha...

  • Ans. 

    Generate a number based on majority set bits in given integers array.

    • Iterate through each bit position and count set and unset bits

    • Construct the resulting number based on majority set bits at each position

    • Return the final constructed number

  • Answered by AI
Round 2 - Video Call 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Easy

In this round, a DSA question was first asked. Then a lot of discussion regarding the various test cases around this question took place. (e.g, handing of -ve numbers , decimals , overflow etc).
Main concentration was just to get as many as test cases possible and an efficient solution as well.
And Some common question like why you coding in C++?

  • Q1. 

    Sum of Digits Problem Statement

    Given an integer 'N', continue summing its digits until the result is a single-digit number. Your task is to determine the final value of 'N' after applying this operation ...

  • Q2. What are the advantages of Object-Oriented Programming (OOP)?
  • Ans. 

    OOP allows for code reusability, modularity, and easier maintenance.

    • Encapsulation: Bundling data and methods together to protect data from outside interference.

    • Inheritance: Allows for the creation of new classes based on existing classes, promoting code reuse.

    • Polymorphism: Objects can be treated as instances of their parent class, allowing for flexibility and extensibility.

    • Modularity: Breaking down a program into small...

  • Answered by AI
Round 3 - Video Call 

(1 Question)

Round duration - 60 minutes
Round difficulty - Easy

Again one coding question to be done on shared screen

  • Q1. 

    Counting Triangles in Graphs

    Given two graphs – a directed graph DIR_GRAPH and an undirected graph UNDIR_GRAPH – you are tasked with counting the number of triangles in each of the graphs.

    Example:

    In t...

  • Ans. 

    Count the number of triangles in a directed and undirected graph.

    • Parse the input to extract vertices, edges, and edges between vertices.

    • Implement a function to count triangles in both directed and undirected graphs.

    • Return the counts of triangles for each test case.

  • Answered by AI

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 interviewRejected

Skills evaluated in this interview

I appeared for an interview before Mar 2021.

Round 1 - Video Call 

(5 Questions)

Round duration - 60 minutes
Round difficulty - Easy

Technical Interview round with questions based on DSA, UNIX commands , Web Security etc.

  • Q1. 

    Find The Repeating And Missing Number Problem Statement

    You are provided with an array nums which contains the first N positive integers. In this array, one integer appears twice, and one integer is missi...

  • Q2. What is the difference between the 'ps' and 'top' commands?
  • Ans. 

    ps displays a snapshot of current processes, while top provides real-time information and allows for interactive management.

    • ps displays a static list of processes, while top continuously updates the list

    • top allows for interactive management of processes (e.g. killing, renicing), while ps does not

    • ps is useful for a quick snapshot of processes, while top is useful for monitoring real-time system activity

  • Answered by AI
  • Q3. What is cross-site scripting (XSS)?
  • Ans. 

    Cross-site scripting (XSS) is a type of security vulnerability that allows attackers to inject malicious scripts into web pages viewed by other users.

    • XSS occurs when a web application allows users to input unvalidated data that is then displayed on the page without proper encoding.

    • There are three main types of XSS: stored XSS, reflected XSS, and DOM-based XSS.

    • An example of XSS is when a user inputs a script into a sear...

  • Answered by AI
  • Q4. How can you prevent SQL injection?
  • Q5. What is the command to kill all running Java processes?
  • Ans. 

    The command to kill all running Java processes is 'pkill -f java'

    • Use the 'pkill' command followed by the '-f' flag and 'java' keyword to kill all Java processes

    • Be cautious when using this command as it will terminate all running Java processes

    • Make sure to have the necessary permissions to kill processes on the system

  • Answered by AI
Round 2 - Face to Face 

(4 Questions)

Round duration - 60 minutes
Round difficulty - Medium

Questions based on designing. My first project as it was related to Image processing, so he also asked questions related to it.

  • Q1. Design a complete system for a traffic enforcement camera.
  • Q2. How does JSON (JavaScript Object Notation) work?
  • Q3. What software testing frameworks are you familiar with?
  • Ans. 

    I am familiar with testing frameworks such as JUnit, Selenium, and TestNG.

    • JUnit

    • Selenium

    • TestNG

  • Answered by AI
  • Q4. What is the best protocol for storing images?
  • Ans. 

    The best protocol for storing images is JPEG (Joint Photographic Experts Group).

    • JPEG is a widely used format for storing images due to its high compression ratio and good image quality.

    • It supports millions of colors and is compatible with most devices and software.

    • Other options include PNG (Portable Network Graphics) for lossless compression and GIF (Graphics Interchange Format) for animations.

  • Answered by AI
Round 3 - HR 

Round duration - 30 minutes
Round difficulty - Easy

This was a typical HR round with questions related to my final year project and some behavioral problems.

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPALinkedIn interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, UNIX Commands, Javascript, OOPSTime required to prepare for the interview - 6 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 

(3 Questions)

Round duration - 60 minutes
Round difficulty - Medium

Technical round with questions based on DSA. Also, there was a discussion on my BTP project.

  • Q1. 

    Longest Palindromic Subsequence Problem Statement

    Given a string A consisting of lowercase English letters, determine the length of the longest palindromic subsequence within A.

    Explanation:

    • A subsequ...
  • Q2. 

    Binary Tree to Doubly Linked List

    Transform a given Binary Tree into a Doubly Linked List.

    Ensure that the nodes in the Doubly Linked List follow the Inorder Traversal of the Binary Tree.

    Input:

    The fi...
  • Q3. 

    Palindrome Permutation - Problem Statement

    Determine if a permutation of a given string S can form a palindrome.

    Example:

    Input:
    string S = "aab"
    Output:
    "True"
    Explanation:

    The permutation "aba" o...

Round 2 - Face to Face 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Medium

Technical interview round where the interviewer asked me questions based on DSA , algorithms and my project. Large set of questions pertaining to DBMS.

  • Q1. 

    Serialize and Deserialize Binary Tree Problem Statement

    Given a binary tree of integers, your task is to implement serialization and deserialization methods. You can choose any algorithm for serialization...

  • Q2. 

    Shuffle Two Strings

    You are provided with three strings: A, B, and C. Your task is to determine if C is formed by interleaving A and B. A string C is considered an interleaving of A and B if:

    • The lengt...
Round 3 - Face to Face 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Medium

This was a design round where I was grilled on my internship , projects and some new design questions were also asked.
Q1. Design a work flow model of the entire work done in your internship.
Q2. Design a workflow model of any one of the projects you did.

  • Q1. Describe a map-based design for implementing a code that checks for isomorphic words in a file.
  • Ans. 

    Using a map-based design to check for isomorphic words in a file.

    • Create a map where the key is the sorted characters of a word and the value is a list of words with the same sorted characters.

    • Iterate through the file, for each word, sort its characters and check if it exists in the map. If it does, add the word to the list. If not, create a new entry in the map.

    • After processing the file, iterate through the map and out...

  • Answered by AI
  • Q2. 

    Stack with getMin Operation

    Create a stack data structure that supports not only the usual push and pop operations but also getMin(), which retrieves the minimum element, all in O(1) time complexity witho...

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

Amazon Interview FAQs

How many rounds are there in Amazon React Js Frontend Developer interview?
Amazon interview process usually has 2 rounds. The most common rounds in the Amazon interview process are Coding Test and HR.

Tell us how to improve this page.

Overall Interview Experience Rating

4/5

based on 1 interview experience

Difficulty level

Moderate 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 React Js Frontend Developer Salary
based on 10 salaries
₹27.2 L/yr - ₹50.7 L/yr
292% more than the average React Js Frontend Developer Salary in India
View more details

Amazon React Js Frontend Developer Reviews and Ratings

based on 1 review

5.0/5

Rating in categories

3.0

Skill development

5.0

Work-life balance

5.0

Salary

5.0

Job security

3.0

Company culture

4.0

Promotions

4.0

Work satisfaction

Explore 1 Review and Rating
Customer Service Associate
4.3k salaries
unlock blur

₹1.8 L/yr - ₹5 L/yr

Transaction Risk Investigator
3.1k salaries
unlock blur

₹2.9 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.5k salaries
unlock blur

₹25.4 L/yr - ₹44.9 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