Extended shifts to complete the task.
The interview had 3 rounds. Questions on min heaps, binary trees, and graphs were asked along with search algorithms, and they were somewhat on the difficult side. You just need to have an in-depth understanding of how all these things work.
I applied online. The process took 2 days. 2 DSA Questions Given an array which contains only 'b' and 'c' and the array is circular so the last element is adjacent to the first element, want to group all the 'c' present in the array together. In one
Very friendly interview. I had two rounds: DSA and DSA with implementation. You only need to focus on DSA, no matter what programming language you know. I wrote in Java, and your background doesn't matter either.
The interview had 3 rounds. Questions on min heaps, binary trees, and graphs were asked along with search algorithms, and they were somewhat on the difficult side. You just need to have an in-depth understanding of how all these things work.
I applied online. The process took 2 days. 2 DSA Questions Given an array which contains only 'b' and 'c' and the array is circular so the last element is adjacent to the first element, want to group all the 'c' present in the array together. In one
Very friendly interview. I had two rounds: DSA and DSA with implementation. You only need to focus on DSA, no matter what programming language you know. I wrote in Java, and your background doesn't matter either.