IBM Developer interview questions

1st Round – Online Coding 1. Contiguous elements in an array whose sum is k. 2. Convert sorted array to binary search tree 2nd Round – Telephonic 1. Given an array of characters, find the longest continuous non-repeating sequence of characters. Algo + Code 3rd Round – Technical round 1. Find the mirror image of a binary tree. Algo + Code 2. Given a string, find the largest repetitive sequence. Algo + Code 4th Round – Manager Round Asked dilemma situation. Any process development work, work experience and all.

Online test followed up by Assessment. I was very impressed overall, kind of enjoyed the whole processed. Currently I am on a matching process and have no idea what to expect.