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

I had two interviews. One was a technical round, and the other was a technical managerial round. In the technical interview, they asked me to code a program based on linked lists and to reverse a number. They also reviewed my project code and asked

I need to go to the office for an interview. A biometric check and lot of security measures will be done. It was a good interview, a best experience. It wasn't difficult as a 5-year C++ developer. Most of the questions were checking my real-time han