The interview for the technical round usually consists of questions on DSA with some questions on OOPS concept. They also ask questions regarding basic Probability and Statistics. This is then followed by HR round where they ask behaviour questions. This is usually easy to answer with the STAR method.
Interview questions [1]
Question 1
Binary Search Tree and Dynamic Programming questions
Walking into the technical round, I had an unexpected moment of déjà vu when I was asked to find the lowest common ancestor in a binary tree. It was just like the question I had practiced on prachub.com a few days earlier. The interview also included designing an LRU cache and reversing a linked list, which I felt comfortable with too. Overall, the process was smooth, starting with a recruiter screen and a couple of phone interviews. I received an offer, but ultimately decided to decline.
Interview questions [3]
Question 1
Given a binary tree, find the lowest common ancestor of two given nodes
The process consisted 3 technical rounds after clearing the OA , consisted of medium to hard story based question. Not all round interviewer asked to run the code the last 1 just asked the approach
Interview questions [1]
Question 1
Theay asked a graph (bfs) + bianry search question
Was a typical first round recruiter screen - pretty straightforward but didn't end up getting moved vforwards. Prompt, Professional and overall a good experience. They asked me about my background, explained the role and it was with the recruitment team.
Interview questions [1]
Question 1
Describe your background going into detial in each role