One coding round with three questions. Two are easy. The third one is complicated and related to binary trees. Another question is related to disk space allocation. They are a bit complicated but easy to solve.
In the first round, we were asked to write code for a stack in C++. After that, for the shortlisted candidates from the first round, a second round was conducted. Questions were asked about designing software, specifically High-Level Design (HLD) a
It was tough. I was asked data structure and algorithms questions about trees. There were a total of two rounds. The question was from LeetCode. I was not selected, even after my interview went well.
One coding round with three questions. Two are easy. The third one is complicated and related to binary trees. Another question is related to disk space allocation. They are a bit complicated but easy to solve.
In the first round, we were asked to write code for a stack in C++. After that, for the shortlisted candidates from the first round, a second round was conducted. Questions were asked about designing software, specifically High-Level Design (HLD) a
It was tough. I was asked data structure and algorithms questions about trees. There were a total of two rounds. The question was from LeetCode. I was not selected, even after my interview went well.