Upload Button Icon Add office photos

Filter interviews by

Amazon Development Centre India Software Developer Intern Interview Questions and Answers

Updated 27 Oct 2024

Amazon Development Centre India Software Developer Intern Interview Experiences

4 interviews found

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

2 DSA questions were asked in OA.

Round 2 - HR 

(1 Question)

  • Q1. Basic HR Questions
Interview experience
5
Excellent
Difficulty level
Moderate
Process Duration
2-4 weeks
Result
Selected Selected

I applied via Campus Placement and was interviewed before Oct 2023. There were 2 interview rounds.

Round 1 - Coding Test 

2 questions dsa medium

Round 2 - Technical 

(2 Questions)

  • Q1. Dsa easy question leetcode
  • Q2. Dsa medium question leetcode

Software Developer Intern Interview Questions Asked at Other Companies

Q1. Sum of Maximum and Minimum Elements Problem Statement Given an ar ... read more
asked in Amazon
Q2. Fish Eater Problem Statement In a river where water flows from le ... read more
asked in Apple
Q3. Kevin and his Fruits Problem Statement Kevin has 'N' buckets, eac ... read more
asked in CommVault
Q4. Sliding Maximum Problem Statement Given an array of integers ARR ... read more
Q5. Reverse Words in a String: Problem Statement You are given a stri ... read more
Interview experience
5
Excellent
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via Campus Placement and was interviewed before Jul 2022. There were 3 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 - Assignment 

Shared 3 DSA questions which needed to be solved using vector, more specifically matrix and sets. One questions was related to finding nearest point, other one to sort a list. They wanted to know all the approaches and their TC / SC.

Round 3 - One-on-one 

(2 Questions)

  • Q1. Finding distance between 2 points, nearest point. Given was a set of points.
  • Ans. 

    Calculate distance between 2 points and find the nearest point from a set of points.

    • Calculate distance using Euclidean distance formula: sqrt((x2-x1)^2 + (y2-y1)^2)

    • Iterate through all points to find distances and keep track of the nearest point

    • Return the nearest point found

  • Answered by AI
  • Q2. Discussing about TC and SC of sorting using all sorting methods

What people are saying about Amazon Development Centre India

View All
gamerman
Verified Icon
18h
works at
Amazon Development Centre India
Peanut hike
Working at largest e-comm company for 23k cash in hand for last 3 years...Just received a 7% yearly hike ...
Got a question about Amazon Development Centre India?
Ask anonymously on communities.
Interview experience
5
Excellent
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via Campus Placement and was interviewed before Dec 2022. There were 3 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 

The coding test contained two medium-level DSA-based questions followed by a Personality test.

Round 3 - Technical 

(1 Question)

  • Q1. In this round, they asked about one of my projects in my resume and gave a DSA problem on the DFS application. I had to write a pseudo code for it, and he asked me about the time complexity of some data st...

Interview Preparation Tips

Topics to prepare for Amazon Development Centre India Software Developer Intern interview:
  • DSA
Interview preparation tips for other job seekers - Be well-versed with DSA.

Amazon Development Centre India interview questions for designations

 Software Developer

 (7)

 SDE Intern

 (1)

 Intern

 (1)

 Software Engineer

 (3)

 HR Intern

 (1)

 Project Intern

 (1)

 Web Developer

 (2)

 Java Developer

 (1)

Interview questions from similar companies

I applied via Job Portal and was interviewed in Jun 2021. There were 3 interview rounds.

Interview Questionnaire 

1 Question

  • Q1. Sort an array
  • Ans. 

    Sorts an array of strings in ascending order.

    • Use a sorting algorithm like bubble sort, selection sort, or merge sort.

    • Compare adjacent elements and swap them if they are in the wrong order.

    • Repeat the process until the array is sorted.

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - good experience overall.

Skills evaluated in this interview

I applied via Company Website and was interviewed in Sep 2020. There were 4 interview rounds.

Interview Questionnaire 

1 Question

  • Q1. Fibonacci series, Prime function, linked lisk value access, query

Interview Preparation Tips

