Status:
2+ YOE from Non - FAANG.
Master's in CS

Timeline:
March last week : Phone interview.
Onsite : April second week.
Verdict : Rejected.

Visrtual Onsite ( 3 rounds with 15 mins break in between)

Round 1: Question on arrays.
Solved it using hashset.

Round 2: Unit converter where I have to convert one unit to another unit. Consider the input as a graph (Adjancency matrix).
Solved using BFS, start from given unit see if it possible to reach the required unit calculate while traversing. If it is not possible return -1.

Round 3 : Sub string search, proposed KMP and Rabin Karp and implemented Rabin Karp rolling hash window.
Followup: Imagine you have a very big file where it does not fit into memory, how would you search for substring.
Proposed sliding window technique.
https://leetcode.com/problems/read-n-characters-given-read4-ii-call-multiple-times/. Similar to this with sub string search.

I was able to solve all three questions within the time limit. Still rejected.