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

This is not an interview but an online assessment. The assessment took place in HackerRank with two coding questions, which ranged from easy to medium. All test cases passed for the first question, and 9 out of 15 for the second question. This is the

The interview process was easy. It consisted of an aptitude test, an interview, and a group discussion. The interview questions were very easy, lasting only about 30 minutes. During the group discussion, everyone was given a chance to speak. The essa