Amazon Interview | Set 27

Amazon Interview | Set 27

Hi, I was recently interviewed for SDE1 position for Amazon and got selected. I had 1.5 year experience in Java. Geeksforgeeks helped me lot. I am very thankful to geeksforgeeks team. following were interview questions-

Telephonic rounds followed by 5 F2F interviews.

Round 1 (telephonic):

1. There is a dictionary already implemented. Write a method, which takes input string without space, to prints all subsets of the input string which was present in Dict Ionary.

example:dictionary–a*
........ input-aaabaa
........ output-a,a,a,aa,aa,aaa,a,a,aa

2. There is a dictionary already implemented. Write a method, which takes input String without space, to replace the characters from the strings which is not present in dictionary with–

example:dictionary–a*
........ input-aaabaa
........ output-aaa_aa

Interviewer was cool. did not code properly (lots of bugs were in code), but gave good approach for first question. For second question solution sent in a mail.

Round 2 (telephonic):

1. Write a program to remove duplicates from array of prime numbers.

2. Write a program to return nearest elements from a binary search tree for INPUT element.

This round was very good. Interviewer is very happy with my approach for both questions. Code do not has a big bug.

Round 1 (F2f-problem Solving and coding):
1. Tell me about yourself.
2. Write a program to find top ten elements on an array of integers.
Don ' t remember much. Questions were easy. This round was very good. Interviewer is happy with solution.
3. Write a calculate a^b and store it in floating point representation.

Round 2 (f2f-computer fundamental):
1. Tell me about experience in past job.
2. OOPS concepts-polymorphism, inheritance, encapsulation, abstraction.
3. Aggregation and composition.
4. Design patterns which you have implemented.
5. Write code to implement Singleton design pattern.
6. Design a system to implement options in Pack of cards.
7. Difference between Windows and Unix.
8. Threads, synchronization, Deadlock.
9. Other subjects which your studied in your academics.
Max challenging work ever faced.
One. Discussed about current project, role.
This round is fair enough. I was not able to discuss questions on subjects which I studied in academics.

Round 3 (F2f-data Structures and algorithms):
1. Tell me about yourself.
2. There is a 2d array. Write code to find the path with maximum sum. You can only traverse i+1 or j+1.if I are row number and J is column number.
I solved it using dynamic programming
3. In a binary tree find the least common ancestor for both nodes. (Write code)
4. Similar to 3rd question. Write a program to find least common ancestor in binary search tree.
This round is very good. Finished it only mins.

Round 4 (f2f-managerial Round):
1. Tell me about yourself.
2. Copy Linked list with orbit pointer.
3. Write a code to the find top hundred elements in a data set which cannot is loaded in RAM.
4. Typical parenthesis checking problem.
5. Most challenging work ever faced.
6. What would do if-get task which is ambiguous.
7. At "Extend you" is frustrated if you always get ambiguous problems.
8. How the many members in the your team in the current organization. What ' s your role? Questions on the current project.

Interviewer was very cool and friendly.

Round 5 (F2f-bar raiser Round):
1. Tell me about yourself.
2. Discussed about current project.
3. Write a program to the find number of inversions in an array.
Example-array 2, 5, 3, 1,10
Inversions (2,1), (5,1), (3,1), (5,3)
Answer'll be–4
Gave solution of Complexity O (NLOGN). Interviewer gave me hint for that.
Hint-divide and conquer approach.
He asked me to write code which doesn ' t has any bug.

This article was compiled by Neha Gupta. Many many congratulations to Neha. If you like Geeksforgeeks and would like to contribute, you can also write a article and mail your article to [email prot Ected] See your article appearing in the Geeksforgeeks Main page and help other Geeks.

Amazon Interview | Set 27