Media.net LeetCode Interview Questions

39 questions all-time · 7 easy · 17 medium · 15 hard

Media.net has asked 39 distinct LeetCode questions across all recorded interviews: 7 easy, 17 medium and 15 hard. The questions reported most often are Minimum Operations to Form Subsequence With Target Sum, Count the Number of Square-Free Subsets and Scramble String. Every question links straight to LeetCode, and the list can be filtered by difficulty and topic or sorted by how often the question comes up.

#	Problem	Difficulty	Frequency	Acceptance
1	Minimum Operations to Form Subsequence With Target Sum	Hard	100	31.3%
2	Count the Number of Square-Free Subsets	Medium	93	25.2%
3	Scramble String	Hard	86	42.2%
4	Maximum Genetic Difference Query	Hard	86	44.3%
5	Furthest Building You Can Reach	Medium	82	50.4%
6	Minimum Total Space Wasted With K Resizing Operations	Medium	82	43.0%
7	Make the XOR of All Segments Equal to Zero	Hard	82	39.9%
8	Minimum Time Visiting All Points	Easy	82	82.6%
9	Minimum XOR Sum of Two Arrays	Hard	82	49.1%
10	Minimum Cost to Buy Apples	Medium	82	67.1%
11	Queens That Can Attack the King	Medium	82	72.2%
12	Maximum XOR of Two Non-Overlapping Subtrees	Hard	82	49.6%
13	Difference Between Maximum and Minimum Price Sum	Hard	82	31.8%
14	Sum of Remoteness of All Cells	Medium	82	70.8%
15	Maximum Value of an Ordered Triplet II	Medium	82	56.7%
16	Maximum Value of an Ordered Triplet I	Easy	82	58.3%
17	Best Time to Buy and Sell Stock	Easy	77	55.3%
18	Flatten Binary Tree to Linked List	Medium	74	68.5%
19	Substring with Concatenation of All Words	Hard	74	33.0%
20	Merge Two Sorted Lists	Easy	71	66.8%
21	Painting the Walls	Hard	67	48.5%
22	Fizz Buzz	Easy	62	74.4%
23	Jump Game	Medium	62	39.5%
24	LRU Cache	Medium	56	45.2%
25	Number of Submatrices That Sum to Target	Hard	56	74.5%
26	Binary Search Tree Iterator	Medium	56	74.9%
27	Valid Phone Numbers	Easy	56	27.5%
28	The Number of Good Subsets	Hard	56	35.9%
29	Valid Sudoku	Medium	56	62.3%
30	Best Time to Buy and Sell Stock II	Medium	56	69.5%
31	All O`one Data Structure	Hard	47	44.1%
32	Merge Intervals	Medium	47	49.4%
33	Sliding Window Maximum	Hard	47	47.6%
34	Longest Palindromic Substring	Medium	47	35.8%
35	Sum of Distances in Tree	Hard	47	65.3%
36	Majority Element	Easy	47	65.7%
37	Trapping Rain Water	Hard	47	65.1%
38	Search in Rotated Sorted Array	Medium	47	42.8%
39	Minimize the Maximum Difference of Pairs	Medium	47	50.9%

Where this data comes from

These questions come from the public leetcode-company-wise-problems data set, which collects interview reports from candidates. They are community-reported rather than published by Media.net, so treat the list as a strong signal of what gets asked, not an official or exhaustive syllabus. Last refreshed 2026-08-08.

How to read this list

The tabs at the top split the questions by how recently people said they were asked in interviews. "Last 30 Days" is the past month, "Last 3 Months" is the past quarter, and so on. "All Time" is every question on record for this company.

Frequency is a score from 0 to 100 for how often a question showed up in that time window. A higher number means it came up more often, so the list starts with the most common questions first. It is a relative popularity signal within Media.net's questions, not a probability that you will be asked it. Acceptance is LeetCode's own share of submissions that pass for that problem, across all users, not something specific to Media.net. Click any question to open it on LeetCode.

Similar companies

SAP42 problems14217

Tesla41 problems10265

Arista Networks39 problems12261

Sprinklr39 problems11721

Turing37 problems10234

Docusign36 problems3267