He cleared every DSA round at Amazon. Rejected anyway. Reason: designโ€ฆ โ€” Software Engineers โค๏ธ๐Ÿ™ƒ โ€” TG.ME

He cleared every DSA round at Amazon.
Rejected anyway. Reason: design depth.

He walked me through the whole loop yesterday on a 1:1 call.
Here is how it actually went, in order.

He prepped the right way, for what it is worth. Read every 2026 Amazon writeup he could find. Took notes on patterns instead of grinding random problems.
Asked for every round on a different day so he got a fresh head each time.

Then the schedule landed.

ROUND 1, BAR RAISER:

- Every writeup he had read put the Bar Raiser at the end.
- His was first.
- And it was LLD. The one area he was weakest in.

The question was a real problem their team was working on.
Audio buffers moving across processing stages at a fixed frame rate.

- He did not understand it for the first ten minutes.
- Took hints. Got into a good discussion.
- Drifted into the HLD of the thing.
- Then looked up with ten minutes left and nothing on the screen.

Nothing.

ROUND 2, DSA:

- File system storage cache.
- He spotted it fast. Storage is not the problem. Eviction is.
- LRU. Doubly linked list plus hash map. O(1) get and put.

Mid coding the interviewer asked him:
when you move a node, do you delete and recreate it, or just reposition it?

- He second guessed himself. Said delete and recreate. Then talked himself back.

Then she changed the requirement. Store file content, not paths.
Time ran out before he finished.

ROUND 3, HIRING MANAGER, HLD:

- Spotify wants to use Alexa to notify users about a new feature.
- He built the happy path first, on purpose. Right call.
The interviewer spent the rest of the round on failure cases.
Mostly one: what happens when the device is offline.

ROUND 4, DSA:

Course dependencies.
Prerequisites. At most K courses a semester.
Priority by the deepest chain of work hanging off each course.
Find the minimum number of semesters.

DFS for depth. Max heap to prioritise. Topological sort to process.
He checked alignment three times. She confirmed every time.
Coded it fully. She said she liked his thinking.

Then he went home and worked out that his greedy was probably wrong.
What matters could be the whole descendant set, not just the deepest chain.

Nobody in the room caught it.
He caught it four hours late.

Three days of silence. Then the rejection call.
He called it shattering.

Here is my read.

He lost this loop in the first hour, not the last.
Bar Raiser first. Weakest format. A problem he could not parse for ten minutes.
Everything after that was him climbing out of a hole.

And strong DSA does not fill a design hole.
There is no exchange rate between those two rounds.

If your loop opens with the round you dread, that was the round you had to prepare hardest.

๐—ž๐—ฒ๐—ฒ๐—ฝ๐—ถ๐—ป๐—ด ๐˜๐—ต๐—ถ๐˜€ ๐—ถ๐—ป ๐—บ๐—ถ๐—ป๐—ฑ, ๐—œ ๐˜„๐—ฒ๐—ป๐˜ ๐—ฑ๐—ฒ๐—ฒ๐—ฝ ๐—ฎ๐—ป๐—ฑ ๐—ฑ๐—ผ๐—ฐ๐˜‚๐—บ๐—ฒ๐—ป๐˜๐—ฒ๐—ฑ ๐—ฒ๐˜ƒ๐—ฒ๐—ฟ๐˜†๐˜๐—ต๐—ถ๐—ป๐—ด ๐—ถ๐—ป๐˜๐—ผ ๐—ฎ ๐—๐—ฎ๐˜ƒ๐—ฎ ๐—•๐—ฎ๐—ฐ๐—ธ๐—ฒ๐—ป๐—ฑ ๐——๐—ฒ๐˜ƒ๐—ฒ๐—น๐—ผ๐—ฝ๐—ฒ๐—ฟ ๐—š๐˜‚๐—ถ๐—ฑ๐—ฒ.

๐—š๐—ฒ๐˜ ๐˜๐—ต๐—ฒ ๐—š๐˜‚๐—ถ๐—ฑ๐—ฒ ๐—ต๐—ฒ๐—ฟ๐—ฒ: https://lnkd.in/dTvYVutD
Use SDE30 to get 30% off.

Stay Hungry, Stay FoolisH!
โค2
August 30, 2026 616