All companies
Medianet
3 Easy14 Medium14 Hard31 total
| No. | Problem | Difficulty | Frequency |
|---|---|---|---|
| 1959 | Minimum Total Space Wasted With K Resizing Operations | Medium | |
| 2538 | Difference Between Maximum and Minimum Price Sum | Hard | |
| 2572 | Count the Number of Square-Free Subsets | Medium | |
| 407 | Trapping Rain Water II | Hard | |
| 1938 | Maximum Genetic Difference Query | Hard | |
| 2473 | Minimum Cost to Buy Apples | Medium | |
| 2479 | Maximum XOR of Two Non-Overlapping Subtrees | Hard | |
| 2852 | Sum of Remoteness of All Cells | Medium | |
| 2874 | Maximum Value of an Ordered Triplet II | Medium | |
| 2873 | Maximum Value of an Ordered Triplet I | Easy | |
| 1642 | Furthest Building You Can Reach | Medium | |
| 1222 | Queens That Can Attack the King | Medium | |
| 1266 | Minimum Time Visiting All Points | Easy | |
| 1787 | Make the XOR of All Segments Equal to Zero | Hard | |
| 1879 | Minimum XOR Sum of Two Arrays | Hard | |
| 2835 | Minimum Operations to Form Subsequence With Target Sum | Hard | |
| 354 | Russian Doll Envelopes | Hard | |
| 3660 | Jump Game IX | Medium | |
| 42 | Trapping Rain Water | Hard | |
| 947 | Most Stones Removed with Same Row or Column | Medium | |
| 2382 | Maximum Segment Sum After Removals | Hard | |
| 668 | Kth Smallest Number in Multiplication Table | Hard | |
| 2945 | Find Maximum Non-decreasing Array Length | Hard | |
| 3291 | Minimum Number of Valid Strings to Form Target I | Medium | |
| 70 | Climbing Stairs | Easy | |
| 1376 | Time Needed to Inform All Employees | Medium | |
| 406 | Queue Reconstruction by Height | Medium | |
| 1994 | The Number of Good Subsets | Hard | |
| 827 | Making A Large Island | Hard | |
| 99 | Recover Binary Search Tree | Medium | |
| 53 | Maximum Subarray | Medium |