![]() |
VOOZH | about |
The online test and the interview process were pretty standard. Around 280 took the online test, and they shortlisted 12 students for the interviews. The interview process was virtual and had 3 rounds:
Round 1:
Count the number of submatrices that can be formed by 1s in a 2d boolean matrix. (Optimized solution of the problem from the online test)
Count the number of islands formed by 1s in a 2d matrix of 0s(water) and 1s(land).
Eg:
[0 0 1] [1 0 0] [1 1 1] #islands=2
Given two strings with some characters and '#' denoting a backspace...check if they both result in the same string after the backspaces are done accordingly(solve with and without extra space)
Eg:
ab#c and acbc## result in the same string “ac”
Given an array of positive and negative integers. You are allowed to jump from an index i to: i+1,i-1, and k in one jump where k is any other index in array where arr[i]==arr[k]. Find the minimum number of jumps needed to reach the end of the array of you start from the first index.
Round 2:
Round 3(Director): Output for a c program based on character pointer and malloc().Explain what happens in each line:
The program was something like this:
Finally, some HR questions and that was it.