I applied through university. I interviewed at Bit Canny
Interview
The interview was conducted through the google meet platform. There were three interviewers. Firstly I was asked to give a brief introduction of myself. Then they moved on and asked me questions on Java. The questions were on overloading, overriding, OOPS concept, and some fundamental Java output for the code given was asked. Beyond that, they asked me some data structures and algorithms questions specifically on linked lists, stacks, and binary trees. I was asked to tell the difference between merge and quicksort and the questions about bubble sort and it can be optimized. This was mainly what the interview was about and it was a short one of about 30minutes.
Interview questions [1]
Question 1
reverse a Linked List.
delete and insert in a linked list.
insertion in a balanced binary tree.
Java overloading and overriding
OOPS in java
Output for code
Loops
Quick Sort
Merge sort
bubble sort
binary search