Amazon Interview Experience | Set 233 (1 Year Experienced for SDE-1) Last Updated : 02 Jul, 2019 Improve Improve Like Article Like Save Share Report I recently had interviews with Amazon.com, Bangalore. Here’s my interview experienceCoding round (1 hour): 1. Find minimum number of coins that make a given value Given a value V, if we want to make change for V cents, and we have infinite supply of each of C = { C1, C2, .. , Cm} valued coins, what is the minimum number of coins to make the change? 2. Suppose you have given two strings S1 and S2. Find out if S1 is substring of S2. If S1 is present in S2 return starting index of S1 in S2 and if not present return -1. 3. Overlapping rectangles Face to Face Round 1 (Technical ~ 1 hour) 1. Given a linked list, reverse alternate nodes>a-singly-linked-list/ 2. Valid Substring Face to Face Round 2 (Technical ~ 1 hour) 1. Special Stack 2. Bottom View of Binary Tree 3. Subset Sum Problem >partition-problem/ Telephonic Round 3 (Hiring Manager ~ 45 minutes) 1. Tell me about yourself. 2. Why do you want to change your current company? Why Amazon? 3. Find a pair with given target in BST Telephonic Round 4 (Bar raiser ~ 1.30 hour) 1. He gave a brief description about him. 2. Tell me about yourself. 3. Why do you want to change your current company? Why Amazon? 4. How Have You Gone Above and Beyond in Your Work? 5.Tell me about your current Projects. What is your role? 6. Some basic OS concepts 7. Then he gave a C code snippet and asked me what this piece of code does? What the problems that you see in this code? Fix the bug in the code. 8. Write your own function to take string as input from user. For each question I was asked to write production level code. I had to wait for 2 days for the results. I got selected. Thank you geeksforgeeks !! All Practice Problems for Amazon ! Like Article Suggest improvement Previous Amazon Interview Experience | Set 275 ( Off-Campus SDE-I Experienced) Next Mirror of n-ary Tree Share your thoughts in the comments Add Your Comment Please Login to comment...