I applied through a recruiter. The process took 2 days. I interviewed at Amazon (Bengaluru) in May 2011
Interview
There was one written and 3 tech rounds...and i couldnt clear the last round....Written had 2 questions on trees and most of others also was on trees.....in my elimination round the question was to convert the binary tree to double linked list....I gave 2 answers using stack and queue and array of structures.....
But coulkdnt give inplace answer...
I applied through an employee referral. The process took 4 weeks. I interviewed at Amazon (Seattle, WA) in May 2011
Interview
Applied through employee referral. Got email from HR recruiter. Two phone screens which were fairly easy and then five onsite interviews; hard enough to sweat. Questions were focused on algorithms. Prepare everything: career cup, PIE. Don't really know what they expect.
Phone screen 1:
Basics of data structures like stacks, queues, hash tables.
Code: check whether a given string is palindrome or not.
Follow up: Find all substrings in a string that are palindromic.
Phone screen 2:
concepts of operating systems: deadlock, threads v processes
Code: A number between [0-N] is missing in an array of [0-N-1]. Find the missing number.
Design: Poker game.
Interview questions [5]
Question 1
Given a log file containing (User_Id, URL, Timestamp) user can navigate page from one to the other. Find the three page subset sequence repeated maximum number of times. Records are sorted by Timestamp.
Bar raiser
Given a NumberPool containing number sequence of numbers from 1 to infinity. Implement an interface, essentially two functions-
checkin(N): which adds number to the number pool and makes it available.
checkout(): returns minimum number from the pool and makes it unavailable.
Bar raiser
1. Given array of numbers, find a, b, c such that a + b = c. Can you beat O(N**2) ?
2. Difference between Quick sort and Merge sort. What modifications you make in Quick sort so that it provides O(N lg N) worst case complexity.
Given a set of numbers, partition the set in to two, such that sum of all the candidates in first subset = sum of all the candidate numbers in second subset.
I applied through a recruiter. The process took 1 day. I interviewed at Amazon (Seattle, WA) in May 2011
Interview
First phone interview. Applied through a recruiter and got the first phone interview call.
Was asked standard OOPS concepts like diff between interface and abstract class.
Difference between final, finally and finalize in Java
One coding question: Given a binary search tree and a target number, write code to get the closest number to target number in BST .
Interview questions [3]
Question 1
Standard OOPS concepts like diff between interface and abstract class.