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)
2
MediumShortest Bridgeβœ“ Our Solution
100
ArrayDepth-First SearchBreadth-First SearchMatrix
3
MediumNumber of Operations to Make Network Connectedβœ“ Our Solution
98
Depth-First SearchBreadth-First SearchUnion FindGraph
4
HardMinimum One Bit Operations to Make Integers Zeroβœ“ Our Solution
80
Dynamic ProgrammingBit ManipulationMemoization