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 Junior Software Developer Interview Questions, Process, and Tips

Updated 24 Oct 2023

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)
View all 9 questions

Amazon Junior Software Developer Interview Experiences

3 interviews found

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

I applied via Company Website and was interviewed before Oct 2022. There were 4 interview rounds.

Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Keep your resume crisp and to the point. A recruiter looks at your resume for an average of 6 seconds, make sure to leave the best impression.
View all tips
Round 2 - Coding Test 

Online Assessment, most of the questions are easy and middle difficulty

Round 3 - Technical 

(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

  • Answered by AI
Round 4 - Technical 

(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

  • Answered by AI

Skills evaluated in this interview

I applied via Naukri.com and was interviewed in Oct 2021. There were 2 interview rounds.

Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Keep your resume crisp and to the point. A recruiter looks at your resume for an average of 6 seconds, make sure to leave the best impression.
View all tips
Round 2 - Group Discussion 

Social media

Interview Preparation Tips

Topics to prepare for Amazon Junior Software Developer interview:
  • C, c++
Interview preparation tips for other job seekers - Good communication skills and technical logical conclusion

Junior Software Developer Interview Questions Asked at Other Companies

asked in Amazon
Q1. Given n coins for two players playing a game. Each player picks c ... read more
asked in Pisolv Tech
Q2. Did You Know what is golang and where did You uses that? Why You ... read more
Q3. int x:4; what does it mean ? a) x is a four digit number. b)x is ... read more
Q4. what is a lint? a) Analyzing tool. b)compiler. c)debugger. d)inte ... read more
asked in Infogain
Q5. What is deadlock .what are the conditions of deadlock?

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

  • Answered by AI
  • 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

  • Answered by AI
  • 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

  • Answered by AI
  • 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.

  • Answered by AI
  • 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.

  • Answered by AI
  • 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

  • Answered by AI
  • 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

  • Answered by AI

Interview Preparation Tips

General Tips: my interview experience with Amazon for internship. Hope it helps.I got internship offer from them.
Skills: Algorithm, data structure
College Name: NA

Skills evaluated in this interview

Interview questions from similar companies

I appeared for an interview before May 2021.

Round 1 - Face to Face 

(1 Question)

Round duration - 60 Minutes
Round difficulty - Easy

  • Q1. 

    Find the k-th Node from the End of a Linked List

    Given the head node of a singly linked list and an integer 'k', this problem requires you to determine the value at the k-th node from the end of the linke...

  • Ans. 

    To find the k-th node from the end of a linked list, iterate through the list to determine the size, then traverse again to reach the k-th node from the end.

    • Iterate through the linked list to determine its size.

    • Calculate the position of the k-th node from the end based on the size of the list.

    • Traverse the list again to reach the k-th node from the end.

    • Return a pointer to the k-th node from the end.

  • Answered by AI
Round 2 - Video Call 

(1 Question)

Round duration - 60 Minutes
Round difficulty - Easy

High level System Design

  • Q1. Can you design a system like Uber, explaining the various components and architecture involved?
  • Ans. 

    Designing a system like Uber involves components like user app, driver app, server, database, and algorithms for matching and routing.

    • User app for booking rides and tracking

    • Driver app for accepting rides and navigation

    • Server for handling requests and communication between apps

    • Database for storing user, driver, and ride information

    • Algorithms for matching riders with drivers and routing

  • Answered by AI
Round 3 - HR 

Round duration - 45 minutes
Round difficulty - Easy

Basic HR questions

Interview Preparation Tips

Professional and academic backgroundI applied for the job as Software Engineer in HyderabadEligibility criteriaAbove 7 CgpaUber interview preparation:Topics to prepare for the interview - Data Structures, React JS, JavaScript, DBMS, AlgorithmsTime required to prepare for the interview - 6 monthsInterview preparation tips for other job seekers

Tip 1 : Practise DSA/coding consistently
Tip 2 : Choose a tech stack and Make side hobby projects
Tip 3 : Give mock interviews for your preparation evaluation

Application resume tips for other job seekers

Tip 1 : Pointers about your current job responsibility
Tip 2 : Side Projects with Tech stack

Final outcome of the interviewSelected

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 for other job seekers - Focus on core concepts and basic programs.

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

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

  • 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

  • Answered by AI
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:
    ...
  • 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
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...

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

  • Answered by AI
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?
  • 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...

  • Answered by AI

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

Interview Preparation Tips

Round: Test
Tips: Just try coding as much as you can in the four years of graduation.

Round: Interview
Experience: Three Coding Interview and a Behavioral Interview were conducted.
Tips: Try to get some prior knowledge about the company's infrastructure.w

General Tips: Practice as much problems as you can online or offline.
Skill Tips: Coding is the key for any software company.
Skills: Coding
College Name: IIT KHARAGPUR
Motivation: Its the best in business

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

  • Answered by AI
  • Q2. Questions on Network programming
  • Q3. Questions on array,heap and binary trees
  • Q4. Round was both HR+Technical

