Interview Experience Analysis for Media.net

Q1 To be frank, I struggled once I started because I never did probability-based questions before. I first gave a brute-force solution using recursion, then later tried to come up with an optimized approach. Insight: While implementing the brute-force solution, I realized that Dynamic Programming (D...

🧩 Media.net – SDE-2 Android Developer Interview Experience (Oct 2025) Role: SDE-2 (Android Developer) Location: Bangalore (Onsite) Rounds: 3 Technical + 1 Culture Fit Status: Rejected after Hiring Manager Round Round 1 – DSA (60 mins) Two medium-level problems were asked: 1️⃣ [Unique Paths II](h...

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 ...

Media.net DS Algo Round 1Question-1: Given an array 'A' of 'N' non-negative numbers and an integer 'T'Find segment(i..j) of A such that abs(A[i] + A[i+1] + ... + A[j] - T) is minimum.You have to answer this for 'M' different values of TN = 10^5 M = 10,000Example:N=6, M=4A = [4, 1, 6, 3, 3, 5] T_a...

You are given a 2D grid of size m x n, where each cell contains a ball painted with a color, represented by a lowercase English letter ('a' to 'z'). Your goal is to recolor the balls such that: 1. In each row, no color appears more than twice. 2. No two adjacent balls (up, down, left, right) share t...

I got interviewed with Media.net in month of July 2021 for Bengaluru location.Total 4 rounds of interview :Round 1Was asked 2 DS questions. One was related to String anagrams another do not remember. Expectation was to come up with complete working code and its time complexity. Round 2It was a machi...

Media.net interview question. Q. You are given a rooted binary tree with weights on edges. The distance between two nodes in this tree is the sum of the edge weights on the path between the two nodes. SUM[u] is the sum of the distances between u and all the other nodes in the tree. task1 : Calcula...