Until now, it is good.
Night shifts, particularly on some domains.
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 technical interview, which was over the phone, to test my technical abilities – mostly Notes. Then, I had an HR interview to discuss my package and check my personality.
The interview went smoothly. The employees took great care of the candidates attending. The interview started at the given time and they also provided candidates with lunch. Overall, the interview experience was really good. They had only one round o
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 technical interview, which was over the phone, to test my technical abilities – mostly Notes. Then, I had an HR interview to discuss my package and check my personality.
The interview went smoothly. The employees took great care of the candidates attending. The interview started at the given time and they also provided candidates with lunch. Overall, the interview experience was really good. They had only one round o