Skip to content
Related Articles

Related Articles

Save Article
Improve Article
Save Article
Like Article

Amazon Interview Experience | Set 318 (For SDE Intern)

  • Difficulty Level : Hard
  • Last Updated : 24 Apr, 2020

The First Round of test was taken online by Amazon on Hackerearth.

First Round:

Hey geek! It's time to become a success story instead of reading them. Check out our most renowned DSA Self Paced Course, now at a student-friendly price and become industry ready. And if you are looking for a more complete interview preparation resource, check out Complete Interview Preparation Course that will prepare you for the SDE role of your dreams!

Feeling prepared enough for your interview? Test your skills with our Test Series that will help you prepare for top companies like Amazon, Microsoft, TCS, Wipro, Google and many more!

2 Technical Rounds:
They take time in declaring results as they ensure that all eligible candidates make it to the Technical Interviews. Technical Rounds also consists of coding. Here, you need to discuss your approach with the interviewer and then code it on paper.

1st Technical Round:
General question of Tell My About Yourself. Following this were technical questions mainly coding.
Q1. Find the position of the rightmost set bit.
I gave various approaches, firstly dividing by 2. Then they asked for a solution using bit operations. Gave them solution using OR.
Q2. Time complexity of Binary Tree: Searching, Inserting

2nd Technical Round:
Again asked Tell My About Yourself. There were 2 coding questions asked.
Q1. Large number sum using Linked List.
2 Approaches: Reversing the linked list and then adding or Recursion. Gave both the solutions. Then the question was: In case of a billion digits, which would you prefer? Recursion has a lesser time complexity but, a normal system won’t be able to operate so much on recursion, as there will be a stack overflow. Hence for a billion digits we have to go with reversing the linked list and then adding each digits.

Q2. Find an element in a strictly row sorted and column sorted 2 dimensional array without brute force.

Q3. Questions on Sorting and Searching algorithms complexity.

Q4. Questions on Networking
What is BGP(Border Gateway Protocol)?
What is Link State Routing? How does it work?
What is OSPF?
TCP/IP model and OSI model.

If you like GeeksforGeeks and would like to contribute, you can also write an article and mail your article to See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above

My Personal Notes arrow_drop_up
Recommended Articles
Page :