Amazon Development Centre India Software Developer Intern Interview Questions and Answers

Q1. Design parking lot app
Ans. 
A parking lot app to help users find available parking spots and pay for parking.
• Include a map feature to show available parking spots in real-time

• Allow users to reserve parking spots in advance

• Integrate payment options for users to pay for parking

• Provide notifications for parking expiration or availability of nearby spots
Answered by AI
Add your answer
Q2. Design parking lot app for blind people
Ans. 
A parking lot app designed for blind people to easily navigate and find available parking spots.
• Include voice-guided navigation to direct users to available parking spots

• Use sensors to detect empty parking spaces and relay information to the app

• Provide audio alerts for obstacles or other vehicles in the parking lot

• Include a feature for users to easily locate their parked vehicle when returning
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

Q1. 
Add Two Numbers Represented by Linked Lists
Your task is to find the sum list of two numbers represented by linked lists and return the head of the sum list.
Explanation:
The sum list should be a linked...read more
Ans. Recursive approach
One way is to recursively add the two linked lists. Keep the nodes in the recursion stack and add the last nodes first and then second last and so on. Initially, find the size of both the linked lists. If both the linked lists are of the same size, add them using recursion. Else if their sizes differ, move the head pointer of the larger linked list forward K times, where K is the difference between th...read more
Answered Anonymously
Add your answer
Q2. 
Check If Linked List Is Palindrome
Given a singly linked list of integers, determine if the linked list is a palindrome.
Explanation:
A linked list is considered a palindrome if it reads the same forwar...read more
Ans. Using Stack
The idea is to store the list values in a stack and then compare the values in the list with the values in the stack.
 
Algorithm:
1. Traverse the list from head to tail and push every node in the stack.
2. Make a pointer ‘cur’ which initially points to the head node.
3. If value at ‘cur’ is not equal to the top element of the stack, then the given list is not a palindrome
4. Else, move the ‘cur’ pointer to its next node...read more
Answered Anonymously
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

Q1. 
Square Root with Decimal Precision Problem Statement
You are provided with two integers, 'N' and 'D'. Your objective is to determine the square root of the number 'N' with a precision up to 'D' decimal pl...read more
Ans. Bruteforce
• We will find the integer part and decimal part of the answer separately.
• First, we will find an integral part.
• We will declare the answer variable where we will store the answer.
• Your answer could be between 1 and N so we will iterate through all the numbers from 1 to N.
  • Let’s say we are currently at number i.
  • If i ^ 2 = N then i is the exact answer so we will return i.
  • If i ^ 2 < N then i could be a possible an...read more
Answered Anonymously
Add your answer
Q2. 
Alien Dictionary Problem Statement
You are provided with a sorted dictionary (by lexical order) in an alien language. Your task is to determine the character order of the alien language from this dictiona...read more
Ans. Permutations Approach
Approach:
• Find all the distinct characters present in all the words.
• Generate all permutations of these distinct characters.
• Treat each of the permutations as a correct sequence of alphabets. Now check if the given words are sorted according to this sequence. In order to do this, we will:-
  • For all words from 1 to n - 1, let the current word be ‘currWord’ and the next word be ‘nextWord’.
  • One by one compa...read more
Answered Anonymously
Add your answer

Q1. Valid BT or not
Add your answer
Q2. Make complete row and column zero in a matrix for each element that is already 0
Ans. 
Use a two-pass approach to mark rows and columns with zeros based on existing zeros in the matrix.
• Iterate through the matrix to mark rows and columns with zeros based on existing zeros

• Use two arrays to keep track of which rows and columns need to be zeroed out

• Perform a second pass to update the matrix based on the marked rows and columns
Answered by AI
Add your answer

Similar to Round 1 but more hard questions