Media.net LeetCode interview questions

Explore Media.net questions from the all problems list. Search by title or topic, filter by difficulty, and track solved problems on this device.

Time range

Problems in range

Solved

0 / 39

Range progress

Problem list

Select a problem to open it on LeetCode.

Problem	Difficulty	Frequency	Acceptance
Trapping Rain Water II Array Breadth-First Search Heap (Priority Queue) +1 HARD	Hard	100.0%	0.6%
Difference Between Maximum and Minimum Price Sum Array Dynamic Programming Tree +2 HARD	Hard	88.4%	0.3%
Count the Number of Square-Free Subsets Array Math Dynamic Programming +3 MEDIUM	Medium	86.4%	0.3%
Minimum Total Space Wasted With K Resizing Operations Array Dynamic Programming Prefix Sum MEDIUM	Medium	81.8%	0.4%
Maximum Genetic Difference Query Array Hash Table Bit Manipulation +2 HARD	Hard	79.2%	0.5%
Minimum Cost to Buy Apples Array Graph Theory Heap (Priority Queue) +1 MEDIUM	Medium	79.2%	0.7%
Maximum XOR of Two Non-Overlapping Subtrees Tree Depth-First Search Graph Theory +1 HARD	Hard	79.2%	0.5%
Sum of Remoteness of All Cells Array Hash Table Depth-First Search +3 MEDIUM	Medium	79.2%	0.7%
Maximum Value of an Ordered Triplet II Array Prefix Sum MEDIUM	Medium	79.2%	0.6%
Maximum Value of an Ordered Triplet I Array Prefix Sum EASY	Easy	79.2%	0.6%
Furthest Building You Can Reach Array Greedy Heap (Priority Queue) MEDIUM	Medium	79.2%	0.5%
Queens That Can Attack the King Array Matrix Simulation MEDIUM	Medium	79.2%	0.7%
Minimum Time Visiting All Points Array Math Geometry EASY	Easy	79.2%	0.8%
Make the XOR of All Segments Equal to Zero Array Hash Table Dynamic Programming +2 HARD	Hard	79.2%	0.4%
Minimum XOR Sum of Two Arrays Array Dynamic Programming Bit Manipulation +4 HARD	Hard	79.2%	0.5%
Minimum Operations to Form Subsequence With Target Sum Array Greedy Bit Manipulation HARD	Hard	79.2%	0.3%
Jump Game IX Array Dynamic Programming MEDIUM	Medium	79.2%	0.5%
Count Subarrays with Distant Sums Array Binary Search Binary Indexed Tree +2 HARD	Hard	79.2%	0.3%
Lexicographically Largest Power Array Array Greedy Bit Manipulation HARD	Hard	79.2%	0.2%
Trapping Rain Water Array Two Pointers Dynamic Programming +2 HARD	Hard	76.1%	0.7%

Showing 1–20 of 39 matching problems · All Problems

Media.net LeetCode Interview Questions | Grind Practice