The first stage includes two interviews: a code interview and a research interview.
The code interview was supposed to include code questions. However, the interviewers dedicated most of the time to asking about previous experiences, leaving only 10 minutes at the end to solve the lowest common ancestor problem in binary trees. This is hardly enough time to solve that kind of question.
Given a binary tree and two nodes in the tree, write an algorithm that finds the nodes' lowest common ancestor in the tree.
The following metrics were computed from 1 interview experience for the IBM AI Researcher role in Israel.
IBM's interview process for their AI Researcher roles in Israel is extremely selective, failing the vast majority of engineers.
Candidates reported having very negative feelings for IBM's AI Researcher interview process in Israel.