Amazon Software Development Engineer Intern Interview Questions, Process, and Tips

2 Medium difficulty level questions + situation-based questions on Amazon leadership principles are asked.

Q1. 1 Medium-level DSA Question based on the linked list and pointers to copy source list to destination list.
Add your answer
Q2. Questions asked on Previous internships and Amazon leadership principles
Add your answer

Q1. Print boundary nodes of a tree
Ans. 
Print the boundary nodes of a tree.
• Boundary nodes are the leftmost and rightmost nodes of each level of the tree and the leaf nodes that are not part of the subtree.

• Traverse the tree in a clockwise direction and print the nodes as you encounter them.

• Use recursion to traverse the tree and keep track of the level and whether the node is a left or right boundary node.
Answered by AI
Add your answer
Q2. What are hamming distance and hamming weights? Write code to calculate hamming distance between 2 numbers.
Ans. 
Hamming distance is the number of differing bits between two binary strings. Hamming weight is the number of 1s in a binary string.
• Hamming distance is used in error detection and correction codes.

• Hamming weight is also known as population count or popcount.

• To calculate hamming distance, XOR two numbers and count the number of 1s in the result.

• Example: Hamming distance between 1010 and 1110 is 1.

• Example: Hamming weight
Answered by AI
Add your answer
Q3. What data structure do you know? Advantages and disadvantages of singly and doubly linked lists
Ans. 
Singly and doubly linked lists are linear data structures used to store and manipulate data.
• Singly linked lists use less memory than doubly linked lists

• Doubly linked lists allow for traversal in both directions

• Singly linked lists are faster for insertion and deletion at the beginning of the list

• Doubly linked lists are faster for insertion and deletion in the middle of the list

• Both have O(n) time complexity for searchin
Answered by AI
Add your answer
Q4. List some sorting algorithms. Why time complexity of merge sort is O(nlogn)
Ans. 
Sorting algorithms include bubble sort, insertion sort, selection sort, quick sort, merge sort, etc. Merge sort has O(nlogn) time complexity.
• Sorting algorithms are used to arrange data in a specific order.

• Merge sort is a divide and conquer algorithm that divides the input array into two halves, sorts each half, and then merges the sorted halves.

• The time complexity of merge sort is O(nlogn) because it divides the input ...read more
Answered by AI
Add your answer
Q5. Questions asked on projects
Add your answer

It was a mix of the following:
Short debugging-type questions from DSA.
2 DSA problems medium level

Q1. Technical Interview around 1.5 hrs
Add your answer
Q2. One was a variation of merging intervals.
Add your answer
Q3. Subtree sum problem based on tree topic.
Add your answer

DSA questions such as two sum

Q1. Interview got delayed
Add your answer