There were total 5 round:

First Round : Both problems were easy one was bfs.(Don't remember exact problem)

Second Round :

1. Given a graph find minimum distance from source to destination with edge length 1 (normal bfs will work)
2. modifed version of 1st problem some vertices are infected .Need to reach destination with shortest path using minimum number of infected vertices.(not able to solve properly. thought of dijikstra but didn't got idea how to ensure minimum infected vertices)
   and few Behavioral questions

Third Round :
Mostly Behavioral questions
one easy coding problem. find All pairs with sum as target
merge sort vs quick sort

Fourth Round :
This round was Bit hard
Largest BST subtree (available in LC home page)
Didn't see this Question before . but was able to Solve this question During interview

Second problem: Some vague problem related to dfs.
Have solved similar problem but Struggled to solve(Was missing one hint)

Fifth Round:
Again DFS problem
suggest Random song from a list of song

was able to solve both problem

Feedback Got : DSA not upto Mark :(

In first and Third Round I should have perform better.

Will try once Again After 6 months