M

McKinsey

4 questions tracked4 with solutions
🔍
Frequency scoreSorted highest → lowest frequency✓ Our Solution = we have a detailed walkthrough

Showing 4 of 4 questions

1
MediumMaximal Score After Applying K Operations✓ Our Solution
100
ArrayGreedyHeap (Priority Queue)
LeetCode ↗64% acc.
2
MediumShortest Bridge✓ Our Solution
100
ArrayDepth-First SearchBreadth-First SearchMatrix
LeetCode ↗59% acc.
3
MediumNumber of Operations to Make Network Connected✓ Our Solution
98
Depth-First SearchBreadth-First SearchUnion FindGraph
LeetCode ↗65% acc.
4
HardMinimum One Bit Operations to Make Integers Zero✓ Our Solution
80
Dynamic ProgrammingBit ManipulationMemoization
LeetCode ↗73% acc.