Ranked by how often candidates report them. Each opens in the editor with hidden tests, an animated walkthrough and solutions in four languages; a question you solve once counts for every company that asks it.
Maximum Genetic Difference Query · Minimum Total Space Wasted With K Resizing Operations · Difference Between Maximum and Minimum Price Sum · Count the Number of Square-Free Subsets · Minimum Cost to Buy Apples · Maximum XOR of Two Non-Overlapping Subtrees · Sum of Remoteness of All Cells · Maximum Value of an Ordered Triplet II · Maximum Value of an Ordered Triplet I · Queens That Can Attack the King · Minimum Time Visiting All Points · Make the XOR of All Segments Equal to Zero · Minimum XOR Sum of Two Arrays · Minimum Operations to Form Subsequence With Target Sum · Jump Game IX · Maximum Segment Sum After Removals · Find Maximum Non-decreasing Array Length · Minimum Number of Valid Strings to Form Target I · The Number of Good Subsets · Remove Outermost Parentheses
Questions people ask
What coding questions does Media.net ask most?
Trapping Rain Water II, Trapping Rain Water, Longest Substring Without Repeating Characters, Best Time to Buy and Sell Stock, Construct Binary Tree from Preorder and Inorder Traversal, Furthest Building You Can Reach, Russian Doll Envelopes, Most Stones Removed with Same Row or Column.
Which topics come up in Media.net coding rounds?
dynamic programming, graphs, trees, bit manipulation, heaps, union find.
How hard are Media.net coding questions?
Of the reported questions, 3 are easy, 15 medium and 5 hard. A 45 to 60 minute live interview where you solve one or two data-structures-and-algorithms problems while explaining your thinking. Interviewers score problem solving, code quality, testing and communication.