Amazon–Application Support Engineer Interview

 

Face to Face  - Round 1

1) find the nth node from the last

2) Palindrome in Linked list

3) trouble shooting questions like "server is slow, need to find out the reasons why it is slow and how to make it fast"

Face to Face - Round 2

Many shell scripting questions

some trouble shooting questions

Face to Face - Round 3

Find an element in a pivoted array

troubleshooting questions : Website is slow/down. How to optimize to back end to make it up/fast.

Round 4 & 5 :

All questions related to  project (current employee / college project) , challenges faced in project, how i resolved it , strength, responsibilities etc.,

As it is support engineer role, questions were mainly in trouble shooting and very basic data structures. 

Expected working code &  test cases for all data structure questions.

Amazon Support Engineer - Online Test

Total 10 questions (7 MCQ & 3 Programming Questions)

7 MCQ questions includes the following sections:

1. Stacks & Queues

2. Min Heap

3. Linked List (circular Linked List)

4. DBMS Questions (DDL , dML)

5. OS questions (semaphore)

6. Aptitute Question

7. Given a program , what is the output ? (Given, virtual function questions)

3 Programming Questions:

8. Pattern Matching Question

9. Swap adjacent nodes in a linked list.

10. Write a script to print the uniq phone numbers in a folder which contains list of html files.

phone numbers can be in any format (xxxxxxxxxx , xxxxx-xxxxx , xxx-xxx-xxxx)

Online test conducted through Interviewstreet.com

Some of the interview questions asked recently

 

1. Given a binary tree & a sum value. Find the two nodes in a binary tree whose sum is equal to the given sum.

2. Print all the permutations of a string.

3. Detect and remove the loop in linked list.

4. Given a binary tree , find the maximum rooted subtree (whose sum of its child is greater than other sub trees).

5. Difference between abstract class & packages in Java.

6. Convert Binary Search Tree to Sorted Doubly linked list.

7. Maximum circular subarry sum.

8. Given 3 numbers. Find the lease valid date formed by those numbers.

eg: 1,2 ,3. Output should be : 3/2/1. Note: should take care of cases like valid month & date & leap year.

9. Given binary tree . Print the sum of all the leaf nodes.

10. Given two sorted arrays , ‘A’ of size m and ‘B’ of size n+m. Array B will contain numbers in n positions and ‘m’ empty positions. Merget two Arrays. Note: Should not use extra memory.