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

The interview process seemed random. They conducted two HR rounds for some candidates, two technical rounds for others, and one technical and one HR round for yet others. However, the interview itself was easy. They asked me about AWS, Docker, and tw

First, the HR will call us and schedule an interview. The first round was a telephonic interview. It was a half-hour telephonic video call interview through Webex, in which a minimum of two people would be joining.