Round 1(OA):
Time 1Hr 30 Mins
Unfortunately I forgot the exact questions
3 questions 2 LC Med(DP), 1 LC easy (array)
Note - Platform interface was poor and unfriendly, had to write lots of boiler plate code to take input from user as well.

Round 2(Coding):

Max Subset sum of a subtree in a given BT.
Follow up - Maximum subset sum with min nodes in subtree

Round 3(Coding):

Find Min in a stream of Number in O(1) time.
Try to use as less space as possible.

Round 4 (Design | HM):

LP questions
Design Rate Limiter (Distrubeted RL, Algorithm of RL, LLD for DB selection schema, scalability, Fault tolerance, etc)