The interview process was smooth. It had questions related to arrays and linked lists in the first round. The question level was medium-hard. The second round was on recursion and dp.
Interview questions [1]
Question 1
Given an integer array nums, return all the triplets [nums[i], nums[j], nums[k]] such that:
• i != j, i != k, and j != k
• nums[i] + nums[j] + nums[k] == 0
Notice that the solution set must not contain duplicate triplets.
Interviewed for silicon team. Have only been asked about the domain specific knowledge in 1st round and system design in 2nd round and C coding in 3rd round.
The interviews were 50 mins each.
First round with hr screening - 2 leetcode questions then hr manager screening then the loop which consists of 4 interviews each an hour long. The 4 interview questions they asked where three medium leetcode questions. And one system design interview question about how to shadow deploy a test software to millions of users.
Recruiter reaches out after applying through Amazon careers, no referral. Had an initial OA, then after a month had four rounds in two days - three coding one system design. Each round had 30 min behavioral and 30 min coding.
Interview questions [1]
Question 1
Questions were mainly hashmap, sliding window and interval related.