The process included a technical interview focused on problem-solving. During the interview, I was given one coding-style question involving a greedy approach on a 2D path (visiting points in sequence and determining the minimum steps/distance). While I didn’t fully implement the solution in code, I clearly explained my approach, including the key insight of minimizing movement.

They will give you one technical question where you need to explain your ideas on how to solve it. You will need to explain on your pseudocode and the algorithm that you will use in the code.