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.
Questions d'entretien [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.
That moment when the interviewer asked about finding indices in an array for a target sum was wild — I had just tackled something identical while prepping on PracHub. The interview included a technical round with another question about designing an in-memory LRU cache and a behavioral question about meeting tight deadlines. After a smooth discussion, I was told I'd received an offer, which I happily accepted. Overall, the process felt pretty straightforward and not overly challenging.
Questions d'entretien [3]
Question 1
Given an array of integers return the indices of two numbers summing to a target
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.