Noting down my experience with the Amazon recruitment process. Might help in the near or far far future.
Position : Intern
9.10 am to 10 am : Pre-placement talk
10.30 am to 12 pm : Online test : Questions asked from OS, NC, DS, Algorithms, SQL
The online test conducted by https://www.interviewstreet.com/ consisted of 20 MCQs and 2 coding questions.
1.45 pm : Results Announced
2 pm - 1st technical round :
Only two questions were asked. A variety of questions from DS, Algo, Puzzles were asked by different panels.
Couple of questions were :
1. Convert a BST to a linked list in place.
2. How to find a path between two nodes in a BST.
3. You are given an infinite byte stream. The stream contains two types of characters - Japanese which takes 2 bytes and English which takes 1 byte. The Japanese character starts with 1 and English character starts with 0. Given a pointer p at any point in the byte stream (at a particular character) identify whether the previous character is English/Japanese.
4. Given an array of integers (positive and negative) find the maximum product between 3 numbers in the array.
5. Find the equilibrium point in an array i.e, the sum of elements on the left side of the point should be equal to the sum of elements on the right side of the point.
There was a second technical round which covered projects, Algorithms and Data Structures in depth.
#Observation : Cracking the Coding Interview, Data Structures and Algorithms Made Easy (Karumanchi) and http://www.geeksforgeeks.org/ are very helpful in preparing for these interviews.
PS: I managed to get through online test but ended up losing out on the technical round. No worries. Always a next time :)
Position : Intern
9.10 am to 10 am : Pre-placement talk
10.30 am to 12 pm : Online test : Questions asked from OS, NC, DS, Algorithms, SQL
The online test conducted by https://www.interviewstreet.com/ consisted of 20 MCQs and 2 coding questions.
1.45 pm : Results Announced
2 pm - 1st technical round :
Only two questions were asked. A variety of questions from DS, Algo, Puzzles were asked by different panels.
Couple of questions were :
1. Convert a BST to a linked list in place.
2. How to find a path between two nodes in a BST.
3. You are given an infinite byte stream. The stream contains two types of characters - Japanese which takes 2 bytes and English which takes 1 byte. The Japanese character starts with 1 and English character starts with 0. Given a pointer p at any point in the byte stream (at a particular character) identify whether the previous character is English/Japanese.
4. Given an array of integers (positive and negative) find the maximum product between 3 numbers in the array.
5. Find the equilibrium point in an array i.e, the sum of elements on the left side of the point should be equal to the sum of elements on the right side of the point.
There was a second technical round which covered projects, Algorithms and Data Structures in depth.
#Observation : Cracking the Coding Interview, Data Structures and Algorithms Made Easy (Karumanchi) and http://www.geeksforgeeks.org/ are very helpful in preparing for these interviews.
PS: I managed to get through online test but ended up losing out on the technical round. No worries. Always a next time :)
No comments:
Post a Comment