IBM

There were 2-3 rounds. The first round was regarding coding. The second round was one-to-one. In the coding round, we had to pass a minimum number of test cases, and it consisted of two coding questions.

I had two rounds of interviews. The first was more of a technical round. I was asked four DSA questions and a few other technical questions. The second round was more of a technical-HR round. I was asked about my projects, approach, and implementat

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