Interview preparation tips for other job seekers - First a test based on amcat. Followed by two technical interview. First Tech Interview basis and overview of you concept of ds and algo will ne asked. In second Tech interview indepth concept of topics such as arrays, linked list, os,algo, etc will be asked. Prepare ds and algo concept, dbms query & concept, internet basis such as protocols, methods,etc.

Best of luck

I appeared for an interview in Aug 2017.

Interview Questionnaire 

7 Questions

  • Q1. Implement Merge Sort.
  • Ans. 

    Merge Sort is a divide and conquer algorithm that sorts an array by dividing it into two halves, sorting them separately, and then merging the sorted halves.

    • Divide the array into two halves

    • Recursively sort the two halves

    • Merge the sorted halves

  • Answered by AI
  • Q2. Given a BST containing distinct integers, and a number ‘X’, find all pairs of integers in the BST whose sum is equal to ‘X’.
  • Ans. 

    Find pairs of integers in a BST whose sum is equal to a given number.

    • Traverse the BST and store the values in a hash set.

    • For each node, check if (X - node.value) exists in the hash set.

    • If yes, add the pair (node.value, X - node.value) to the result.

    • Continue traversal until all nodes are processed.

  • Answered by AI
  • Q3. Given a set of time intervals in any order, merge all overlapping intervals into one and output the result which should have only mutually exclusive intervals.
  • Ans. 

    Merge overlapping time intervals into mutually exclusive intervals.

    • Sort the intervals based on their start time.

    • Iterate through the intervals and merge overlapping intervals.

    • Output the mutually exclusive intervals.

    • Example: [(1,3), (2,6), (8,10), (15,18)] -> [(1,6), (8,10), (15,18)]

  • Answered by AI
  • Q4. What are the different types of hashing? Suggest an alternative and a better way for Linear Chaining.
  • Ans. 

    Different types of hashing and alternative for Linear Chaining

    • Different types of hashing include division, multiplication, and universal hashing

    • Alternative for Linear Chaining is Open Addressing

    • Open Addressing includes Linear Probing, Quadratic Probing, and Double Hashing

  • Answered by AI
  • Q5. Implement AVL Tree.
  • Ans. 

    An AVL tree is a self-balancing binary search tree where the heights of the left and right subtrees differ by at most one.

    • AVL tree is a binary search tree with additional balance factor for each node.

    • The balance factor is the difference between the heights of the left and right subtrees.

    • Insertion and deletion operations in AVL tree maintain the balance factor to ensure the tree remains balanced.

    • Rotations are performed ...

  • Answered by AI
  • Q6. Minimum number of squares whose sum equals to given number n.
  • Ans. 

    Find the minimum number of squares whose sum equals to a given number n.

    • Use dynamic programming to solve the problem efficiently.

    • Start with finding the square root of n and check if it is a perfect square.

    • If not, then try to find the minimum number of squares required for the remaining number.

    • Repeat the process until the remaining number becomes 0.

    • Return the minimum number of squares required for the given number n.

  • Answered by AI
  • Q7. Insertion sort for a singly linked list.
  • Ans. 

    Insertion sort for a singly linked list.

    • Traverse the list and compare each node with the previous nodes

    • If the current node is smaller, swap it with the previous node

    • Repeat until the end of the list is reached

    • Time complexity is O(n^2)

  • Answered by AI

Interview Preparation Tips

Round: Test
Experience: There were 2 coding questions (no penalty for wrong submission) and 20 Multiple Choice Questions(with negative marking). We were given 90 minutes to solve them. MCQs were based on Data Structures, OS, CN, C outputs, OOP etc.
Tips: Experience in Competitive Programming might help in solving coding questions. No constraints were mentioned and detailed Instructions related to problem were stated vaguely. So code carefully.
Duration: 1 hour 30 minutes
Total Questions: 22

Round: Technical Interview
Experience: The interviewer asked me to introduce myself and a brief introduction of the projects that I have done. She first asked me questions related to my project. After that she moved on to the data structures part.
Tips: Take your time to approach the problems and if the question is not clear ask the interviewer to explain it again.

