Open In App
Related Articles

Amazon Interview Experience | Set 407 (Internship)

Improve Article
Save Article
Like Article

This was a pool campus conducted by amazon for internship .based on the internship performance students will be give pre-placement offers or pre-placement interview.

Online round: online round was conducted at respective colleges in batches…there  were 20 technical mcq’s on DBMS, OS, CN,C, OOPS,DS,input/output questions, mostly from geeksquiz and 2 coding questions which were considerably easy.time given – 1 hr 30 minutes.

  1. Given a point  (x,y) which is position of a friends house on a coordinate plane. and  a person starts from(0,0),and can move only on x-axis. each time he moves double the steps from previous step and in opposite direction.he starts by taking 1 step in positive x axis.  each step he takes 1 second. given a time n. we have to find the distance between his friends house and his position after n seconds.
  2. Given a string and an integer m that denotes number of changes that can be made on the given string.we have to find maximum length of a sub string that can be formed by doing m number of changes such that all alphabets in the substring are same.
    Solution: GeeksforGeeks Link

Online was conducted on hackerearth platform. MCQs had negative marking +1 and -0.25. there was no detection of points for wrong submission in coding questions.

From my college 13, students were selected for 2nd round, and in total 70 students from my city.they did not reveal any cut off criteria but student who solved atleast 1 coding question completely and atleast 8 to 10 (just an assumption) mcq’s correctly were selected for next round.

Round 1: This was face to face technical interview coducted for all the colleges together. they gave 2 questions and we were asked to write the entire working code and to optimize the solution, the interviewers were friendly and helped us if we got stuck anywhere.after this round 30 students were selected for next round out of 70.

  1. Convert a tree into it’s mirror tree
  2. Print a binary tree in vertical order

this round took around 1 hr 15 min.

Round 2 : This round was also a face to face technical interview.the interviewer asked me to introduce myself while he was entering some details in his lappy.then he asked me who took my 1st round. i din knew the name of my 1st round interviewer.he was smiling and said “relax, i was just casually asking”. i was given 2 coding question. for the 1st question he just asked to explain the approach and optimize it and for the 2nd question he asked to write the entire working code and explain it.this round took around 45 min.

  1. Given an array we have to find the median of the array when it is sorted but we should not sort it.
  2. Find Maximum possible stolen value from houses.

Round 3: This round was conducted only for those students for whom they were doubtful. fortunately i was selected in 2nd round itself.

Interviewers were friendly. They helped us giving hints wherever we got stuck.

My advice is be confident. don’t give up, if you are stuck anywhere. Tell them atleast a brute force approach and they will give you hints to optimize it. Don’t be scared, practice questions from geeksforgeeks, almost all of them were asked from geeksforgeeks collection.

Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.

Whether you're preparing for your first job interview or aiming to upskill in this ever-evolving tech landscape, GeeksforGeeks Courses are your key to success. We provide top-quality content at affordable prices, all geared towards accelerating your growth in a time-bound manner. Join the millions we've already empowered, and we're here to do the same for you. Don't miss out - check it out now!

Last Updated : 12 Jul, 2019
Like Article
Save Article
Similar Reads