Round 1:
The interview started with introductions, followed by a discussion about my current project. He then asked me a question:

"You are given a weighted directed graph, a source, and a destination. You also have a set of edges, out of which you can add at most one edge to the graph. Find the minimum possible distance from the source to the destination."

The expected time and space complexity was E * log V.

I was able to solve this question with the help of a hint from the interviewer. Since we were out of time, he asked me not to code the solution.

He then asked me about the advantages of cache. After I explained that cache is used for faster retrieval, he followed up with another question:

"Assume we have infinite cost. Why can't we just replace a database with a cache?"

I was not able to answer this question.

Round 2:
The interview started with introductions, followed by a discussion about my current project. After that, he directly moved on to designing an LLD for a movie ticketing system (similar to BookMyShow).

Since we spent too much time discussing the project, I wasn’t able to complete the LLD. Overall, I also felt that I could have performed better on the LLD question.

Status: Rejected