Amazon Software Developer Intern Interview Questions, Process, and Tips

Coding test usually lasts 70 to 90 minutes

Q1. Given Array of integers, find pair of adjacent elements with largest product and return product
Ans. 
Find pair of adjacent elements with largest product in an array of integers
• Iterate through the array and calculate the product of each pair of adjacent elements

• Keep track of the pair with the largest product as you iterate

• Return the largest product found
Answered by AI
Add your answer
Q2. Discuss time where you had disagreement with manager
Add your answer

Good knowledge of dsa is required

Q1. What is bst - programming Q related to bst
Ans. 
BST stands for Binary Search Tree, a data structure used for efficient searching, insertion, and deletion operations.
• BST is a binary tree where each node has at most two children, referred to as the left child and the right child.

• The key in each node must be greater than all keys stored in the left subtree and less than all keys in the right subtree.

• Example: In a BST, the left child of a node contains keys less than th...read more
Answered by AI
Add your answer

Q1. Tell me the leadership principle which u would follow the most
Ans. 
I would follow the leadership principle of 'Lead by Example'
• Setting a positive example for others to follow

• Demonstrating the behavior and work ethic expected from team members

• Inspiring and motivating others through actions rather than just words
Answered by AI
Add your answer

Overall good exp and standard questions

Q1. Tree dp graph important
Ans. 
Tree dp graph is important for optimizing algorithms on tree structures.
• Tree dp (dynamic programming) is a technique used to optimize algorithms on tree structures by storing and reusing intermediate results.

• Graph algorithms on trees often involve traversing the tree in a specific order to solve a problem efficiently.

• Understanding tree dp graph can help in solving problems like finding the longest path in a tree, calcu...read more
Answered by AI
Add your answer

It was leetcode medium level questions

Q1. Technical interview was on based of my DSA skills and some oops
Add your answer

Medium hard level questions were there

Q1. Median of trying running data stream
Ans. 
Finding the median of a data stream efficiently
• Use two heaps - a max heap to store the smaller half of the data and a min heap to store the larger half

• Keep the two heaps balanced by ensuring the size difference is at most 1

• If the total number of elements is odd, the median is the top element of the larger heap. If even, it's the average of the top elements of both heaps
Answered by AI
Add your answer
Q2. Union find of data
Add your answer

The first round comprised of 4 sections online questions including aptitude, logical, Coding questions, and technical portions (Test Duration: 90 mins):

Debugging: We had to choose a language and debug up to 7 questions most probably. Codes were very basic like sorting, etc. I completed 6 of them.

Coding: There were two medium-hard level questions.

Work-style Assessment: Just try to answer as an ideal employee. Make sure you answers don’t contradict each other.

Aptitude: Around 25 questions.

Q1. Find diameter of tree
Ans. 
The diameter of a tree is the longest path between two nodes in a tree.
• Calculate the longest path between two leaf nodes in the tree.

• The diameter of a tree can be found by calculating the height of the left subtree, the height of the right subtree, and the sum of the heights plus 1 for the root node.

• Example: For the tree 1 -> 2 -> 3 -> 4, the diameter is 3 (from node 4 to node 2).
Answered by AI
Add your answer
Q2. Count inversion
Add your answer

Q1. Find n’th node from the end of a Linked List
Ans. 
To find the n'th node from the end of a Linked List, use two pointers approach.
• Use two pointers, one moving n steps ahead of the other.

• When the first pointer reaches the end, the second pointer will be at the n'th node from the end.

• Handle edge cases like n being greater than the length of the Linked List.
Answered by AI
Add your answer
Q2. Find shortest distance between 2 points in a matrix, where 2 points can be anywhere
Ans. 
Use Breadth First Search algorithm to find the shortest distance between 2 points in a matrix.
• Implement Breadth First Search algorithm to traverse the matrix

• Keep track of visited cells to avoid revisiting them

• Stop the search when the destination point is reached
Answered by AI
Add your answer