AmbitionBox
Interview Questions
- Reviews
- Salaries
- Interview Questions
- About Company
- Benefits
- Jobs
- Office Photos
- Community
Add office photos
i
Amazon
Compare
Proud winner of ABECA 2024 - AmbitionBox Employee Choice Awards
Filter interviews by
Amazon Junior Software Developer Interview Questions, Process, and Tips
Top Amazon Junior Software Developer Interview Questions and Answers
- Q1. Given n coins for two players playing a game. Each player picks coins from the given n coins in such a way that he can pick 1 to 5 coins in one turn and the game continue ...read more
- Q2. Recursive code to reverse a linked list(Handle all corner cases: when list has no nodes or contains a single node)
- Q3. Write a function to check whether a binary tree is a sub-tree of another binary tree (Check for all corner cases)
Amazon Junior Software Developer Interview Experiences
3 interviews found
Anonymous
Selected
I applied via Company Website and was interviewed before Oct 2022. There were 4 interview rounds.
Online Assessment, most of the questions are easy and middle difficulty
(1 Question)
- Q1. Stack for water
- Ans.
A stack for water is a data structure that follows the Last In First Out (LIFO) principle, where elements are added and removed from the top of the stack.
Stack for water can be implemented using an array or a linked list.
When water is poured into a stack, it fills from the top and the last poured water is the first to be removed.
Example: If we pour water into a stack in the order 1, 2, 3, the stack will look like [3, 2
(1 Question)
- Q1. How to build a chess game
- Ans.
To build a chess game, you need to create a board, implement the rules of chess, and allow players to make moves.
Create an 8x8 grid to represent the chess board
Assign pieces to their starting positions on the board
Implement the rules of movement for each type of chess piece (e.g. pawn, rook, bishop)
Allow players to make legal moves and update the board accordingly
Check for checkmate and end the game when one player's k
Skills evaluated in this interview
I applied via Naukri.com and was interviewed in Oct 2021. There were 2 interview rounds.
Social media
Interview Preparation Tips
- C, c++
Interview Questionnaire
7 Questions
- Q1. Given a string. Write a program to form a string with first character of all words
- Ans.
Program to form a string with first character of all words in a given string.
Split the string into an array of words
Iterate through the array and extract the first character of each word
Join the extracted characters to form the final string
- Q2. Given a number n, find the number just greater than n using same digits as that of n
- Ans.
Given a number n, find the number just greater than n using same digits as that of n
Convert the number to a string and sort the digits in ascending order
Starting from the rightmost digit, find the first digit that is smaller than the digit to its right
Swap this digit with the smallest digit to its right that is greater than it
Sort the digits to the right of the swapped digit in ascending order
Concatenate the digits to
- Q3. Given two numbers represented by two linked lists, write a function that returns sum list. The sum list is linked list representation of addition of two input numbers
- Ans.
Function to add two numbers represented by linked lists and return the sum list.
Traverse both linked lists and add corresponding nodes, keeping track of carry
Create a new linked list to store the sum
Handle cases where linked lists are of different lengths
Handle cases where the sum has an extra digit due to carry
Return the sum linked list
- Q4. Given n coins for two players playing a game. Each player picks coins from the given n coins in such a way that he can pick 1 to 5 coins in one turn and the game continues for both the players. The player ...
- Ans.
The player who picks the last coin loses the game.
The game starts with n coins.
Each player can pick 1 to 5 coins in one turn.
The player who picks the last coin loses the game.
Determine if the given n coins will result in a win or loss for the starting player.
- Q5. Given a sorted array of 0’s and 1’s. Find out the no. of 0’s in it. Write recursive, iterative versions of the code and check for all test cases
- Ans.
Count the number of 0's in a sorted array of 0's and 1's.
Iterative solution: Traverse the array and count the number of 0's.
Recursive solution: Divide the array into two halves and recursively count the number of 0's in each half.
Binary search can also be used to find the first occurrence of 0 and then count the number of 0's after that index.
- Q6. Recursive code to reverse a linked list(Handle all corner cases: when list has no nodes or contains a single node)
- Ans.
Reverse a linked list using recursion, handling all corner cases
Create a recursive function that takes the head of the linked list as input
Base case: if the head is null or the list contains only one node, return the head
Recursively call the function with the next node as input and set its next pointer to the current node
Set the current node's next pointer to null and return the new head
- Q7. Write a function to check whether a binary tree is a sub-tree of another binary tree (Check for all corner cases)
- Ans.
Write a function to check whether a binary tree is a sub-tree of another binary tree (Check for all corner cases)
Create a function that traverses both trees and compares them
Check if the root of the second tree matches any node in the first tree
Handle cases where one or both trees are empty
Handle cases where the trees have different structures
Interview Preparation Tips
Skills: Algorithm, data structure
College Name: NA
Skills evaluated in this interview
What people are saying about Amazon
Interview questions from similar companies
I appeared for an interview before Dec 2020.
(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
Vand edgesE, your task is to calculate the total number of distinct paths from a given source nodeSto all ot... - Ans.
Calculate the total number of distinct paths from a given source node to all other nodes in a directed graph.
Use dynamic programming to keep track of the number of paths from the source node to each node in the graph.
Consider using modular arithmetic to handle large numbers and prevent overflow.
Start by initializing the number of paths from the source node to itself as 1.
Iterate through the edges of the graph and updat...
- 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...
- Ans.
Given courses with prerequisites, determine a valid order to complete all courses.
Use topological sorting to find a valid order of courses.
Create a graph with courses as nodes and prerequisites as edges.
Start with courses that have no prerequisites and remove them from the graph.
Continue this process until all courses are taken or there are no valid courses left.
If there is a cycle in the graph, it is impossible to com
(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...
- Ans.
Merge overlapping intervals and return sorted list of merged intervals.
Sort the intervals based on start times.
Iterate through intervals and merge overlapping intervals.
Return the merged intervals in sorted order.
- Q2.
Longest Route Problem Statement
Given a 2-dimensional binary matrix called
Matof 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.
(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...
- Ans.
Find the length of the longest strictly increasing subsequence in an array of integers.
Use dynamic programming to solve this problem efficiently.
Initialize an array to store the length of the longest increasing subsequence ending at each index.
Iterate through the array and update the length of the longest increasing subsequence for each element.
Return the maximum value in the array as the result.
- Q2.
Search In Rotated Sorted Array Problem Statement
Given a rotated sorted array
ARRof size 'N' and an integer 'K', determine the index at which 'K' is present in the array.Note:
1. If 'K' is not present... - Ans.
Given a rotated sorted array, find the index of a given integer 'K'.
Use binary search to find the pivot point where the array is rotated.
Then perform binary search on the appropriate half of the array to find 'K'.
Handle cases where 'K' is not present in the array by returning -1.
(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
ARRand an integerK, determine the rank of the elementARR[K].Explanation:
The rank of any element in
ARRis defined as the number of elem... - Ans.
Given an array and an index, find the number of elements smaller than the element at that index appearing before it in the array.
Iterate through the array up to index K and count the number of elements smaller than ARR[K].
Return the count as the rank of ARR[K].
Handle edge cases like empty array or invalid index K.
- 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... - Ans.
Design a Least Recently Used (LRU) cache data structure that supports get and put operations with capacity constraint.
Implement a doubly linked list to maintain the order of recently used keys.
Use a hashmap to store key-value pairs for quick access.
Update the order of keys in the linked list on get and put operations.
Evict the least recently used key when the cache reaches its capacity.
Interview Preparation Tips
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.
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.
Skills evaluated in this interview
I applied via Naukri.com and was interviewed before Nov 2020. There were 3 interview rounds.
Interview Questionnaire
1 Question
- Q1. Basic Questions about core concept.
Interview Preparation Tips
Interview Preparation Tips
Experience: The written test did NOT involve general aptitude questions. Most questions were CS specific and pertained to some kind of algorithmic analysis, design of recursive solutions, designing and tracing out an algorithm on a given sample etc. About 50-60% of the candidates were eliminated in this round.
Round: Test
Experience: The next round was a coding assignment. For those familiar with code-chef, the coding assignment was similar to a medium level problem (in the practice section) and had to be done in C. The codingassignment by design, required algorithmic optimization to execute within the prescribed time limit. About 10 candidates (8 UG and 2 PG) were selected for interviews. Yahoo generally conducts 4 technical interviews and an HR interview. Typically, 2 of the 4 tech interviews will be with immediate seniors in teams that are interested in your profile. The remaining two will be with more senior engineers (in fact, one of my interviews was with the tech director of a vertical at Yahoo). Interviewers discuss with each other after each interview, and some candidates were eliminated after one poor interview. It is therefore quite important to do
General Tips: Apart from technical skills, your communication and social skills are what can make or break an interview and eventually, decide whether or not you get the job. Objectively speaking, most candidates who make it to the final round will be very technically proficient. Therefore, your aim should be to make the decision regarding your candidature anything BUT objective. The real advantage of an interview is to let the interviewer know YOU, beyond just your written test score or your academic credentials. Interviewers like confidence in a candidate and it can even make you seem better than you really are. It will also help to have a few well thought out questions in mind for your interviewer, to show him that you have put in more effort than other candidates to find out about the kind of work going on at the company. One thing youcan do is to find out who all the interviewers are during the pre-placement talk (Yes, attending the PPT CAN BE USEFUL). General Tips Preparation Look up their LinkedIn profiles and note what projects they have worked on or guided. Asking a few insightful questions about those specific projects is a good way to create a good impression of you. It is very difficult to truly judge a candidate during a 45 minute interview, so what matters a lot is the impression left in the interviewers mind about you. If possible, try to establish a social connect during your limited interaction with the interviewers, BEFORE the interviews take place. For example, one of my interviewers, a senior tech manager at Yahoo, was an NITK alumnus. Before the interviews, I spoke to him about his experience in college. As it turns out, he was one of the founders of the web club at NITK, of which I am a member. We spoke for about 15 minutes about how the club has grown and how the club has helped its members ever since.
Skill Tips: For a computer science student who intends to take up a technical job at a tier 1 company, spend as much time as possible, honing your technical skills. Start well before placement season, if possible, in 3rd year itself
College Name: NIT SURATHKAL
Interview Preparation Tips
Experience: You need to submit your CV and they shortlist you on this basis.Fast and accurate coding.
Tips: Clearly specify any technical achievement.
Round: Coding
Experience: You are given 4 hours to solve a few algorithmic questions.Start practicing for this from sometime earlier.
Tips: There are puzzles available on the Facebook page.
Round: Technical Interview
Experience: Three interviews. All almost exclusively technical with 1-2 HR questions.
The questions are mainly algorithmic in nature and you need to code online while talking to them.
Tips: Be as accurate and clean with your code as possible.
General Tips: Be creative while answering the questions. They might ask you questions like 'What changes would you want to make to Facebook?'.
Prepare algorithmic questions for the interviews. Most companies like Facebook, Google, Microsoft and others focus on this.
Technical projects or internships will be beneficial.
Qualifying for or winning programming contests like overnite is very beneficial. Involvement in Social/Cultural activities or sports is not really essential.
Skill Tips: Being good at writing fast and correct code in any language helps a lot.
Skills: Programming
College Name: IIT KHARAGPUR
Interview Questionnaire
8 Questions
- Q1. Given two “ids” and a function getFriends(id) to get the list of friends of that person id, write a function that returns the list of mutual friends
- Ans.
Function to return mutual friends given two ids and getFriends(id) function
Call getFriends(id) for both ids to get their respective friend lists
Iterate through both lists and compare to find mutual friends
Return the list of mutual friends
- Q2. Given an “id” and a function getFriends(id) to get the list of friends of that person id, write a function that returns the list of “friends of friends” in the order of decreasing number of mutual friends,...
- Ans.
Function to return list of friends of friends in decreasing order of mutual friends
Use a set to store all friends of friends
Iterate through the list of friends of the given id
For each friend, iterate through their list of friends and count mutual friends
Sort the set of friends of friends by decreasing number of mutual friends
- Q3. Given a number of time slots – start time and end time,“a b”, find any specific time with the maximum number of overlapping. After solving the problem I had to prove my solution
- Ans.
Given time slots, find a specific time with maximum overlap. Prove solution.
Create a list of all start and end times
Sort the list in ascending order
Iterate through the list and keep track of the number of overlaps at each time
Return the time with the maximum number of overlaps
Prove solution by testing with different input sizes and edge cases
- Q4. Given an array of Integers, find the Longest sub-array whose elements are in Increasing Order
- Ans.
Find the longest sub-array with increasing order of integers.
Iterate through the array and keep track of the current sub-array's start and end indices.
Update the start index whenever the current element is smaller than the previous element.
Update the end index whenever the current element is greater than or equal to the next element.
Calculate the length of the sub-array and compare it with the longest sub-array found s
- Q5. Given an array of Integers, find the length of Longest Increasing Subsequence and print the sequence.
- Ans.
Find the length of longest increasing subsequence and print the sequence from an array of integers.
Use dynamic programming to solve the problem
Create an array to store the length of longest increasing subsequence ending at each index
Traverse the array and update the length of longest increasing subsequence for each index
Print the sequence by backtracking from the index with the maximum length
Time complexity: O(n^2)
Exam...
- Q6. Given a Sorted Array which has been rotated, write the code to find a given Integer
- Ans.
Code to find a given integer in a rotated sorted array.
Use binary search to find the pivot point where the array is rotated.
Divide the array into two subarrays and perform binary search on the appropriate subarray.
Handle edge cases such as the target integer not being present in the array.
- Q7. You have a number of incoming Integers, all of which cannot be stored into memory. We need to print largest K numbers at the end of input
- Ans.
Use a min-heap to keep track of the largest K numbers seen so far.
Create a min-heap of size K.
For each incoming integer, add it to the heap if it's larger than the smallest element in the heap.
If the heap size exceeds K, remove the smallest element.
At the end, the heap will contain the largest K numbers in the input.
- Q8. Implement LRU Cache
- Ans.
LRU Cache is a data structure that stores the most recently used items and discards the least recently used items.
Use a doubly linked list to keep track of the order of items in the cache
Use a hash map to store the key-value pairs for fast access
When an item is accessed, move it to the front of the linked list
When the cache is full, remove the least recently used item from the back of the linked list and the hash map
Interview Preparation Tips
Experience: Facebook visited our campus in July, 2012. We had an online coding round hosted on InterviewStreet. We were asked to solve just one problem. The given problem boils down to : Given a undirected graph, source and destination, write the code to find the total number of distinct nodes visited, considering all possible paths.
Tips: Those shortlisted had to fly to Delhi for a Personal Interview. There were four rounds of interview, each of 45 minutes. The questions were simple. But just solving the given problem wasn't enough.
There was much more interaction and short questions asked related to the problem
Round: Technical Interview
Experience: The above mentioned questions wer asked in the interview. For every solution I was asked to write the code on paper. The code should also include the implementation of the data structures used (I used heaps - so I was asked to implement heaps ). They are looking for someone with good problem solving skills and conceptually sound in data structures
College Name: BIT MESRA
Skills evaluated in this interview
Interview Questionnaire
4 Questions
- Q1. You are given a large array of n bits. Each bit is initially 0. You perform several operations of the type
- Ans.
Solution to performing operations on a large array of bits.
Use bitwise operators to perform operations on individual bits
Use a loop to iterate through the array and perform the operations
Ensure that the array is large enough to accommodate all the bits
Consider using a data structure like a bitset for efficient bit manipulation
- Q2. Questions on Network programming
- Q3. Questions on array,heap and binary trees
- Q4. Round was both HR+Technical
Interview Preparation Tips
Experience: Questions can be found here:
-----/
Tips: Try to solve all 3.
Duration: 60 minutes
Total Questions: 3
Round: Technical Interview
Experience: First discuss the solution and then paper-code it.
Tips: Try to code without mistakes.
Round: Technical Interview
Experience: First, I was asked to discuss my project based on networking and then I was given a question on network programming
Tips: Pay attention on discussion
Round: Technical Interview
Experience: Provide the optimised solution and code it without any mistakes.
Round: HR Interview
Experience: Why linkedin?
What changes will you make in 6 months?
Internship project: Discussion and lot of common questions on that.
Basic Questions of C++ and Java
Skills: Data Structure, Core courses understanding, Algorithms
College Name: IIT GUWHATI
Skills evaluated in this interview
Interview Preparation Tips
College Name: NA
Amazon Interview FAQs
Some of the top questions asked at the Amazon Junior Software Developer interview -
Tell us how to improve this page.
Amazon Interviews By Designations
- Amazon Software Developer Interview Questions
- Amazon Customer Service Associate Interview Questions
- Amazon Customer Service Executive Interview Questions
- Amazon Transaction Risk Investigator Interview Questions
- Amazon Software Developer Intern Interview Questions
- Amazon Associate Interview Questions
- Amazon Seller Support Associate Interview Questions
- Amazon Software Engineer Interview Questions
- Show more
Interview Questions for Popular Designations
- Junior Software Engineer Interview Questions
- Junior Engineer Interview Questions
- Junior Developer Interview Questions
- Junior Web Developer Interview Questions
- Software Engineer Interview Questions
- Junior Business Analyst Interview Questions
- Junior Executive Interview Questions
- Junior PHP Developer Interview Questions
- Show more
Amazon Junior Software Developer Interview Process
based on 1 interview
Interview experience
Interview Questions from Similar Companies
Fast track your campus placements
Amazon Junior Software Developer Reviews and Ratings
based on 4 reviews
Rating in categories
|
Customer Service Associate
4.2k
salaries
|  ₹0.6 L/yr - ₹6.8 L/yr |
|
Transaction Risk Investigator
3.1k
salaries
| ₹2 L/yr - ₹6.1 L/yr |
|
Associate
2.9k
salaries
| ₹0.8 L/yr - ₹7 L/yr |
|
Senior Associate
2.5k
salaries
| ₹2 L/yr - ₹10.5 L/yr |
|
Program Manager
2.2k
salaries
| ₹9 L/yr - ₹37 L/yr |
Flipkart
TCS
Netflix
- Home >
- Interviews >
- Amazon Interview Questions >
- Amazon Junior Software Developer Interview Questions
