Appeared for my virtual onsite interview in last week of March. The position is Seattle Based.

LeetCode 271 - 109 Easy, 137 Medium, 25 Hard.
Less Than 2 Years of Experience .

Interview Experience:
I had 4 onsite rounds which is the usual for any FAANG Company..

The first round was bar raiser , was asked to design a system [not the common ones], the core focus was not on the implementation/logic of the service but on the Scalability. There were followup questions which I answered to the best of my knowledge. This round went good. Approx 10 minutes of LP.

Second round was a class Design around the publisher subscriber model. Again the focus was more on walking through the solution and answering the followup questions. Approx 10 minutes of LP.

Third Round was LeetCode Medium Coding Question around the grounds of BFS. The Interviewer was super enthusiastic and kept giving feedback at every step. Approx 20 minutes of LP.

The last round was another LeetCode Medium question about BSTs. Aced this. The interviewer was really helpful and encouraging. Approx 15 minutes of LP.

Heard within 2 hours from the recruiter that the team wanted to extend an offer which was the BEST PART :)

Prep Materials :
LeetCode.
*** I took the subscription for a month and went through the *** the System Design, *** the Object Oriented Design and *** the Coding Interview.
It comes to preference but I felt these books were far better and up to date than Cracking the Coding Interview.

Helpful Links :

• https://leetcode.com/discuss/interview-question/437082/amazon-behavioral-questions-leadership-principles-lp
• https://leetcode.com/discuss/general-discussion/491522/dynamic-programming-questions-thread
• https://leetcode.com/problems/find-all-anagrams-in-a-string/discuss/92007/sliding-window-algorithm-template-to-solve-all-the-leetcode-substring-search-problem

From my experience I would say rather than overkilling and doing more no of same questions, its better to learn new concepts and do more variety of questions.

Having a handful to good amount of knowledge about the following topics always comes in handy:

• Sliding Window
• Two Pointers
• Back Tracking
• Bottom Up DP
• Union-Find
• Topological Sort
• BFS, DFS and when to use them
• N-ary Tree