Skip to content
Related Articles
Open in App
Not now

Related Articles

Amazon Interview Experience | Set 303 (On-Campus)

Improve Article
Save Article
  • Difficulty Level : Easy
  • Last Updated : 28 Jun, 2021
Improve Article
Save Article

Round 0: (Written): 20 MCQs + 2 Coding Questions

MCQs – Topics: OS ,DS ,DBMS – (Serialization etc.), Aptitude (simple puzzle kind.)
Coding Questions:

DAY 2: (Interview Rounds)

Round 1 (Technical Interview – 45 min approx.)
The Interview started with his introduction , what his department is , what do they do and so on.

  • Given a link list of 0’s and 1’s sort it so that all the 0’s are at beginning and 1’s at the end. It had to be in-place.
    You cannot swap values only pointers.Order of 0’s and 1’s was to be maintained . I had to write production level code for this with all boundary conditions checked!
  • Given an array of 0’s and 1’s again and a variable k , print the size of the smallest window which contains exact k 0’s .
    • discussion about the best optimised approach .
    • I solved it by storing indexes of all 0’s and calculating min diff b/w every k elements.

Round 2 (Technical Interview – 1 hr approx.)
The interviewer asked me to introduce myself and then my projects.

Thanks Geeks ! Result – Selected 🙂

If you like GeeksforGeeks and would like to contribute, you can also write an article and mail your article to 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

My Personal Notes arrow_drop_up
Related Articles

Start Your Coding Journey Now!