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 a screener with a recruiter, another one with the HR manager, and finally a panel interview. It was a good experience. Most likely ghosted. I could have done better. Time to study more.

The process includes two coding rounds followed by an HR interview. These rounds consist of: * Two programming questions * Two database query questions The HR interview includes questions related to your projects, some technical questions, and some