Recently i attended interview at amazon hyderabad for SDE-1.
Written round Two questions
- Find the unique character from two strings
- Parenthesis match problem
Face to Face
- Two colors are given(yellow, blue), we have to color such that no consecutive blue color is painted
Given the arrival and departure time of various trains in a station. Calculate the minimum number of platforms required such that no train has to wait for another train to vacate the platform.
The question basically means calculate the maximum number of trains that would be present in the platform at any given time.
sort the arrival time and sort the departure time, keep a count initialized to 0. compare the first element of the arrival time with the first of departure, increase the value of count if the value at current Index at arrival is less than the value index at departure and increment the arrival index, and vice versa. Keep the maximum count that you see.
Second face to face
- Implement stack using queue
- Reverse linked list form n occurrence ————–not so good
Third face to face
- Design elevator in OO perspective.
- How class is loading in JVM:- Discussed about eden, perm space. using graph and BSF & DFS.
- Clone the binary tree.
I didn’t got call after that.
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.
Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above