The interview was just one round. It started with intense discussion on previous work experience, including adding new scenarios for verification. Then was asked application of fork join any and in the end gave a lc question on binary tree
It was specifically for Mellanox oriented role, which required extensive RDMA experience. They asked about background, told me specifically about the work, and wanted someone who have MPI and RDMA background.
Interview questions [1]
Question 1
Some basic chat, and a small string concatenation in C without any inbuilt functions. To have a clear understanding of pointers.
The interview was a great experience. The interviewer asked technical and problem-solving questions, testing my algorithmic thinking. One of the questions involved an array with missing numbers, which required an efficient solution. Overall, it was a challenging but insightful interview.
Interview questions [1]
Question 1
The question was about an array of size n that originally contained all numbers from 1 to n, but some numbers were missing. The task was to find the missing numbers efficiently, using minimal time and space complexity.