
Media.net Interview Questions
& Process
Real candidates share what happened, how many rounds they had,
and how the experience turned out.
Based on 459 interview experiences · FREE TO READ
Which role are you interviewing for?
30 roles · 459 reportsCandidate interview experiences
First-hand accounts from people who interviewed at Media.net.
SRE Engineer
Instead of a typical online assessment, the interview involved a 3-hour hackathon. The task was to build a service capable of monitoring and synchronizing updates between any two directories. This was broken down into 4 stages, with an evaluator checking the implementation at the conclusion of each stage.
- Can you elaborate on the implementation details and justify the choices you made?
- Could you provide further clarification regarding the decisions taken during the service development?
Software Reliability Engineer
So, first I had this online test with MCQs about SRE and QA stuff. Then, I did an offline round focused on socket programming, with 5 questions, and I managed to solve 2 fully. After passing that, they said there would be 3 technical interviews followed by an HR round. The first technical interview was pretty straightforward, with some basic and a few application-level questions on computer networks and OS. The second one was a bit harder, totally application-level.
- Tell me about yourself and your projects.
- What are the space or memory requirements for your project, like the dataset size, model size, etc.?
- Since your project needed a GPU, tell me everything about GPUs.
Software Engineer
First there was an online test with 3 pretty easy coding questions, most people got them all. Then I got shortlisted for interviews. Round 1 was technical and the main question was the same as the previous year's internship test, but it had two parts: first making a quadratic equation and then doing a binary search on it. They also asked some CS fundamentals and project questions, but the coding question was the main thing. I passed this round. Round 2 was also technical. They asked the 'students and friendships' problem where you have to find the most intelligent student in a friend circle. I couldn't figure out the O(n) solution and didn't get shortlisted for the next round, which is supposed to be DSA + other stuff.
- Problem Statement There are N students in a school, and an integer K. Initially, none are friends. You will be given Q operations of 3 different types. Each student has a different intelligence level given in an array. Operations Type 1: 1 A B → A and B will become friends (mutually). Type 2: 2 A → A will leave the school. It does not impact the friend circles. Only A is removed from the friend circle. Type 3: 3 A → Return the student with highest intelligence level among all friends (direct or mutual) of A including A. If the student has less than K friends (direct or mutual), return -1. It is guaranteed A has not left school. N = 5 K = 2 Intelligence = [1, 2, 3, 4, 5] Q = 5 Queries: 1 1 2 1 3 2 3 1 2 2 3 2
- I couldn't come up with the O(n) solution during the interview.
UI Developer
They asked me questions related to HTML, CSS, and Javascript. I messed up when I couldn't name a Javascript operator, and that led to my rejection. I didn't hear back from them after that. This wasn't my first time interviewing with Media.net, but I've never received a response from them.
- Basic HTML concepts
- Basic CSS concepts
- Basic Javascript concepts
Media.net Interview Questions
Quoted word for word from Media.net interview reports.
“Given two lists, find the pair of elements whose sum equals a target value, with optimization.”
Read reports →“Given a matrix of characters, find if a word exists in it using dynamic programming.”
Read reports →“Find an index in an array such that the sum of elements on its left is equal to the sum of elements on its right.”
Read reports →“For a given expression, what is the maximum of the minimums calculated across all windows of size k? Expected time complexity is O(n).”
Read reports →“What's the maximum number of paths from one point to another in a grid, moving only horizontally or vertically?”
Read report →“Find indices i,j in array A such that the absolute difference between the sum of elements from index i to j and integer T is minimized.”
Read report →“Find the minimum operations to make an array continuously increasing, where an operation involves adding any two adjacent elements.”
Read report →“How would you reverse only the alphabetical characters in a string, leaving symbols and numbers in their original places? For instance, transform 'af@h$kj&#m' into 'mj@k$f&#a'.”
Read report →“Find a substring with a specific sum and the maximum number of combinations for that sum, with optimization.”
Read report →Formats, difficulty and experience
Across all 459 Media.net interview reports.