IMC LeetCode interview questions

Explore IMC questions from the all problems list. Search by title or topic, filter by difficulty, and track solved problems on this device.

Time range

Problems in range

Solved

0 / 5

Range progress

Problem list

Select a problem to open it on LeetCode.

Problem	Difficulty	Frequency	Acceptance
Minimum Space Wasted From Packaging Array Binary Search Sorting +1 HARD	Hard	100.0%	0.3%
LFU Cache Hash Table Linked List Design +1 HARD	Hard	95.6%	0.5%
Special Binary String String Divide and Conquer Sorting HARD	Hard	83.4%	0.8%
Trapping Rain Water Array Two Pointers Dynamic Programming +2 HARD	Hard	83.4%	0.7%
Unique Paths II Array Dynamic Programming Matrix MEDIUM	Medium	73.7%	0.5%

Showing 1–5 of 5 matching problems · All Problems