Global management consulting firm.

Problem Statistics
Breakdown of 4 problems.

Difficulty Distribution

(3)
(1)

Recency Distribution

(4)

Most Common Tags (Top 7)

Array (2)
Depth-First Search (2)
Breadth-First Search (2)
Greedy (1)
Heap (Priority Queue) (1)
Dynamic Programming (1)
Bit Manipulation (1)
Coding Interview Problems for McKinsey
4
Maximal Score After Applying K Operations
3-6 months ago
Medium

Topics

Array
Greedy
Heap (Priority Queue)
Trending
Recent
Mock
Minimum One Bit Operations to Make Integers Zero
3-6 months ago
Hard

Topics

Dynamic Programming
Bit Manipulation
Memoization
Trending
Recent
Mock
Number of Operations to Make Network Connected
3-6 months ago
Medium

Topics

Depth-First Search
Breadth-First Search
Union Find
Graph
Trending
Recent
Mock
Shortest Bridge
3-6 months ago
Medium

Topics

Array
Depth-First Search
Breadth-First Search
Matrix
Trending
Recent
Mock

You've reached the end!