IMC interview questions¶
The most frequent LeetCode problems tagged to IMC. This is a data-only page. For process and behavioral prep, use the coding guide and behavioral guide.
Based on 3 distinct problems tagged to IMC in the last 6 months (1 in the last 30 days, 2 in the last 3 months, 8 all-time) across two open datasets of LeetCode company tags. Tags are user-reported, so treat frequency as a signal, not a promise.
Difficulty mix (last 6 months): Hard 67%, Medium 33%
Most tagged topics (share of problems): Hash Table 33%, Linked List 33%, Design 33%, Doubly-Linked List 33%, Array 33%, Dynamic Programming 33%, Matrix 33%, String 33%, Divide and Conquer 33%, Sorting 33%
Watch out: IMC has thin LeetCode data. Weight the reported questions and the format notes above more than this list.
Most frequent problems¶
Ranked by frequency, weighted toward the last 30 days. Classics like Two Sum sit near the top of almost every company's list because users tag them everywhere. Solve those fast. The signature list below is more specific to this company.
| # | Problem | Difficulty | Last seen | Topics |
|---|---|---|---|---|
| 1 | LFU Cache | Hard | 30 days | Hash Table, Linked List, Design, Doubly-Linked List |
| 2 | Unique Paths II | Medium | 3 months | Array, Dynamic Programming, Matrix |
| 3 | Special Binary String | Hard | 6 months | String, Divide and Conquer, Sorting |
Signature problems¶
Problems where IMC accounts for a large share of all recent tags across companies. These are the most IMC-specific questions in the data.
| # | Problem | Difficulty | Last seen | Topics |
|---|---|---|---|---|
| 1 | Unique Paths II | Medium | 3 months | Array, Dynamic Programming, Matrix |
| 2 | Special Binary String | Hard | 6 months | String, Divide and Conquer, Sorting |
Sources¶
- liquidslr/leetcode-company-wise-problems and snehasishroy/leetcode-companywise-interview-questions, merged by scripts/build_question_data.py.
Next: More companies