I applied through college or university. The process took 3 weeks.

There were 4 rounds of interview:

• 1st round: Asked 2 dsa question of medium-hard level. Topics were dp and graph. Then a little bit project discussion.
• 2nd round: Asked 2 dsa question of easy-medium level. Topics were dp and string. Then some behavior questions.
• 3rd round: Asked 1 dsa question of easy level based on minimum sliding window.

I had given only 3 rounds and then was rejected.

They asked a minimum sliding window problem. Given two strings, $s$ and $t$, find the minimum length substring of $s$ which contains all characters of $t$ (including its frequency).