Amazon SDE2 Interview and Compensation
Summary
I went through three rounds of interviews (OA, DSA, LLD, HLD, Bar Raiser) at Amazon's Hyderabad office and received an overall hire verdict.
Full Experience
OA: 90 mins for two questions. Given: populationOFCity: [5,6,1,4,3] String: "01110" arr.length = string.length string[i] == '0' indicates the city i with populationOFCity[i] is protected.
At max you can move any protection to left by one. Return the max protection can be achieved by this.
Question2: You are given a subsequence : 324 two integers x: 3 y: 4
Every time you can take unit digits of either x or y and add it to the string. You need to find the lexicographically minimum string, having the config as a subsequence of the resultant string.
Result: "3692604" add x % 10 resultantString: "3" add x % 10 resultantString: "36" add x % 10 resultantString: "369" add y % 10 resultantString: "3692" add y % 10 resultantString: "36926" add y % 10 resultantString: "369260" add y % 10 resultantString: "3692604"
Lot of work simulation scenarios, 15 mins, Given a situation, which one you will prefer. You need to generate thumbnails, which DB you would choose, 5 options will be given, you need to choose on a scale of 1-5 how likely this option will be suitable for this request.
New section with questions regarding which option do you choose out of given options like, do you enjoy solving complex problems delivering project on time finding issues that no one choose providing long term implications of decisions taken.
Next rapid fire round kind of scenatio, you will be given two options, you need to choose which one describes you more out of these two. More like above round, but here you have to choose your personality out of two provided, sometimes both seems right sometimes both seems wrong for you, yet you need to choose one.
Cleared this round, In person 3 rounds of interviews with Amazon in Hyd office. ( because of interview panel availability, only two rounds were taken on that day, HLD and DSA) Next Rounds DSA - Multiple LP questions Given list of numbers, you have choose numbers in such a way that if you choose x, you cannot choose x+1 or x-1, when you choose x, your score will be increased by value of that number * frequency of the number Tell me a time when you have conflict with your peer and how did you handle this. Tell me when you did not get enough support, how did you solve the incident.
Verdict: mixed Strong incline
LLD: Design backup system with three different backup types (full, diff, log)
HLD. - Deep discussion on my projects. Why did you leave microsoft. lot of behavioral questions. What is the best time to learn about the project Design a sale platform to sell exact K number of items, no overselling, consistent, available low latency. Bar raiser round: Tell me a time when you made customer happy. Tell me a time when you need have analysed tradeoffs and took a decision couple more LP questions One graph DFS with DP question. expected to solve the answer with optimal solution, have written it in 30 mins and explained all corner cases Follow up questions.
Overall Verdict: Hire
Compensation: Base : 46 1st Year bonus: 18 LPA 2nd year bonus: 12 LPA Stocks : 200 RSU vested over 4 years ( 5%, 15%, 40%, 40%)
Overall first year CTC: 64 LPA.
Interview Questions (5)
Maximum Protection with Limited Moves
Given an array populationOFCity = [5,6,1,4,3] and a string "01110" of the same length where string[i] == '0' indicates that city i is protected. You may move any protection to the left by one position at most. Return the maximum total protection that can be achieved.
Lexicographically Minimum String from Subsequence and Digits
You are given a subsequence 324 and two integers x = 3 and y = 4. Repeatedly you may take the unit digit of either x or y and append it to a result string. Find the lexicographically minimum string that contains the given subsequence as a subsequence of the final string.
Example construction returned by the candidate:
add x % 10 -> "3"
add x % 10 -> "36"
add x % 10 -> "369"
add y % 10 -> "3692"
add y % 10 -> "36926"
add y % 10 -> "369260"
add y % 10 -> "3692604"
Max Score Selecting Numbers with Adjacent Restrictions
Given a list of numbers, you must select numbers such that if you select a value x, you cannot select x+1 or x-1. Selecting x adds value_of_x * frequency_of_x to your total score. Compute the maximum achievable score.
Design Backup System with Multiple Backup Types
Design a backup system that supports three different backup types: full backup, differential backup, and log backup. Explain the architecture, data flow, and how each backup type is managed.
Design High‑Throughput Sale Platform
Design a sale platform that must sell exactly K items without overselling. The system should be consistent, highly available, and operate with low latency under heavy traffic.