Application Process: Applied off-campus via Referral
OA: 3 questions to be solved in 90 mins (All questions are medium - hard).

Interview Rounds:

Round 1 (60 mins):

Random Questions:

1. Advantage of searching using BST over binary search on sorted array.
2. https://dba.stackexchange.com/questions/300168/mysql-why-not-create-an-index-on-every-column-what-is-the-cost-of-indexing-a-c
3. Related to cookies.

DSA question:
https://codeforces.com/problemset/problem/629/C

Solved everything but interviewer solved the problem using some other approach. So, took a time to convince him.

Round 2(60 mins):

Random Questions:

1. What happens in backend when you type google.com?
2. Question related to ports.

DSA Question:
https://codeforces.com/problemset/problem/767/D

Interviewer solved the problem in O(tlogM) using binary search approach but I solved it in O(t) using greedy. My solution was correct but interviewer said he will evaluate it later.

Got a rejection mail after one day of round 2 :( .

I found Media.net to be one of those companies whose Interview rounds are harder than their OA.