Round 1:
You have an array with only 0 and 1. Return any maximum sub array where number od 0 matches number of 1.

Round 2:
https://leetcode.com/problems/keys-and-rooms/ with follow ups

Round 3:
Don't remember the exact task, but it was something like: you're getting stream of tasks, write code to execute those tasks:

1. no sooner than X seconds between them (first version)
2. no more than 3 times within X seconds (follow up)

Round 4:
Behaviorual

Notes:
This was remote onsite so interviewers were from different branches (Europe and US). Some of them didn't talk at all. I'm pretty sure the first interviewer had another task.