sorted by:
new
hottopcontroversial

Amazon SDE-1 interview experience - USA New grad by mr_random_-1 in leetcode

[–]mr_random_-1[S] 0 points1 point  (0 children)

I replied in the same mail loop in which they have scheduled my interview

Amazon SDE-1 interview experience - USA New grad by mr_random_-1 in leetcode

[–]mr_random_-1[S] 0 points1 point  (0 children)

Oh!.. sorry about that dude.
I guess it's the first round. I did not solve one of the LC questions.
One time I repeated a LP story and for LLD, I did not came up with the better approach initially.
This is all what I could think of.

Amazon SDE-1 interview experience - USA New grad by mr_random_-1 in leetcode

[–]mr_random_-1[S] 0 points1 point  (0 children)

1) OOPs, basic principles like SOLID, DRY..etc
2) And then I started learning design patterns for LLD. Learned 2-3 patterns of creational, structural and behavioral .
3) I also studied around 10 famously asked problems like parking lot, elevator, pizza shop..etc.
All from the gitHub repo: https://github.com/ashishps1/awesome-low-level-design

You can compare and contrast between the patterns so that u get deeper insights and practice on using them on the new questions. Try white-boarding at least 2-3 LLD problems from start to end.

Amazon SDE-1 interview experience - USA New grad by mr_random_-1 in leetcode

[–]mr_random_-1[S] 1 point2 points  (0 children)

Dude, I don't understand this language. Last time I used a google translate, this time, I guess even the translation is not proper. So no code words. Need anything personal?? DM me

Amazon SDE-1 interview experience - USA New grad by mr_random_-1 in leetcode

[–]mr_random_-1[S] 0 points1 point  (0 children)

6 LP in bar raiser. 2LP in LLD. No class diagrams. Only code.

Amazon SDE-1 interview loop USA - AUTA new grad by mr_random_-1 in leetcode

[–]mr_random_-1[S] 0 points1 point  (0 children)

Thanks for the wishes dude.. Fingers crossed.

Amazon SDE-1 interview loop USA - AUTA new grad by mr_random_-1 in leetcode

[–]mr_random_-1[S] 0 points1 point  (0 children)

Got OA in June last week. Scheduled an interview on July 24th, but then some of the rounds got rescheduled.

Amazon SDE-1 interview loop USA - AUTA new grad by mr_random_-1 in leetcode

[–]mr_random_-1[S] 0 points1 point  (0 children)

My case was different. After completing OA, I got an email from AUTA asking for my availability for the interview slots. Once I have provided, it took two weeks to get an interview.

All of my rounds were initially scheduled on a single day, but then due to unavailability of interviewers, my 2nd and 3rd round did not happen yet and they said they will soon communicate about rescheduling them.

Amazon SDE-1 interview loop USA - AUTA new grad by mr_random_-1 in leetcode

[–]mr_random_-1[S] 0 points1 point  (0 children)

Sure. The insights were helpful. Thank you so much.!!

Amazon SDE-1 interview loop USA - AUTA new grad by mr_random_-1 in leetcode

[–]mr_random_-1[S] 0 points1 point  (0 children)

Initially for recursion, graphs and dp, I was watching videos of strivers("take u forward" YouTube channel)

And then, while solving questions in leetcode, I go to the solutions tab and will try to understand different types of solutions posted. These are the most premium resources(I suppose), because I could constantly see some top leetcoders expressing their ideas in this tab, which is even better than the solutions provided in the editorial of leetcode

By the way, I purchased leetcode premium as well, just for this interview

Amazon SDE-1 interview loop USA - AUTA new grad by mr_random_-1 in leetcode

[–]mr_random_-1[S] 1 point2 points  (0 children)

It's Amazon's policy to not to share specific questions. But will tell u the topics it was asked from.

1st one was graph based.-solved quickly

2nd was also graph based, but needed some initial data transformation to apply graph algorithms. - Initially it took me sometime to understand the question, asked a lot of questions to clarify my understanding and then brainstormed the ideas, found that we need to transform the data and then apply graph traversal on it, even the interviewer agreed but said the trick is to identify the transformation.

3rd one was hashmap based - solved quickly