Interview Preparation Tips

Round: Test
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

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

  • Ans. 

    Merge two sorted arrays into one sorted array in place.

    • Use two pointers to compare elements from both arrays and place them in the correct position in ARR1.

    • Start from the end of ARR1 and compare elements from both arrays, placing the larger element at the end of ARR1.

    • Continue this process until all elements from ARR2 are merged into ARR1.

  • Answered by AI
  • 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 ...

  • Ans. 

    Find the smallest distance between two words in a document for multiple queries.

    • Iterate through the document array to find the indices of the two words in each query.

    • Calculate the absolute difference between the indices to get the distance.

    • If a word from the query is not present in the document, return the length of the document array.

    • Repeat the process for each query and output the smallest distance for each.

  • Answered by AI
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...

  • Ans. 

    Find all unique combinations in an array where the sum is equal to a given target sum, with elements in non-decreasing order.

    • Use backtracking to generate all possible combinations.

    • Sort the array to ensure elements are in non-decreasing order.

    • Track the current combination and sum while backtracking.

    • Terminate recursion when the sum equals the target sum.

    • Avoid duplicates by skipping elements that have been used in previou

  • Answered by AI
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...

  • Ans. 

    The problem involves finding the number of distinct ways to climb to the Nth stair by taking one or two steps at a time.

    • Use dynamic programming to solve the problem efficiently.

    • The number of ways to reach the Nth stair is the sum of the number of ways to reach the (N-1)th stair and the (N-2)th stair.

    • Handle base cases for N=0 and N=1 separately.

    • Consider using modulo 10^9+7 to avoid overflow in calculations.

  • Answered by AI
  • 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...
  • Ans. 

    The problem involves finding the optimal strategy to accumulate the maximum amount in a coin game with specific rules.

    • Start by understanding the rules of the game and how players take turns to choose coins.

    • Consider the scenario where both players play optimally to maximize winnings.

    • Iterate through different strategies to determine the best approach for selecting coins.

    • Keep track of the total winnings accumulated by eac...

  • Answered by AI
  • 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...

  • Ans. 

    Generate all possible valid parentheses configurations using N pairs.

    • Use backtracking to generate all possible combinations of parentheses.

    • Keep track of the number of open and close parentheses used.

    • Add '(' if there are remaining open parentheses, and add ')' if there are remaining close parentheses.

    • Base case: when the length of the generated string is 2*N, add it to the result array.

  • 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 - 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 Junior Software Developer interview?
Amazon interview process usually has 3 rounds. The most common rounds in the Amazon interview process are Resume Shortlist, Technical and Group Discussion.
What are the top questions asked in Amazon Junior Software Developer interview?

Some of the top questions asked at the Amazon Junior Software Developer interview -

  1. Given n coins for two players playing a game. Each player picks coins from the ...read more
  2. Recursive code to reverse a linked list(Handle all corner cases: when list has ...read more
  3. Write a function to check whether a binary tree is a sub-tree of another binary...read more

Tell us how to improve this page.

Amazon Junior Software Developer Interview Process

based on 1 interview

Interview experience

5
  
Excellent
View more

Interview Questions from Similar Companies

Reliance Retail Interview Questions
3.9
 • 1.6k Interviews
Flipkart Interview Questions
3.9
 • 1.3k Interviews
Paytm Interview Questions
3.3
 • 752 Interviews
Tata Group Interview Questions
4.2
 • 359 Interviews
BigBasket Interview Questions
3.9
 • 359 Interviews
Myntra Interview Questions
4.0
 • 215 Interviews
Blinkit Interview Questions
3.7
 • 182 Interviews
AmbitionBox Interview Questions
4.9
 • 151 Interviews
Uber Interview Questions
4.2
 • 150 Interviews
JioMart Interview Questions
3.9
 • 94 Interviews
View all
Amazon Junior Software Developer Salary
based on 33 salaries
₹13.6 L/yr - ₹23.4 L/yr
371% more than the average Junior Software Developer Salary in India
View more details

Amazon Junior Software Developer Reviews and Ratings

based on 4 reviews

4.4/5

Rating in categories

5.0

Skill development

4.4

Work-life balance

4.9

Salary

4.4

Job security

3.8

Company culture

5.0

Promotions

4.9

Work satisfaction

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

₹0.6 L/yr - ₹6.8 L/yr

Transaction Risk Investigator
3.1k salaries
unlock blur

₹2.3 L/yr - ₹6.1 L/yr

Associate
2.9k salaries
unlock blur

₹0.8 L/yr - ₹7 L/yr

Senior Associate
2.5k salaries
unlock blur

₹2 L/yr - ₹10.5 L/yr

Program Manager
2.2k salaries
unlock blur

₹9 L/yr - ₹36 L/yr

Explore more salaries
Compare Amazon with

Flipkart

3.9
Compare

TCS

3.7
Compare

Google

4.4
Compare

Netflix

4.3
Compare
Did you find this page helpful?
Yes No
write
Share an Interview