Amazon Interview Experience | Set 208 (On-Campus for Internship)
Amazon visited our campus for hiring Software Developer interns for Summer 2016.
Cut-Off : 75%
140 students were shortlisted.
Round 1 (Coding + Aptitude):
First round mostly comprised of problems on OS, DS, Basic Aptitude, Algorithms etc.
2 coding questions
1. Given a string find the first non repeating character in it
2. Given an array of integers, find count of minimum number of elements to be removed from the array such that the maximum element of the new array is at most twice of the minimum.
39 shortlisted after this round
He asked about my favorite subjects and Data Structures that I have implemented. I named few Data Structures including Segment Tree. Then he asked me about segment trees and how to solve some simple problems based on segment trees, He asked only about approach didn’t asked me to code. Then he asked me about
I told him approach using level order traversal. Then he asked me to connect nodes on same level but this time to their left sibling. After telling my approach he asked me to code and said that he want code free of any errors. After I gave him my code he pointed out that there are some errors in code. He asked me to find and correct them myself.
Then he asked another question:
After hearing my approach for this question he asked me to print leaves that correspond to diameter.
Only one question was asked in this round. She asked me to implement a data structure that can perform 1) Insert (O(1))2) Delete (O(1))3) Count(O(1))4) Get Element(O(1))on integer inputs. Here Get Element returns any element present in DS.
I told her my approaches using array, single linked list with hashing and using two singly linked list and hashing. I couldn’t reach exact solution but she was satisfied with my approach.
Solution to this problem was easy using doubly linked list and hashing.
After this round a total of 19 students were selected for internship.
- Think before you speak
- Be honest during interview
- Stay Calm
- Take hints from interviewers
Finally, I would like to thank Geeksforgeeks for helping me with my preparation ?
If you like GeeksforGeeks and would like to contribute, you can also write an article and mail your article to email@example.com. See your article appearing on the GeeksforGeeks main page and help other Geeks.