Round: Technical Interview
Experience: The interviewer asked me about how my previous round went. After that, he asked me to introduce myself and a brief introduction of the projects that I have done. He first asked me a few questions related to my project. Then he moved on to the data structures part. In this round the interviewer gave me strict time limit for coding the solution on paper for each problem and as soon as I was done coding he gave me 2-3 minutes every time to find errors and debug my code.
Tips: Do not panic even if the interviewer sets time limit while solving problems. If the question is not clear ask the interviewer to explain it again.

College Name: The LNM Institute Of Information Technology, Jaipur

Skills evaluated in this interview

Interview Questionnaire 

7 Questions

  • Q1. Some of The most important Salary Immideyetly Processes
  • Q2. Oneandof Yaer NoukrNoukri.com *****
  • Q3. Noukri.com Online Payment
  • Q4. Fast forward Noukri.com
  • Q5. Brhamanc IT Course hdca and core java programming language Brhamanc IT Information Technology World Asia Pacific region India Tamilnadu Coimbatore Chinnathdagam 641108
  • Q6. Brhamanc IT Course hdca and core java programming language
  • Q7. QUALIFICATION:10TH STANDARD

I appeared for an interview before Sep 2020.

Round 1 - Coding Test 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Easy

There was 2 coding questions
Based on ds and algorithms

  • Q1. 

    Ninja's Pattern with Powers of 2

    Ninja, who loves playing with numbers, sets out to arrange numbers within 'N' rows. The unique arrangement follows these rules: the first row contains 1 number, the second...

  • Ans. 

    Generate a pattern of numbers in rows following a specific sequence based on powers of 2.

    • Start with 1 number in the first row, 2 numbers in the second row, 4 numbers in the third row, and so on based on powers of 2.

    • Fill the pattern with numbers in increasing sequence from 1 to 9, recycling back to 1 after reaching 9.

    • Output the pattern for a given number 'N' of rows.

    • Example: For N = 4, the pattern would be 1, 23, 4567,

  • Answered by AI
  • Q2. 

    Validate Binary Search Tree (BST)

    You are given a binary tree with 'N' integer nodes. Your task is to determine whether this binary tree is a Binary Search Tree (BST).

    BST Definition:

    A Binary Search Tr...

  • Ans. 

    Validate if a given binary tree is a Binary Search Tree (BST) or not.

    • Check if the left subtree of a node contains only nodes with data less than the node's data.

    • Check if the right subtree of a node contains only nodes with data greater than the node's data.

    • Recursively check if both the left and right subtrees are also binary search trees.

    • Example: For a node with data 4, left subtree nodes (2, 1, 3) are smaller and righ

  • Answered by AI
Round 2 - Coding Test 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Easy

