Round 1 (1 hour):
DSA Round: Asked 2 questions, should be able to write optimal running code.

1. Maximum sum such that no two elements are adjacent, and here we need to print the subarray too.
2. Square root of a number - Solve in logN time.

Round 2:(1 hour)
DSA Round: Asked one coding question.
No. of islands - Standard DFS/BFS problem.
Follow up, Find distinct islands too.

Could not give my best because this was my first interview after years.
Interviewers were relly helpful, they push you to find solutions.