Courses
π PYQ
πΌ Interview
Sign in
Interview Prep
/
Companies
/
McKinsey
M
McKinsey
4 questions tracked
4 with solutions
π
All Time
4
π
Last 6 Months
0
π₯
Last 3 Months
0
β‘
Last 30 Days
0
π
All
Easy
Medium
Hard
Frequency score
Sorted highest β lowest frequency
β Our Solution = we have a detailed walkthrough
Showing 4 of 4 questions
1
Medium
Maximal Score After Applying K Operations
β Our Solution
100
Array
Greedy
Heap (Priority Queue)
LeetCode β
64% acc.
2
Medium
Shortest Bridge
β Our Solution
100
Array
Depth-First Search
Breadth-First Search
Matrix
LeetCode β
59% acc.
3
Medium
Number of Operations to Make Network Connected
β Our Solution
98
Depth-First Search
Breadth-First Search
Union Find
Graph
LeetCode β
65% acc.
4
Hard
Minimum One Bit Operations to Make Integers Zero
β Our Solution
80
Dynamic Programming
Bit Manipulation
Memoization
LeetCode β
73% acc.