Virtual Onsite
Round 1:
Stack question(Leetocode Medium), Did the question in O(n) but got a follow-up to do it in O(1) couldn't complete it

Round 2:
Sliding Window problem, Haven't seen this question in leetcode and I had to ask lotta questions to understand the question completely. Solved it in the end in O(n^2). Dunno if that's the optimal solution

Round 3:
Behavorial

Round 4:
Bulls and Cows problem. Follow up question was similar to Guess the word. Solved both of them

Round 5:
Binary Tree DFS question (Falling leaves) Haven't seen this question before. But solved it.
Given an array of numbers, can 3 numbers form a triangle ? Gave a O(n^3) solution and then gave O(n^2) and finally gave O(n*logn) solution

Its a reject :)