There was 2 coding questions based on ds and algorithms

  • Q1. 

    Zig-Zag Array Rearrangement

    You are provided with an array of distinct elements, and your task is to rearrange the array elements in a zig-zag manner. Specifically, for every odd index i, the element ARR[...

  • Ans. 

    Rearrange array elements in a zig-zag manner where every odd index element is greater than its neighbors.

    • Iterate through the array and swap elements to satisfy the zig-zag condition.

    • Ensure that for every odd index i, ARR[i] > ARR[i-1] and ARR[i] > ARR[i+1].

    • Multiple correct answers may exist for a given array.

  • Answered by AI
  • Q2. 

    Flatten a Linked List

    You are provided with a linked list of 'N' nodes. Each node contains two pointers: NEXT, pointing to the next node in the list, and CHILD, pointing to a linked list. Each child linke...

  • Ans. 

    Flatten a linked list of sorted child linked lists into a single sorted linked list.

    • Traverse the linked list and maintain a priority queue to keep track of the next smallest element.

    • Merge the child linked lists into the priority queue while traversing the main linked list.

    • Pop elements from the priority queue to create the final flattened linked list.

  • Answered by AI
Round 3 - Video Call 

(1 Question)

Round duration - 45 Minutes
Round difficulty - Medium

My interview started at 9:30 and it took around 45 minutes to complete my interview.This was held on Amazon Chime and the interview lasted for 1 hour. Firstly the interviewer asked to introduce about myself, later asked regarding the projects I have mentioned in my resume. Then started displaying the coding question. The first question is number of islands in a matrix.

  • Q1. 

    Number of Islands Problem Statement

    You are provided with a 2-dimensional matrix having N rows and M columns, containing only 1s (land) and 0s (water). Your goal is to determine the number of islands in t...

  • Ans. 

    Count the number of islands in a 2D matrix of 1s and 0s.

    • Use Depth First Search (DFS) or Breadth First Search (BFS) to traverse the matrix and identify connected groups of 1s.

    • Maintain a visited array to keep track of visited cells to avoid redundant traversal.

    • Increment the island count each time a new island is encountered.

    • Consider edge cases like when the matrix is empty or all cells are water (0s).

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - 1 in HyderabadEligibility criteriaAbove 65 percentAmazon interview preparation:Topics to prepare for the interview - Data Structures and Algorithms, Operating Systems, Computer Networks, JavaTime required to prepare for the interview - 3 monthsInterview preparation tips for other job seekers

Tip 1 : Be enough confident, don't be nervous. Maintain atleast 2 projects in your resume.
Tip 2 : You should be able to answer each and every thing present in your resume. Don't lie in your resume.
Tip 3 : Prepare Data Structures and Algorithms well. They mostly check our Problem Solving ability to find the solutions for the real world problems

Application resume tips for other job seekers

Tip 1 : Mention your skills in which you are perfect
Tip 2 : Mention atleast two projects

Final outcome of the interviewRejected

Skills evaluated in this interview

I appeared for an interview before Sep 2020.

Round 1 - Coding Test 

(2 Questions)

Round duration - 90 minutes
Round difficulty - Easy

This was an online technical round on the mettl platform, the test window was open from 22 to 25 May 2020
The test had 28 mcqs and 2 coding questions.
The test was proctored. One needed to have webcam on.
A sample test link was provided before test to get familiar with the mettl platform.

  • Q1. 

    Count Inversions Problem Statement

    Given an integer array ARR of size N, your task is to find the total number of inversions that exist in the array.

    An inversion is defined for a pair of integers in the...

  • Ans. 

    Count the total number of inversions in an integer array.

    • Iterate through the array and for each pair of elements, check if the conditions for inversion are met.

    • Use a nested loop to compare each pair of elements efficiently.

    • Keep a count of the inversions found and return the total count at the end.

  • Answered by AI
  • Q2. 

    Find Pair with Maximum GCD in an Array

    Given an array of positive integers, your task is to find the GCD (Greatest Common Divisor) of a pair of elements such that it is the maximum among all possible pair...

  • Ans. 

    Find the pair with the maximum GCD in an array of positive integers.

    • Iterate through all pairs of elements in the array.

    • Calculate the GCD of each pair using Euclidean algorithm.

    • Keep track of the maximum GCD found so far.

    • Return the maximum GCD value.

  • Answered by AI
Round 2 - Video Call 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Medium

Time : 12pm to 1pm
Mode of Interview : Amazon Chime Video
LiveCode : To write code, it was not a compiler
The interviewer was quite supportive.

  • Q1. 

    Majority Element Problem Statement

    Given an array/list 'ARR' consisting of 'N' integers, your task is to find the majority element in the array. If there is no majority element present, return -1.

    Exampl...

  • Ans. 

    Find the majority element in an array, return -1 if no majority element exists.

    • Iterate through the array and keep track of the count of each element using a hashmap.

    • Check if any element's count is greater than floor(N/2) to determine the majority element.

    • Return the majority element or -1 if no majority element exists.

  • Answered by AI
  • Q2. 

    Subarray with Equal Occurrences Problem Statement

    You are provided with an array/list ARR of length N containing only 0s and 1s. Your goal is to determine the number of non-empty subarrays where the numbe...

  • Ans. 

    Count the number of subarrays where the number of 0s is equal to the number of 1s in a given array of 0s and 1s.

    • Iterate through the array and keep track of the count of 0s and 1s encountered so far.

    • Use a hashmap to store the difference between the counts of 0s and 1s seen at each index.

    • Increment the count of subarrays whenever the difference between the counts seen before matches the current difference.

  • Answered by AI
Round 3 - Video Call 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Medium

Time : 11 am to 12am
Mode of Interview : Amazon Chime Video
LiveCode : To write code, it was not a compiler
The interviewer was quite supportive.

  • Q1. 

    Sorted Linked List to Balanced BST Problem Statement

    Given a singly linked list where nodes contain values in increasing order, your task is to convert it into a Balanced Binary Search Tree (BST) using th...

  • Ans. 

    Convert a sorted linked list into a Balanced Binary Search Tree (BST) using the same data values.

    • Create a function to convert the linked list to an array for easier manipulation.

    • Implement a function to build a Balanced BST from the array recursively.

    • Ensure the height difference of the subtrees is no more than 1 for each node.

    • Use level order traversal to output the values of the BST nodes.

    • Handle NULL nodes by representi

  • Answered by AI
  • Q2. 

    Implement Stack with Linked List

    Your task is to implement a Stack data structure using a Singly Linked List.

    Explanation:

    Create a class named Stack which supports the following operations, each in O(1...

  • Ans. 

    Implement a Stack data structure using a Singly Linked List with operations in O(1) time.

    • Create a class named Stack with getSize, isEmpty, push, pop, and getTop methods.

    • Use a Singly Linked List to store the elements of the stack.

    • Ensure each operation runs in O(1) time complexity.

    • Handle edge cases like empty stack appropriately.

    • Test the implementation with sample queries to verify correctness.

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - Intern in BangaloreEligibility criteriaAbove 6.5 CGPA, No backlogsAmazon interview preparation:Topics to prepare for the interview - Data Structures and Algorithms, OOPS, DBMS, Computer Networks, Operating SystemTime required to prepare for the interview - 4 monthsInterview preparation tips for other job seekers

Tip 1 : Practice questions from all the topics as much as possible
Tip 2 : Be very much attentive while doing projects in college or anywhere, they are asked in detail if mentioned in resume.
Tip 3 : Be consistent while practicing and do a variety of questions rather than doing more questions of same kind.

Application resume tips for other job seekers

Tip 1 : You should know whatever you have mentioned in your resume. Don't brag in your resume ever. Be very precise. It doesn't matter how much you have done, what matters is you are very much confident and clear about what you have done.
Tip 2 : Put your projects and the language you code in for sure in your resume.

Final outcome of the interviewSelected

Skills evaluated in this interview

Amazon Development Centre India Interview FAQs

How many rounds are there in Amazon Development Centre India Software Developer Intern interview?
Amazon Development Centre India interview process usually has 2-3 rounds. The most common rounds in the Amazon Development Centre India interview process are Coding Test, Resume Shortlist and Technical.
What are the top questions asked in Amazon Development Centre India Software Developer Intern interview?

Some of the top questions asked at the Amazon Development Centre India Software Developer Intern interview -

  1. Finding distance between 2 points, nearest point. Given was a set of poin...read more
  2. Discussing about TC and SC of sorting using all sorting meth...read more
  3. Dsa easy question leetc...read more

Tell us how to improve this page.

Amazon Development Centre India Software Developer Intern Interview Process

based on 4 interviews

Interview experience

5
  
Excellent
View more
Amazon Development Centre India Software Developer Intern Salary
based on 5 salaries
₹12 L/yr - ₹13.2 L/yr
93% more than the average Software Developer Intern Salary in India
View more details

Amazon Development Centre India Software Developer Intern Reviews and Ratings

based on 8 reviews

4.5/5

Rating in categories

4.6

Skill development

3.7

Work-life balance

4.5

Salary

3.1

Job security

3.4

Company culture

3.7

Promotions

4.4

Work satisfaction

Explore 8 Reviews and Ratings
Customer Service Associate
2.8k salaries
unlock blur

₹1 L/yr - ₹5.5 L/yr

Transaction Risk Investigator
1.4k salaries
unlock blur

₹2.1 L/yr - ₹6.5 L/yr

Customer Service Executive
887 salaries
unlock blur

₹1.2 L/yr - ₹6 L/yr

Senior Associate
828 salaries
unlock blur

₹2.5 L/yr - ₹9 L/yr

Associate
629 salaries
unlock blur

₹1.6 L/yr - ₹6 L/yr

Explore more salaries
Compare Amazon Development Centre India with

Amazon

4.0
Compare

Flipkart

3.9
Compare

Udaan

3.9
Compare

Indiamart Intermesh

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