Amazon Interview Experience | Set 178 (For SDE-1)

In-house interview with Amazon Bangalore for SDE 1. Here’s my experience.

Round 1:
My first round was the HM round because no other panel members were free.
1. Lots of questions my current project. Why I am looking for a job change.
2. Write a calculator web application just like the one that comes with MS windows.
       Trick was to evaluate the expression according to the BODMAS
       Lots of dicussion on different approach using 2 stacks, arrays, lists, Tree
       with and without postfix conversion.
       Asked to explain all the approach on the White Board.

Round 2:
1. Link all the level order nodes to makes a linked list with the first node of each level acting as the root of that linklist.



 
         10
       /    \
     6       17
   /       /   \
 4     14     19 
So the Linklist will be
     10->null
     6->17->null
     4->14->19->null 

Gave the answer using the 2 queue. (Level order transversal) with alternate queue for the alternate level
Than interviewer asked to solve the problem without using any other data structure (No stack or queue)

2. Question on Baggage claim token generations.
       You have three containers, small, medium and large. Passenger comes in, checkin the luggage. You have to store the baggage in the appropriate container and generate a unique token number. Then passenger should get back the bag using the same token number. Trick was if small container is full store in medium if available or large. Now if the large bag comes in and there is now a empty space in small, than move the small bag back to small & store the large bag. How to generate the unique token number and move the baagage internally without changing the token number?
       Lookup should be in constant time complexity and insertion in minimum complexity.
       It looks easy but kind of tricky if you start solving because token number shouldn’t get changed if you move the baggage internally and space should not get wasted in the memory if baggage is removed.

Round 3:
1. Find the size of the smallest substring in a given string that contains all the characters in given set in any order.

    Ex: 
       INPUT:
             String: "abfugtabecddcca"
        Character Set: a,b,c                
       Output: 4  ("abec") 

2. Convert a sorted doubly linklist into Binary search tree (Inplace)

Round 4(Bar Raiser Round):
1. Again Lots of questions on current project. My contributions.
       Most complicated problem I have ever encountered in my recent project and how I solved it.
       Subject I liked the most in the college and why and what I learnt from it.
       In my previous rounds, which question I found the most difficult one and why?
       If I will be given a chance to change any of the my answers to the questions asked in previous round, what question it will be and why?
       Was I satisfied with my interview.

Technical question:
Do a spiral transversal of a 2D matrix

        Ex:
            a b c d
            l m n e
            k p o f
            j i h g
            
            output: a b c d e f g h i j k l m n o p
            
            Both iterative and recursive approach. 
            Lots of discussion on Complexity. 

Thank you geeksforgeeks for providing the awesome platform for preparation.

If you like GeeksforGeeks and would like to contribute, you can also write an article and mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.


Write your Interview Experience or mail it to contribute@geeksforgeeks.org



My Personal Notes arrow_drop_up


Article Tags :
Practice Tags :


Be the First to upvote.


Please write to us at contribute@geeksforgeeks.org to report any issue with the above content.