Amazon Interview Experience SDE-1
This was a hiring drive at the Chennai office. Around 40 people attended.

Day 1 interviews

Round 1: Written Round

Longest Palindrome in a String

Transform to Sum Tree

Reverse a Linked List in groups of given size.

Round 2: Tech Round

Maximum sum such that no two elements are adjacent

Questions on Dynamic programming – Overlapping subproblems and Optimal substructure property for the above questions
Full Code, Time and Space complexity

Round 3: Tech Round

Question 1: k-th distinct (or non-repeating) element in an array. – Code

Question 2: XOR Linked list – discussion and tracing an example

Question 3: Group Anagrams Together
Given Hash-based and Trie based approach and code for Hash-based implementation

Question 4: Check whether N is reachable with numbers a and b instead of 0 and 1 using Fibonacci series. (-INF<=a, b<=INF) Full code.

Question 5: Convert a given Binary Tree to Doubly Linked List
Day 2 – Interviews

Round 4: Bar Raiser

1.Projects Discussion
2.More Behavioural questions and Scenario-based question(Regarding Cloud Architecture)
3.Design patterns – Singleton, Builder, Prototype, Factory.
4.Questions involving REST API’s.
5.Finally a problem: Pseudo code and tracing an example
Median in a stream of integers (running integers)
Suggested 3 ways of solving the above problem comparing their time and space complexities

Round 5: Hiring Manager Round

1.More discussion on projects
2.Still more behavioural questions and Scenario-based questions.
3.Discussion on Restful Web Services.

Write your Interview Experience or mail it to contribute@geeksforgeeks.org

My Personal Notes arrow_drop_up

Save