I'm an experienced candidate, currently working as SDE-2 in India.
Round 0 - Phone screen
You are given a sorted array and an integer K. Remove duplicates from the array if the number of duplicates are > K

eg :
Input: 1,2,2,2,3,3,4,5,5,5,5 and K=0
Output should be 1,2,3,4,5

Input: 1,2,2,2,3,3,4,5,5,5,5 and K=1
Output should be 1,2,2,3,4,5,5

Solved it by just having a counter and iterating through the input array by checking the current and previous element at each step. Whenever a new element is encountered the counter is reset. Result was stored in a new output array.

Onsite:

Round 1:
Previous Projects + Resume discussion
https://leetcode.com/problems/move-zeroes/

Round 2:
Previous Projects discussion
Second larget element in a BST

Round 3:
LLD / HLD discussion round:
Design a log writing / log collection service.
Was a very open ended question.

Round 4:
Behavioral round

In general questions were in a Easy Leetcode Level.