Open In App
Related Articles

Amazon Interview Experience | Set 264 (Experienced for SDE1)

Improve Article
Save Article
Like Article

I had around 1 year and 9 months of experience. And applied for SDE1

First Round (F2F):
1. What are data structures in which you are most uncomfortable.
2. What is your favorite sorting algorithm. Give a dry run.
3. Heap sort, dry run, Complexity of building heap, prove it.
4. Lowest Common Ancestor in a Binary Tree , extended for n-array tree.
5. Sort an array of 0s, 1s and 2s ( in single scan)

Second Round (F2F):
1. Tell me about yourself.
2. What is the most challenging project you have done, your contribution.
3. Convert a given tree to its Sum Tree
4. Longest K unique characters substring

Third Round (F2F):
1. Tell me about yourself.
2. Most challenging project, why it was challenging, your role in it.
3. Implement a LRU cache, extended for LRU with ttl at each block.
4. k largest(or smallest) elements in an array
5. Full working code of Dijastra Algorithm and a dry run.

Fourth Round: Hiring Manager (Telephonic)
1 Tell me about yourself, company role and responsibility and many behavioral questions.

  • Your current Group/Team structure.
  • Promotion criteria in your group.
  • Situation when you helped your colleague
  • Situation when you needed help from a colleague.
  • If one of team member is not working or working very slow, how will you handle the situation.
  • When you have trained any colleague.
  • Technology suggested by you in your team.

2. Detailed discussion about previous projects.
3. If you have indefinite budget and indefinite time, what type of project would do ?
4. Design a notification system.

Fifth Round: Bar Raiser
1. Tell me about yourself.
2. Find smallest positive missing number from an array of positive numbers.
3. Disagreement with your immediate supervisor, how your relation got affected after that disagreement.
4. Your one area which needs to be improved.
5. Your strongest strength.
6. A work in your project which made you proud.

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

Feeling lost in the world of random DSA topics, wasting time without progress? It's time for a change! Join our DSA course, where we'll guide you on an exciting journey to master DSA efficiently and on schedule.
Ready to dive in? Explore our Free Demo Content and join our DSA course, trusted by over 100,000 geeks!

Last Updated : 04 Jul, 2019
Like Article
Save Article
Similar Reads
Complete Tutorials