Coding Round :

Q1 Merge 3 Sorted Arrays
Q2 Binary Tree Right Side View -- No variant
Interviewer was very nice and asked me to explain code asked me how i would test etc.

AI Round:

Given list of words , you have to find a subset which uses as many characters as possible but never use the same letter twice
Hint: DFS
Interviewer was not helpful in this round and suggested to go to the tests directly. It was all about passing the unit tests. Took sometime to figure out the first 2. Could not implement the solve method to solve the problem . Was going in the wrong direction but asked interviewer if i could use dfs he said it would work for the 3rd unit test not 4th, but was too late to recognize that.

System Design:
Design Instagram
Posts,Image and Friends . Interviewer asked about consistent hashing. How would high reads work for Feed Service: Fan out etc

Behavioral
Conflict with coworker, negative feedback form manager etc, priorities, ambiguous requirement

AI Round was a negative for me