DSA Doctor
Verified Company Vault
Medianet DSA Interview Questions
32 curated coding interview questions directly asked in Medianet technical rounds, sorted by frequency with recency and difficulty diagnostics.
32
Total Questions
3 (9%)
Easy Problems
15 (47%)
Medium Problems
14 (44%)
Hard Problems
🔥 Most Tested Topics:
Arrays (16)Core DSA (8)Backtracking (2)Trees (2)Greedy (2)
📂 Sourced Datasets:
Last 6 monthsAll questionsOlder than 6 months
| ID | Problem | Difficulty | Topic | Pattern | Acceptance | Frequency | Recency |
|---|---|---|---|---|---|---|---|
| 70 | Climbing Stairs | Easy | Dynamic Programming | State Transition | 54.1% | 100.0% | 6m |
| 1959 | Minimum Total Space Wasted With K Resizing Operations | Medium | Arrays | Sorting / Prefix / Scan | 43.9% | 100.0% | all |
| 2538 | Difference Between Maximum and Minimum Price Sum | Hard | Arrays | Sorting / Prefix / Scan | 33.6% | 100.0% | all |
| 2572 | Count the Number of Square-Free Subsets | Medium | Backtracking | Backtracking | 26.6% | 100.0% | all |
| 407 | Trapping Rain Water II | Hard | Core DSA | Two Pointers | 64.1% | 100.0% | all |
| 1938 | Maximum Genetic Difference Query | Hard | Arrays | Sorting / Prefix / Scan | 47.1% | 87.5% | all |
| 2473 | Minimum Cost to Buy Apples | Medium | Arrays | Sorting / Prefix / Scan | 67.3% | 87.5% | all |
| 2479 | Maximum XOR of Two Non-Overlapping Subtrees | Hard | Arrays; Trees; Greedy | Sorting / Prefix / Scan; DFS / BFS; Greedy | 52.2% | 87.5% | all |
| 2852 | Sum of Remoteness of All Cells | Medium | Arrays | Sorting / Prefix / Scan | 70.7% | 87.5% | all |
| 2874 | Maximum Value of an Ordered Triplet II | Medium | Arrays | Sorting / Prefix / Scan | 56.4% | 87.5% | all |
| 2873 | Maximum Value of an Ordered Triplet I | Easy | Arrays | Sorting / Prefix / Scan | 58.2% | 87.5% | all |
| 1642 | Furthest Building You Can Reach | Medium | Core DSA | Implementation / Reasoning | 50.9% | 87.5% | all |
| 1222 | Queens That Can Attack the King | Medium | Core DSA | Implementation / Reasoning | 72.7% | 87.5% | all |
| 1266 | Minimum Time Visiting All Points | Easy | Arrays | Sorting / Prefix / Scan | 84.8% | 87.5% | all |
| 1787 | Make the XOR of All Segments Equal to Zero | Hard | Core DSA | Implementation / Reasoning | 40.7% | 87.5% | all |
| 1879 | Minimum XOR Sum of Two Arrays | Hard | Arrays | Sorting / Prefix / Scan | 51.1% | 87.5% | all |
| 2835 | Minimum Operations to Form Subsequence With Target Sum | Hard | Arrays | Sorting / Prefix / Scan | 32.5% | 87.5% | all |
| 354 | Russian Doll Envelopes | Hard | Core DSA | Implementation / Reasoning | 37.9% | 87.5% | all |
| 3660 | Jump Game IX | Medium | Greedy | Greedy | 46.2% | 87.5% | all |
| 42 | Trapping Rain Water | Hard | Core DSA | Two Pointers | 67.4% | 75.0% | all |
| 947 | Most Stones Removed with Same Row or Column | Medium | Core DSA | Implementation / Reasoning | 62.9% | 75.0% | all |
| 2382 | Maximum Segment Sum After Removals | Hard | Arrays | Sorting / Prefix / Scan | 49.7% | 62.5% | all |
| 668 | Kth Smallest Number in Multiplication Table | Hard | Heap | Priority Queue | 54.1% | 62.5% | all |
| 2945 | Find Maximum Non-decreasing Array Length | Hard | Arrays | Sorting / Prefix / Scan | 18.9% | 62.5% | all |
| 3291 | Minimum Number of Valid Strings to Form Target I | Medium | Arrays; Strings | Sorting / Prefix / Scan; Hashing / Sliding Window | 21.9% | 62.5% | all |
| 1376 | Time Needed to Inform All Employees | Medium | Core DSA | Implementation / Reasoning | 60.5% | 50.0% | all |
| 406 | Queue Reconstruction by Height | Medium | Stack / Queue | Monotonic Stack / Simulation | 74.7% | 50.0% | all |
| 1994 | The Number of Good Subsets | Hard | Backtracking | Backtracking | 37.2% | 50.0% | all |
| 54 | Spiral Matrix | Medium | Arrays | Sorting / Prefix / Scan | 56.8% | 50.0% | all |
| 827 | Making A Large Island | Hard | Graphs | BFS / DFS / Topological Sort | 56.6% | 50.0% | all |
| 99 | Recover Binary Search Tree | Medium | Trees; Binary Search | DFS / BFS; Binary Search | 59.7% | 50.0% | all |
| 53 | Maximum Subarray | Medium | Arrays | Sorting / Prefix / Scan | 53.3% | 50.0% | all |