# Amazon Interview SDE-1 (Experience- 1 year)

Round 1: This round was online written test on hackerrank platform. There were two questions

1. Connect N ropes with minimum cost problem.
2. Given Two arrays, first array represents the forward distance and second return distance. There is a maximum distance dist. Find all the pairs (first number from first array, second number from second array) such that sum of the pair values is less than equal to dist (needs to find maximum possible sum pairs).  Note :- The sum of all the pairs should be same.  So try to maximize the sum.

For next round :- You are suppose to write code on the paper and they expect you to write the production level code and multiple test cases will be given to do dry run on the code.

Below are onsite interviews.

Round 2:

1. Tell me about yourself ?
2. Given A BST, decrease the value of node of even rank nodes by k, when you will do reverse inorder traversal(sorted in decreasing order)?
3. Given a circle and there are n flags on the circle boundary each flag have a index value and it’s length. And the flags do have a property F[i] > F[j] where i>j for every i and j. There is a number k( 0<=k<n), at index break the circle into the array, now find the minimum element in the array in O(log(n)) ?

Round 3:

1. Tell me about yourself?
2. Tell me about your current project?
3. Reverse a linked list in group of k. Solved this for all the possible corner cases.

Round 4:  This round was Hiring Manager round.

1. Tell me about yourself?
2. Any new initiative you took in your team?
3. Why do you want to join Amazon?
4. Tell me about your current project?
5. MVC in Angular?
6. Any challenge, you might have faced in your project?

Telephonic round :-

Round 5: This was Telephonic round, there was a shared interface, where I had to code.

1. Tell me about yourself?
2. There is an array given of size N, in which next element is +K or -K of the previous element.                A[i+1] = A[i]-{0, 1, 2, …, K} or = A[i]+{0, 1, 2, …, K}. Now you are suppose to search an element X in the array in less than O(N).

After waiting for weeks I finally got mail from Amazon 🙂 . Thanks GeeksforGeeks.

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

My Personal Notes arrow_drop_up

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

Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.