Hey everyone,
I recently interviewed with Media.net for their on-campus SDE role and wanted to share my experience. I was rejected after the first technical round, but I hope this helps others in their preparation.
Status: Shortlisted for interviews, Rejected after Round 1.
Final Verdict: Out of 6 people shortlisted from my college, only 1 cleared this round, and was later rejected in Round 2. No one received an offer.
Online Assessment (OA)
The OA consisted of 3 coding problems of Hard difficulty. The topics included complex String Manipulation, a tricky Binary Search problem, and a Graph problem. I was able to solve 2 out of the 3 problems.
⚠️ A crucial piece of advice: Do not cheat. Their plagiarism detection is very strong. Many students who solved all 3 problems were not shortlisted, likely due to plagiarism flags. It's better to submit your own honest work.
Technical Interview (Round 1)
This round lasted about an hour and was split into two sections: CS Fundamentals and an Algorithmic Problem.
Part 1: CS Core Fundamentals
The interviewer asked a series of questions on core computer science concepts:
What is a Referential Integrity Constraint and how do you write the SQL query for it?
What are the main differences between TCP and UDP? Give real-world examples for each.
What is the static keyword and what is its purpose?
Explain the difference between Method Overriding and Method Overloading.
Can a static method be overridden? Explain why or why not.
I answered all the questions, but my SQL query had a minor syntax error.
Part 2: Algorithmic Problem
The interviewer did not provide a written problem statement and explained it verbally. It took a fair amount of time and clarifying questions to fully understand the prompt.
The question was:
"Given an integer N representing the total number of matches played in a tournament, find all possible values for the number of teams (k) that could have participated."
I discussed a brute-force approach, but the interviewer was looking for a highly optimized solution, hinting that a direct mathematical formula could solve it in constant time. We were running out of time, and I wasn't able to arrive at the final expected solution.
Takeaways
Fundamentals are Key: Media.net places a strong emphasis on core CS concepts. Be very solid with DBMS, OS, and OOP.
Think Beyond Brute Force: Always discuss the complexity and look for optimizations. In my case, the interviewer was looking for a direct jump from brute-force to the mathematical formula.
Recognize Math Patterns: Some problems that seem algorithmic are actually math problems in disguise. Recognizing patterns for quadratic equations, series, etc., can lead to a huge optimization.
Communication is Critical: Even though it took time, asking clarifying questions was the right thing to do. It's better to understand the problem perfectly than to start coding the wrong solution.
It was a tough interview, and running out of time on the final step was disappointing. But it was a great learning experience. Good luck to everyone else preparing!