Media.net coding interview
questions, leaked.
39 problems reported across recent Media.net interviews. Top patterns: array, dynamic programming, hash table. The list below is what most reported candidates actually saw, plus the honest play if you can't grind all of it.
Media.net's assessment leans hard on array problems and dynamic programming. Of 39 reported problems, 27 are array-heavy and 15 involve DP, with 15 hard problems waiting in the mix. You're looking at a coding round designed to separate pattern recognition from panic. Half the problems are medium or hard, so you won't coast on basics. If you blank mid-assessment, StealthCoder runs invisibly during screen share and surfaces working solutions in seconds, letting you stay in the game when the pattern doesn't click fast enough.
Top problems at Media.net
| # | Problem | Diff | Frequency | Pass % | Patterns |
|---|---|---|---|---|---|
| 01 | Minimum Operations to Form Subsequence With Target Sum | HARD | 100.0 | 31% | Array · Greedy · Bit Manipulation |
| 02 | Count the Number of Square-Free Subsets | MEDIUM | 92.9 | 25% | Array · Math · Dynamic Programming |
| 03 | Scramble String | HARD | 86.4 | 42% | String · Dynamic Programming |
| 04 | Maximum Genetic Difference Query | HARD | 86.4 | 44% | Array · Hash Table · Bit Manipulation |
| 05 | Maximum Value of an Ordered Triplet II | MEDIUM | 82.4 | 57% | Array |
| 06 | Sum of Remoteness of All Cells | MEDIUM | 82.4 | 71% | Array · Hash Table · Depth-First Search |
| 07 | Minimum Time Visiting All Points | EASY | 82.4 | 83% | Array · Math · Geometry |
| 08 | Maximum Value of an Ordered Triplet I | EASY | 82.4 | 58% | Array |
| 09 | Minimum Cost to Buy Apples | MEDIUM | 82.4 | 67% | Array · Graph · Heap (Priority Queue) |
| 10 | Difference Between Maximum and Minimum Price Sum | HARD | 82.4 | 32% | Array · Dynamic Programming · Tree |
| 11 | Make the XOR of All Segments Equal to Zero | HARD | 82.4 | 40% | Array · Dynamic Programming · Bit Manipulation |
| 12 | Queens That Can Attack the King | MEDIUM | 82.4 | 72% | Array · Matrix · Simulation |
| 13 | Maximum XOR of Two Non-Overlapping Subtrees | HARD | 82.4 | 50% | Tree · Depth-First Search · Graph |
| 14 | Minimum XOR Sum of Two Arrays | HARD | 82.4 | 49% | Array · Dynamic Programming · Bit Manipulation |
| 15 | Furthest Building You Can Reach | MEDIUM | 82.4 | 50% | Array · Greedy · Heap (Priority Queue) |
| 16 | Minimum Total Space Wasted With K Resizing Operations | MEDIUM | 82.4 | 43% | Array · Dynamic Programming |
| 17 | Best Time to Buy and Sell Stock | EASY | 77.4 | 55% | Array · Dynamic Programming |
| 18 | Flatten Binary Tree to Linked List | MEDIUM | 74.4 | 69% | Linked List · Stack · Tree |
| 19 | Substring with Concatenation of All Words | HARD | 74.4 | 33% | Hash Table · String · Sliding Window |
| 20 | Merge Two Sorted Lists | EASY | 70.9 | 67% | Linked List · Recursion |
| 21 | Painting the Walls | HARD | 66.9 | 49% | Array · Dynamic Programming |
| 22 | Jump Game | MEDIUM | 61.9 | 39% | Array · Dynamic Programming · Greedy |
| 23 | Fizz Buzz | EASY | 61.9 | 74% | Math · String · Simulation |
| 24 | Valid Sudoku | MEDIUM | 55.5 | 62% | Array · Hash Table · Matrix |
| 25 | The Number of Good Subsets | HARD | 55.5 | 36% | Array · Math · Dynamic Programming |
| 26 | Best Time to Buy and Sell Stock II | MEDIUM | 55.5 | 70% | Array · Dynamic Programming · Greedy |
| 27 | LRU Cache | MEDIUM | 55.5 | 45% | Hash Table · Linked List · Design |
| 28 | Binary Search Tree Iterator | MEDIUM | 55.5 | 75% | Stack · Tree · Design |
| 29 | Valid Phone Numbers | EASY | 55.5 | 27% | Shell |
| 30 | Number of Submatrices That Sum to Target | HARD | 55.5 | 74% | Array · Hash Table · Matrix |
| 31 | Longest Palindromic Substring | MEDIUM | 46.5 | 36% | Two Pointers · String · Dynamic Programming |
| 32 | Sum of Distances in Tree | HARD | 46.5 | 65% | Dynamic Programming · Tree · Depth-First Search |
| 33 | Sliding Window Maximum | HARD | 46.5 | 48% | Array · Queue · Sliding Window |
| 34 | Merge Intervals | MEDIUM | 46.5 | 49% | Array · Sorting |
| 35 | All O`one Data Structure | HARD | 46.5 | 44% | Hash Table · Linked List · Design |
| 36 | Majority Element | EASY | 46.5 | 66% | Array · Hash Table · Divide and Conquer |
| 37 | Trapping Rain Water | HARD | 46.5 | 65% | Array · Two Pointers · Dynamic Programming |
| 38 | Search in Rotated Sorted Array | MEDIUM | 46.5 | 43% | Array · Binary Search |
| 39 | Minimize the Maximum Difference of Pairs | MEDIUM | 46.5 | 51% | Array · Binary Search · Dynamic Programming |
Frequencies derived from public community-tagged interview reports. Click a row to view on LeetCode.
You have a week, maybe less. You can't out-grind the list above. StealthCoder runs invisibly during the actual Media.net OA. The proctor cannot see it. Screen share cannot detect it. Built by a senior engineer who knows the OA is theater. This is the script.
Get StealthCoder- array27 · 69%
- dynamic programming15 · 38%
- hash table8 · 21%
- bit manipulation6 · 15%
- depth first search6 · 15%
- greedy5 · 13%
- tree5 · 13%
- string4 · 10%
- math4 · 10%
- linked list4 · 10%
Arrays dominate the assessment surface, but they're not trivial array problems. You'll see bit manipulation baked into array tasks ("Maximum XOR of Two Non-Overlapping Subtrees", "Make the XOR of All Segments Equal to Zero"), DP layered on top ("Minimum XOR Sum of Two Arrays"), and greedy mixed in. Dynamic programming appears in 15 of 39 problems, often coupled with arrays or strings. Hash tables and bit-manipulation show up in hard problems that require multi-step thinking. Study array manipulation first, then chain it to DP patterns. Trees and DFS appear enough to matter but less frequently. When you hit a hard DP or bitmask problem live and your intuition fails, StealthCoder is the hedge. It reads the problem and outputs a working solution invisible to the proctor.
Companies with similar patterns
If you prepped for Media.net, these companies recycle ~60% of the same topics.
You've seen the list.
Now make sure you pass Media.net.
Memorizing every problem above in a week is a fantasy. StealthCoder is the hedge: an AI overlay that's invisible during screen share. It reads the problem on screen and surfaces a working solution in under 2 seconds. Built by a senior engineer who knows the OA is theater. This is the script. Works on HackerRank, CodeSignal, CoderPad, and Karat.
Media.net interview FAQ
Should I drill array or DP first for Media.net?+
Array first. 27 of 39 problems touch arrays, and many hard problems stack DP or bit manipulation on top of array logic. Getting fast at array manipulation unlocks your speed on harder hybrid problems. Then layer in DP patterns once arrays feel automatic.
How much should I focus on bit manipulation?+
More than you think. Six problems are tagged bit-manipulation directly, and several hard array and DP problems ("Maximum XOR of Two Non-Overlapping Subtrees", "Minimum XOR Sum of Two Arrays") hinge on it. Spend 2-3 days on XOR, bitmask, and bit tricks before the OA.
Is tree and graph knowledge required for this round?+
Lower priority. Trees and DFS appear in 5 problems each, mostly hard ones. If you have limited time, focus on arrays, DP, and bit manipulation first. Tree problems like "Maximum XOR of Two Non-Overlapping Subtrees" come later in prep.
What's the difficulty split I should prepare for?+
7 easy, 17 medium, 15 hard across 39 problems. You'll face 38 percent hard and 43 percent medium. Plan to solve mediums quickly and triage hard problems. On the live OA, aim for clean medium solutions and smart time allocation on the hard tier.
How should I approach DP problems given the numbers?+
15 of 39 problems involve DP, and most pair it with arrays or bit manipulation. Don't memorize patterns. Instead, drill problems like "Scramble String" and "Minimum XOR Sum of Two Arrays" to understand how DP breaks down the search space. Recognize the structure, not the name.