Hybrid Working Environment
Flexible hours
Increment / Hike issues.
Team politics.
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
It was recorded and contained about 5 questions. Each question was approximately 4 minutes long, with 1 minute allotted to hear the question and 3 minutes provided to answer it.
I applied through a recruiter, and the process took two weeks. I interviewed at IBM. A recruiter visited my university to conduct interviews. He seemed primarily interested in my overall skills, including soft skills. I shared my portfolio of work a
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
It was recorded and contained about 5 questions. Each question was approximately 4 minutes long, with 1 minute allotted to hear the question and 3 minutes provided to answer it.
I applied through a recruiter, and the process took two weeks. I interviewed at IBM. A recruiter visited my university to conduct interviews. He seemed primarily interested in my overall skills, including soft skills. I shared my portfolio of work a