Round 1
In the screening round of the interview process, candidates are required to complete an online test consisting of two coding problems. The first problem was “K Closest Points to Origin,” which involves finding the K points closest to the origin in a given set of points. The second problem was “Edit Distance,” where candidates are expected to calculate the minimum number of operations required to transform one string into another.
Round 2
For the second round, candidates who successfully pass the screening round will move on to a face-to-face interview. This round focuses on coding skills and problem-solving abilities. The interviewee is given one hour to write the optimal working code for three problems. The problems I was asked were “Largest Plus Sign in a Binary Matrix” of size n * m, “Design a Least Frequently Used Cache” requiring an optimal cache design solution, and an unspecified third problem.
In this round, candidates are expected to demonstrate their coding proficiency and problem-solving approach. The choice of programming language is left to the interviewee.
I was not shortlisted for further rounds