IMC LeetCode Questions
8 questions all-time · 0 easy · 6 medium · 2 hard
| # | Problem | Difficulty | Frequency | Acceptance |
|---|---|---|---|---|
| 1 | Find the Safest Path in a Grid Array, Binary Search, Breadth-First Search, Union Find, Heap (Priority Queue), Matrix | Medium | 100 | 48.4% |
| 2 | Time Taken to Cross the Door Array, Queue, Simulation | Hard | 88 | 49.5% |
| 3 | Asteroid Collision Array, Stack, Simulation | Medium | 75 | 45.5% |
| 4 | Design a Stack With Increment Operation Array, Stack, Design | Medium | 68 | 80.1% |
| 5 | Maximum Side Length of a Square with Sum Less than or Equal to Threshold Array, Binary Search, Matrix, Prefix Sum | Medium | 68 | 53.5% |
| 6 | Minimum Knight Moves Breadth-First Search | Medium | 54 | 41.3% |
| 7 | Shortest Path in a Grid with Obstacles Elimination Array, Breadth-First Search, Matrix | Hard | 54 | 45.6% |
| 8 | Min Stack Stack, Design | Medium | 54 | 56.4% |
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. Acceptance is the share of submissions that pass on LeetCode. Click any question to open it on LeetCode.