Open In App

Amazon Interview Experience | ( 6 Months Intern for SDE-1 )

Last Updated : 12 Mar, 2024
Improve
Improve
Like Article
Like
Save
Share
Report

Amazon had visited our campus in August for hiring 6 months intern for final year and summer interns for pre final year (SDE-1). The drive comprised of one online round and maximum two F2F interviews  

Round 1 (online):

The online round consisted of 2 coding problems and around 20 MCQ’s Problem 1 : 

Reach a given score

In the above mentioned link they have considered that order does matter but in the online round they had specified that order does not matter . Problem 2 : 

Length of the smallest sub-string consisting of maximum distinct characters

31 students were shortlisted for further rounds.

Advice : The problems that are asked in online round are not that tough, anyone with little bit of practice can clear it with ease . So keep practicing πŸ˜€ 

Round 2 ( F2F-1….100 mins ) :

The interviewer was cool and he made sure that I was comfortable and then he started. He just had a look on my Resume and then started giving me problems

Problem 1:

Given M and N.Calculate the number of ways to form M digit number such that value at any digit can be at most N and value at current digit is at least twice the value at previous digit(The condition should be satisfied at every digit index, for example if M=3 and N=9 then 136 is a valid number and 135 is invalid) He said that N can be anything and the final number can contain more than M digits if you are thinking in decimal number system.Basically he wanted to say that don’t restrict yourself to decimal number system consider a ideal number system with maximum digit value N. Hint-Dynamic Programming.  

Problem 2:

Given a number N (1<=N<=10^5) . Find out if N can be expressed in terms of a1^n1 + a2^n2 + a3^n3 + ……. +ak^nk ( a1, a2, a3…ak are bases and are >1 and n1, n2, n3…..nk are exponents and are >0) if yes count such sequences Hint – precompute all the powers and then apply dynamic programming  

Problem 3 :

Given N points in 1-D plane (x -axis) with their co-ordinates and M boxes.Place M boxes (every box should be placed on one of the N points ) in such a way that the minimum distance out of distances of every pair of adjacent boxes get maximized ( i.e make minimum distance as large as possible )

Hint-Binary search on answer   I was able to solve all the above 3 problems but i found them very difficult . It took quite a bit of time and scratching of head to solve them. Interviewer was always supporting and he was motivating me to solve problem and he kept on giving me hints through out the interview. Advice- Be confident and take your time and keep on telling interviewer about what you are thinking and what your thought process is .He is more keen to see your thought process rather than your final solution.  

Round 3(F2F-2 ….. 50-60 mins):

The interviewer was very chill .He just told me to assume as if I am giving an interview to one of my close friend.Then he started the interview   Problem 1 : 

https://www.geeksforgeeks.org/shuffle-a-given-array/

Problem 2 : 

Find next greater number with same set of digits

Problem 3 : 

Wildcard Pattern Matching

  Then he shifted his focus towards computer science fundamentals . He asked me to explain normalization in DBMS and all the normal forms also. After this he asked me to explain how and why hashing is done ( a small discussion on it ) then he asked me about Map and some STL function on about how they are implemented in c++  i.e internal working and a little code explanation of them   In this round the interviewer was more sort of interested in my approach not the solution and he didn’t expected me to solve all the problems just was motivating me to approach nicely.

Round 3 over .

Now comes the best part . I was given SLI  ( 6 months intern )at Amazon India and my happiness was sky high.

Final Advice –

Practice makes a man perfect.Keep on practicing and your hard work will always be rewarded.You just have to be patient and confident.          


Previous Article
Next Article

Similar Reads

Amazon Interview Experience | 6 Months Intern for SDE-1 (On-Campus )
Round 1(online) : Consisted of 5 sections: 1) 10 debugging questions 2) 2 coding ques :- i) https://www.geeksforgeeks.org/search-in-row-wise-and-column-wise-sorted-matrix/ ii) https://www.geeksforgeeks.org/check-if-a-binary-tree-is-subtree-of-another-binary-tree/ 3) Personality questions 4) Logical Reasoning questions Round 2(Technical 1) - remotel
3 min read
Amazon Interview Experience | 6-Months Intern for SDE-1 (On-Campus)
Round 1: Online Test, it was the first round with 4 sections. Code Debugging test 2 coding questions(70 min) Given an array A[] and a number x, check for pair in A[] with sum as x Clone a linked list with next and random pointer Personality Questions Logical Reasoning Something which I observed and pointed out in round one was, the solution must be
3 min read
Amazon Interview Experience for SDE-1 | 6-Months Intern (On-Campus)
Round 1: An online assessment that consisted of four parts: Code Debugging: 7 questions to be debugged in 20 minutes. (easy-medium)Coding Test: 2 coding questions to be solved in 70 minutes. (medium)Workstyles assessment: 20minutesReasoning ability: 35 minutes (easy-medium) 38 members were shortlisted for the interviews. Round 2: It was a technical
2 min read
Amazon Interview Experience | 6-Months Intern for SDE
The process consisted of an online round and a maximum of two face-to-face technical rounds. I applied through amazon.jobs so it was an off-campus drive for me. Online Round :Β  This round had 30 questions (28 MCQs + 2 Coding questions) in total and 90 minutes to complete the test. The test is monitored through webcam and microphone. The MCQs were m
3 min read
OYO Interview Experience for 6 months SDE-Intern
Online Round : There was a total of 3 questions, and the time given was 90 minutes. Find Excel column name from a given column numberShortest distance between two cells in a matrix or gridMaximum NumberI was able to solve all of the questions. **Selected** for interview. Technical interview First, he asked me to introduce myself, after that he dire
1 min read
Amazon Interview Experience for 6 months Intern (On-Campus)
Amazon conducted 3 rounds. Round 1: An online assessment that consisted of 4 sections. Code Debug(20 mins): It consisted of 6 questions. (Cakewalk)Work Style assessment(25 mins): Questions based on Amazon leadership principlesCoding(70 mins): 2 coding questionsCount unique pairs in an array that sum to a given target: https://www.geeksforgeeks.org/
3 min read
Amazon Interview Experience for 6-Months Intern (On-Campus)
Amazon visited our campus(Tier-3) in October and asked us to apply for a job (They provide a Link for the portal). There's no resume screening for the OA round Round 1: Online Assessment on Amcat (4 - sections) Debugging RoundCoding Round https://leetcode.com/problems/critical-connections-in-a-network/https://leetcode.com/problems/search-a-2d-matri
1 min read
Amazon Interview Experience | Set 167 (SDE I for 1 year 6 months experience)
Round1: Online Coding Round There were 4 coding question. Was asked to answer 2 out of 4. 1) Given a list of N coins, their values (V1, V2, … , VN), and the total sum S. Find the minimum number of coins the sum of which is S (we can use as many coins of one type as we want), or report that it’s not possible to select coins in such a way that they s
3 min read
Amazon Interview Experience | 6-months SDE Internship (2020)
On 14th December 2019, I appeared for an interview at B.M.S. College of Engineering for a 6-month Software Development Engineering Internship Role. I had applied through the amazon career site and got shortlisted for online assessment in the mettl platform. Online Round: In this round they've asked 2 coding questions and 28 MCQs of computer science
1 min read
Amazon Interview Experience for SDE-1 FTE/6 Months Internship – AmazeWow
Online Coding Test: The test consisted of 28 MCQs primarily focused on C/C++ outputs, data structures, OOPS Concepts.2 coding questions were also asked. Find mean, median, mode.An array consisted of a number of chocolates each child had, we need to find a number of steps in which all children can have the same chocolates such that one can pass its
3 min read