Media.net Software Engineer Interview Questions
& Process
Real candidates share what happened, how many rounds they had,
and how the experience turned out.
Based on 89 interview experiences · FREE TO READ
Candidate interview experiences
First-hand accounts from people who interviewed at Media.net.
Media.net
Software Engineer
Senior Average Negative experience No offer 4 rounds
Interview process
Recruiter call Technical screen Onsite Background check
Interview formats
Behavioral Technical System Design Coding
It was a 4 round process. Round 1 was a virtual screening with the hiring manager, who emphasized it was a front-end role. Round 2 was a technical virtual interview, which was a good and friendly experience. Then the recruiter called to ask for salary documents and mentioned an in-person round. This round involved questions about designing a web application and one DSA question. Round 4 was another session with the hiring manager, asking about designing Google Sheets. After that, I was ghosted.
Confirmed questions6 questions
- Can you discuss React performance?
- How would you approach UI architecture?
- What are the quickest paths for DSA problems?
Media.net
Software Engineer
Entry Difficult Positive experience No offer 2 rounds
Interview process
Take home Technical screen Technical screen
Interview formats
Coding Technical Coding Technical
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.
Confirmed questions2 questions
- 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.
Media.net
Software Engineer
Intern Average Positive experience Accept offer 3 rounds
Interview process
Technical screen Phone screen Technical screen
Interview formats
Coding Technical System Design
It was an on-campus drive with 3 rounds total. The first round was an online assessment with 4 medium to hard coding questions. I managed to solve 2 and a half, which got me to the next stages. The first interview round focused on a graph problem and fundamental computer science concepts. Then, in the second interview round, I was tasked with designing and implementing a social media platform similar to Twitter. I received an offer after this.
Confirmed questions3 questions
- The first round was an online assessment with 4 coding questions of medium to hard difficulty.
- In the first interview round, I was asked a graph-related question and some core CS fundamentals.
- In the second interview round, I was asked to implement a social media platform like Twitter.
Media.net Software Engineer Interview Questions
Quoted word for word from Media.net interview reports.
“Given a knight's position (i,j) on a chessboard and a number of moves K, calculate the probability that the knight remains on the board after K moves.”
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 →“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 reports →“Find the minimum operations to make an array continuously increasing, where an operation involves adding any two adjacent elements.”
Read reports →“For a given binary tree, can you determine the total sum of nodes from the root to a specified node?”
Read report →“Given a graph, what's the shortest distance from node 1 to node n, and how can it be minimized by adding an edge between a set of k special nodes?”
Read report →“Find the index in an array where the sum of elements to the left equals the sum of elements to the right. Example array = [1, 7, 3, 6, 5, 6], expected output = 3.”
Read report →“How many ways are there to fill a 3xn floor using 2x1 tiles?”
Read report →“What is database indexing and can any column be used for it?”
Read report →Formats, difficulty and experience
Across all 89 Media.net interview reports.