Amazon Sdet Lead Interview Questions, Process, and Tips

Easy but tricky, cab be done easily.

Bit difficult to tackle but don't panic.

Leetcode medium level questions were asked

Q1. Leetcode Hard Median of two sorted arrays in O log n time
Ans. 
The median of two sorted arrays can be found in O(log n) time using binary search.
• Divide the arrays into two parts at a certain index and compare the medians of both parts.

• Adjust the dividing index based on the comparison until the medians are equal or adjacent.

• Handle edge cases like uneven array lengths and one array being entirely smaller than the other.
Answered by AI
Add your answer

Q1. About previous companies and projects achievements, struggle
Add your answer