Second round: Technical Interview round-1

The interview started at 12:00 noon on Microsoft Teams and lasted around 43mins, there was one coding question and questions related to oops and dbms.

Coding question:

There are n houses and m roads connecting them, initially a house started burning you need to return the safehouse. Safe house is defined as the house that will not burn at all or the house that burns the last.

I could solve this using dijkstra algo and return the farthest node from the initial house that started burning. The interviewer was happy with the way I have approached the problem and the way I coded it up. He asked me for the time complexity and I have given the answer which is O(n*logm)

Next, what is abstraction and polymorphism?

I have answered the correctly along with a real time example as well.

Then, he asked me if I knew about indexing in dbms?

I didn’t know what it was and mentioned the same, he explained what it was. Basically it is like the contents page of a book at the beginning(similar to a map).

This was the technical round-1.

I’ve been informed that I was called for Technical round-2. Around 35 students were selected for round 2.