Media.net Web Developer Interview Questions
& Process
Real candidates share what happened, how many rounds they had,
and how the experience turned out.
Based on 35 interview experiences · FREE TO READ
Candidate interview experiences
First-hand accounts from people who interviewed at Media.net.
Media.net
Web Application Developer
Mid Average Neutral experience No offer 2 rounds
Interview process
Technical screen Technical screen
Interview formats
Coding Technical
So first there was a coding assessment, then a 1 hour online DSA round. They were supposed to have a F2F round in Bangalore but it stayed there and HR wanted me to come to Mumbai for it which I agreed to, but this round didn't happen.
Confirmed questions3 questions
- Given a matrix of characters, find if a word exists in it using dynamic programming.
- A simple question on arrays.
- Solve the buy and sell stocks problem using the array version.
Media.net
Web Developer
Entry Easy Positive experience No offer 4 rounds
Interview process
Recruiter call Phone screen Technical screen Onsite
Interview formats
Behavioral Technical
Had an online interview for the Web Developer job, and it was a really good experience overall. The interviewer was professional and nice, making it feel comfortable. I liked how the questions were presented—they were clear, made sense for the role, and encouraged me to speak my mind. The whole vibe was respectful and helpful, making it both interesting and motivating.
Confirmed questions0 questions
No confirmed questions were included in this interview report.
Media.net
Web Developer
Entry Difficult Positive experience Decline offer 3 rounds
Interview process
Recruiter call Technical screen Onsite
Interview formats
Technical Coding
A company came to my college for recruitment. I'm not sure if there was a resume screening, but Round 1 involved a HackerRank test with 20 MCQs and 2 coding questions. The coding questions were easy to medium difficulty (merge two sorted linked lists, and one on 2D arrays). The MCQs covered topics like maths, logical reasoning, DBMS, and OOPs. Round 2 was an interview at their Andheri office, conducted via Google Meet. They immediately shared a coding link. They asked three coding questions: 1. Reversing regular characters in a string while keeping special characters in place (e.g., af@h$kj&#m --> mj@k$f&#a). 2. An integer array was given, and we start at index 0. We need to jump to the index indicated by the value at the current index (Arr[i]). For example, if arr = [2,4,-1,6], starting at index 0 (value 2), we jump 2 positions to index 2 (value -1). From index 2, we jump to index 2-1=1 (value 4). From index 1, we cannot jump 4 positions as it exceeds the array bounds. We need to determine if the end of the array can be reached without using extra space. The array values could be positive, negative, or zero. 3. A basic dynamic programming question about finding the maximum number of ways to move between two cells in a 2D array, allowing only up, down, left, or right movements. My Round 3 was scheduled for three days later due to slot unavailability, but I had already accepted a better offer elsewhere, so I didn't attend.
Confirmed questions6 questions
- Questions covering array, string, and dynamic programming concepts.
- Can you merge two sorted linked lists?
- Can you solve a problem involving 2D arrays?
Media.net Web Developer Interview Questions
Quoted word for word from Media.net interview reports.
“If you are given the number of nodes, what is the height of a balanced complete binary tree? Provide the mathematical formula.”
Read reports →“Given a 2D grid map of '1's (land) and '0's (water), count the number of islands.”
Read reports →“Given two lists, find the pair of elements whose sum equals a target value, with optimization.”
Read reports →“Write a function to check if a string is a palindrome, ignoring case (treat 'A' and 'a' as the same). The solution should perform this check in a single pass.”
Read reports →“Given two numbers represented as linked lists where each node is a digit, perform addition or subtraction nodewise.”
Read report →“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 report →“What's the maximum number of paths from one point to another in a grid, moving only horizontally or vertically?”
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 35 Media.net interview reports.