Contacted by a Recruiter, got the hackerrank test (Jan-2021)

OA:
Graph based problem, simple BFS/DFS/Union-find to find the number of connected nodes in clusters.
Robot trapped in a circle

Virtual Onsite :

Round-1:
-> Introduction
-> 2 LPs
-> Design LRU Cache (The interviewer worded the question differently, but confirmed LRU upon asking)

Round-2:
-> Intro
-> 2 LPs
-> Reverse LL (Asked to show recursive, after solving using iteration)
-> Was asked questions on database scalability, how to handle a memory hungry application and some follow-ups.

Round-3:
-> Intro
-> 2 LPs
-> Graph Based question, shortest steps in a maze between given src(x,y) and dest(x,y) with obstacles on the grid.

Round-4 (Bar Raiser):
-> Intro
-> 2 LPs
-> Design a highly scalable Movie Ticket Booking System

Did technically well on all 3 rounds, screwed up LPs and on Design with Bar Raiser I was not at my best.

Verdict : Rejected