1st Telephonic round
After few project and introduction related question.
- Write a program to find an element in sorted and rotated array.
- Write a program to print all path whose sum is equal to a given number path must start from the root node and it may or may not end at the leaf.
2nd Telephonic round
After 3-4 days
Some c/c++ question what is malloc how does it work and memory layout and allocation related questions
- Write a program to find longest repeating substring In a given string running code were required covering all base cases.
- U have given 10 files and you have given a string suggest data structure which ll facilitate efficient search of string in the file if string appears more than ones in that case u have to print line number and file in which they appear.
After 15 days I got cal that I have cleared the telephonic round and my F-2-F interview is going to take place in Hyderabad
F-2-F round 1
After introduction and project related questions
- Write a program to print a tree in vertical order asked more than one approach to do this problem and modified problem many times.
- Write a program to convert a tree to doubly link list in post-order fashion only change of pointer are allowed that is left pointer can work as previous and right pointer s as next.
This interview went well J
F-2-F round 2(Bar raiser)
Few question related to OS what is deadlock, Race-condition, Semaphore and many more, few question Related to DBMS what is Normalization define all normal forms(I directly told him I don’t remember I read it in 5th semester )
- Why amazon??
- Why do u want to leave company XYZ.
- Your biggest challenge till the date.
- Many project related question.
- U have given 10 files each having 1 million integer in sorted order, physical memory have size of 3 million suggest method to extract 1 million integer in sorted form efficiently.
- Write a program to convert a decimal number into binary your code should work on both big endian and small endian machine. U have given a variable which tell u whether machine is big endian or small endian
DBMS and few bar raiser question made this round average L
F-2-F round 3
- You have given an n-ary tree write a program to check whether this tree is sum tree or not.
- Given an array write a program to find kth smallest element in the array. He was hardly interested in the solution he just want to know how many ways u can solve it solved using 5-6 method at the end he was satisfied with the answers.
F-2-F round 4
Longest one….this interview went on for 1 hour and 30 minutes but was interesting one(interviewer looked lyk a frustrated guy…some tyms I felt that he is going to punch me 😛 :P)
- You have given M array each of size n all array are sorted separately write a program to make a big sorted array of size m*n . during discussion he told me to prove many lemma like height of tree is log(n)( for n elements) sum of n natural number is (n*n+1)/2 and many more. He modified problem many times don’t use extra space do it in space etc. discussion went on for almost 1 hour but at the end he was happy with the solutions(I suggested 2 method and further optimization in them.
- U have given an binary matrix which is sorted row wise and column wise write a program to search a row in the matrix having maximum number of zeroes.
Finally this interview also went well he was happy with my performance
After 2-3 days I got mail from the HR that I m rejected LL reason was bar raiser … 1 advise to all don’t take BR round lightly it does not matter how well u performed in other round if u didn’t do well in BR round then there is no way u can make it. An average round tech interview is fine but average BR round means rejected.
If you like GeeksforGeeks and would like to contribute, you can also write an article and mail your article to firstname.lastname@example.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
- Amazon Interview Experience | Set 249 (Telephonic Interview)
- Amazon Interview Experience | Set 180 (Telephonic Interview )
- Amazon Interview Experience (Telephonic Interview)
- Amazon Interview -SDE 1 Interview Experience
- Amazon Interview | Set 53 (For SDE-1)
- Amazon Interview | Set 71 (For SDE-2)
- Amazon Interview | Set 33
- Amazon Interview | Set 104
- Amazon Interview | Set 69 (For SDE-1)
- Amazon Interview | Set 62 (For SDE-1)
- Amazon Interview | Set 63 (For SDE-1)
- Amazon Interview | Set 66 (For SDE)
- Amazon Interview | Set 67 (For SDE-1)
- Amazon Interview | Set 68 (For SDE-1)
- Amazon Interview | Set 76 (For SDE-1)