Recent asked question in Amazon SDE-2
Summary
I had a 30-45 minute coding round for an SDE-2 position at Amazon's internal team, where I was asked a binary search variation. I successfully solved it and discussed the role, and I'm awaiting my next LLD/HLD and Hiring Manager rounds.
Full Experience
Hi everyone, I had an opportunity with Amazon's internal team, for SDE-2 position, generally there are 2-3 rounds for an Internal job or team change.
The first was the coding round, for about 30-45 mins.
Therefore, I have been asked a variation of binary-search question, initially, i was asumming the greedy approach might work, but it didn't for a certain examples.
So, I went ahead with binary-search, the interviewer was alinged on this, and i was quickly able to solve in under 30 mins.
We had a great discussion for 10 mins, about the role & the work.
I found the only drawback is the on-call rotations.
My next set of interview rounds are LLD/HLD & Hiring manager round.
Stay tuned.
Interview Questions (1)
Minimum Time to Resolve Bugs
You are given:
timeTaken[i]→ time required by personito resolve 1 bugbugs→ total number of bugs- All people work simultaneously
Return:
The minimum time required to resolve at least
bugsbugs.
🧠 Core Intuition
If a person takes t hours per bug,
then in T hours they can resolve:
T / t (integer division)
So total bugs resolved in T hours:
total = Σ (T / timeTaken[i])
We need the smallest T such that:
total >= bugs