Medianet Coding Interview Questions
We track 28 coding questions asked at Medianet, tagged with the algorithms and concepts they test. The most common: Array, Dynamic Programming, Bit Manipulation, Depth-First Search, Math.
Browse all 28 Medianet questions →Concept mix
Each question's weight is split evenly across its concepts, so the shares sum to 100%.
- Array26.1%
- Dynamic Programming10.1%
- Depth-First Search5.3%
- Math5.2%
- Bit Manipulation4.6%
- Matrix4.0%
- Binary Search3.5%
- Tree3.0%
- Hash Table2.8%
- Breadth-First Search2.8%
- Other (27)32.8%
How many questions involve each concept
Share of all 28 tracked Medianet questions that touch each concept. Questions usually involve several, so these overlap.
- Array82.1%
- Dynamic Programming42.9%
- Bit Manipulation21.4%
- Depth-First Search21.4%
- Math17.9%
- Binary Search14.3%
- Hash Table14.3%
- Matrix14.3%
- Bitmask10.7%
- Breadth-First Search10.7%
- Greedy10.7%
- Prefix Sum10.7%
Where Medianet differs from the average company
Concept weight at Medianet relative to the average across all companies we track. Green means Medianet leans on it harder than most.
- Bitmask19.0×
- Segment Tree6.0×
- Union-Find3.6×
- Number Theory3.3×
- Stack0.48×
- Sorting0.46×
- Hash Table0.42×
Medianet specialties
Concepts that show up at Medianet but are rarely asked elsewhere. They are easy to get blindsided by.
Difficulty mix
Level split of the 28 tracked Medianet questions.
- Junior11% (3)
- Mid/Senior43% (12)
- Staff46% (13)
Every concept in Medianet interviews
| Concept | Questions | % of questions | Share of mix |
|---|---|---|---|
| Array | 23 | 82.1% | 26.1% |
| Dynamic Programming | 12 | 42.9% | 10.1% |
| Bit Manipulation | 6 | 21.4% | 4.6% |
| Depth-First Search | 6 | 21.4% | 5.3% |
| Math | 5 | 17.9% | 5.2% |
| Binary Search | 4 | 14.3% | 3.5% |
| Hash Table | 4 | 14.3% | 2.8% |
| Matrix | 4 | 14.3% | 4.0% |
| Bitmask | 3 | 10.7% | 1.9% |
| Breadth-First Search | 3 | 10.7% | 2.8% |
| Greedy | 3 | 10.7% | 2.7% |
| Prefix Sum | 3 | 10.7% | 2.5% |
| Tree | 3 | 10.7% | 3.0% |
| Union-Find | 3 | 10.7% | 2.5% |
| Counting | 2 | 7.1% | 1.2% |
| Heap (Priority Queue) | 2 | 7.1% | 2.1% |
| Monotonic Stack | 2 | 7.1% | 1.2% |
| Number Theory | 2 | 7.1% | 1.0% |
| Segment Tree | 2 | 7.1% | 1.2% |
| Simulation | 2 | 7.1% | 2.4% |
| Sorting | 2 | 7.1% | 1.8% |
| Stack | 2 | 7.1% | 1.2% |
| Trie | 2 | 7.1% | 1.1% |
| Binary Indexed Tree | 1 | 3.6% | 0.9% |
| Binary Search Tree | 1 | 3.6% | 0.9% |
| Binary Tree | 1 | 3.6% | 0.9% |
| Geometry | 1 | 3.6% | 1.2% |
| Graph Theory | 1 | 3.6% | 0.9% |
| Hash Function | 1 | 3.6% | 0.4% |
| Memoization | 1 | 3.6% | 1.2% |
| Monotonic Queue | 1 | 3.6% | 0.4% |
| Ordered Set | 1 | 3.6% | 0.9% |
| Queue | 1 | 3.6% | 0.4% |
| Rolling Hash | 1 | 3.6% | 0.4% |
| String | 1 | 3.6% | 0.4% |
| String Matching | 1 | 3.6% | 0.4% |
| Two Pointers | 1 | 3.6% | 0.7% |
Practice a Medianet interview
Take a realistic AI-led mock interview with questions Medianet actually asks, with live voice and real feedback.
Start a mock interviewYour first interview is free · no credit card required