IBM

1st Round – Online Coding * Contiguous elements in an array whose sum is k. * Convert sorted array to binary search tree. 2nd Round – Telephonic * Given an array of characters, find the longest continuous non-repeating sequence of characters

It was good. The interviewer was so friendly and checked fundamental knowledge in your field of expertise. I had both HR and TR in the same round. They were checking the basics.

The interview process consisted of three rounds: * **Round 1:** Online coding test. * **Round 2:** Technical interview. * **Round 3:** Managerial interview. Questions covered Data Structures and Algorithms (DSA), Object-Oriented Programming (