Amazon SDE Intern Interview Questions, Process, and Tips

Duration: 1hr+
Topics: 2 - coding questions(logic-based)
platform: Hackerank

Q1. Find the square root of a number using only 4 basic arithmetic operations (+,-,*,/) without using a power operator and inbuilt libraries. For numbers that are not perfect squares, print the integer part of...read more
Ans. 
Find square root of a number using basic arithmetic operations without power operator and inbuilt libraries.
• Use binary search to find the integer part of the square root

• Use long division method to find the decimal part of the square root

• Repeat the above steps until desired accuracy is achieved

• Handle edge cases like negative numbers and numbers less than 1
Answered by AI
Add your answer
Q2. Addition of two linked lists, and finallt return the result as a linked list
Ans. 
Addition of two linked lists and return the result as a linked list.
• Traverse both linked lists simultaneously

• Add corresponding nodes and carry over the sum

• Create a new linked list with the sum
Answered by AI
Add your answer

Don;t remember the leetcode question, was medium

Don't remember the leetcode qyuestion, was medium, had a behavior component, remember the Amazon principles

Q1. Count occurrences in sorted array
Ans. 
Count occurrences of a given element in a sorted array.
• Use binary search to find the first and last occurrence of the element.

• Subtract the indices to get the count.

• Handle edge cases like element not present in the array.
Answered by AI
Add your answer
Q2. Deepest left node in binary tree
Ans. 
Find the deepest left node in a binary tree.
• Traverse the tree recursively and keep track of the depth and whether the current node is a left node.

• If the current node is a leaf node and its depth is greater than the deepest left node found so far, update the deepest left node.

• Return the deepest left node found.

• Example: For the binary tree with root node 1, left child 2, and left child of 2 being 4, the deepest left node...read more
Answered by AI
Add your answer

2 coding question level easy-medium leetcode

Q1. 2 coding question leetcode
Add your answer
Q2. Dp graph trees stack queue
Add your answer

Q1. 2 Coding question leetcode easy medium
Add your answer