Amazon Software Development Engineer Interview Questions, Process, and Tips

2 DSA questions of leetcode medium level

Q1. Medium level DSA questions like left view of binary tree and merge sorting
Add your answer

Q1. Some standard questions like rain water trapping and rotten oranges problems
Add your answer

Comprise of DSA questions related to trees

Coding question related to graph traversal

Q1. Design system design for bitly
Ans. 
Design system design for bitly
• Use a distributed system architecture to handle high traffic and scalability

• Implement a URL shortening algorithm to generate unique short links

• Utilize caching mechanisms to improve performance and reduce database load

• Include analytics and tracking features to monitor link performance

• Ensure data security and privacy measures are in place to protect user information
Answered by AI
Add your answer
Q2. Deep dive into the component used in bitly deisng
Add your answer

Q1. Design system design for book my show
Ans. 
Design a system for booking tickets for events like movies, concerts, etc.
• Use microservices architecture for scalability and flexibility

• Implement a user-friendly interface for easy ticket booking

• Include features like seat selection, payment gateway integration, and booking history

• Utilize a database to store event details, user information, and booking records
Answered by AI
Add your answer
Q2. Deep dive into components of book my show
Add your answer

Q1. Maximum absolute difference between any two level's sum in a binary tree
Ans. 
Calculate the maximum absolute difference between the sums of any two levels in a binary tree.
• Traverse the binary tree level by level and calculate the sum of nodes at each level.

• Keep track of the maximum absolute difference between the sums of any two levels encountered so far.

• Return the maximum absolute difference found.
Answered by AI
Add your answer
Q2. Given an array now we can do 2 operations, idx+arr[idx] and idx-arr[idx]. Identify that can we reach to index having 0 as value.
Ans. 
Yes, we can use Breadth First Search (BFS) algorithm to determine if we can reach index 0 with the given operations.
• Use BFS algorithm to explore all possible paths starting from index 0.

• Keep track of visited indices to avoid infinite loops.

• If we reach an index with value 0, return true; otherwise, return false.
Answered by AI
Add your answer

Q1. Separate prime from non prime in array if order matters
Ans. 
Use two separate arrays to store prime and non-prime numbers from the input array.
• Iterate through the input array and check if each element is prime or not.

• Store prime numbers in one array and non-prime numbers in another array.

• Maintain the order of elements in the input array while separating prime and non-prime numbers.
Answered by AI
Add your answer
Q2. Separate prime from non prime in array if order doesn't matter
Ans. 
Use a hashmap to separate prime and non-prime numbers in an array of strings.
• Iterate through the array and convert each string to an integer.

• Use a hashmap to store prime and non-prime numbers based on their divisibility.

• Convert the hashmap back to separate arrays for prime and non-prime numbers.
Answered by AI
Add your answer

Q1. Separate prime from non prime in linked list , by preserving there order
Ans. 
Separate prime numbers from non-prime numbers in a linked list while preserving their order.
• Iterate through the linked list and separate prime numbers from non-prime numbers

• Create two separate linked lists for prime and non-prime numbers

• Maintain the order of numbers while separating them

• Example: Input: 1 -> 2 -> 3 -> 4 -> 5, Output: Prime: 2 -> 3 -> 5, Non-prime: 1 -> 4
Answered by AI
Add your answer
Q2. Given a string of bracket, now identify number of flips require to balance parenthesis
Ans. 
Count number of flips required to balance parentheses in a string
• Iterate through the string and keep track of open and close brackets

• If a close bracket is encountered without a corresponding open bracket, increment flip count

• Return the total number of flips required to balance the parentheses
Answered by AI
Add your answer

2 DSA LeetCode Medium Questions + Follow-up Leadership Principles MCQ questions.

Q1. Explain and implement LRU caching algorithm
Ans. 
LRU caching algorithm stores most recently used items, discarding least recently used items when full.
• Use a doubly linked list to maintain order of items based on recent usage

• Use a hashmap to quickly access items in the cache

• When an item is accessed, move it to the front of the linked list

• When cache is full, remove the last item in the linked list
Answered by AI
Add your answer
Q2. Find kth min element from an array
Ans. 
Use quickselect algorithm to find the kth min element from an array
• Implement quickselect algorithm to partition the array based on a pivot element

• Recursively select the partition to search for the kth min element

• Time complexity is O(n) on average, O(n^2) worst case
Answered by AI
Add your answer

There were 3 coding questions within 1.5 hrs, 2 leetcode medium, 1 leetcode easy.

Q1. This was the toughest round and there was just one graph question(competitive programming) and the interviewer was helping and giving hints and I was able to solve it finally
Add your answer

Q1. This was low level system design interview in which I have to design parking lot.
Add your answer

Q1. This was hiring manager round in which we discussed higher level design of my existing projects.
Add your answer