IBM

Two Leetcode problems were presented without any rest in the middle. The interview lasted around an hour. Both questions were about binary trees. One was about tree traversal, and the other was about getting tree depth.

In 2010, IBM India planned to hire about 10,000 new recruits (freshers and experienced personnel). Therefore, it was relatively easier (I strongly stress 'relatively') to get hired. The recruitment process involved several stages: * A 1-hour apti

They gave me a set of OOP questions to assess my understanding of core principles like inheritance, polymorphism, abstraction, and encapsulation. I answered them thoroughly, discussed real-world applications, explained code snippets, and clarified l