Self-rated CS fundamentals: OOP diamond problem, DBMS dependencies and MSTs
Filed under McKinsey
The question
The CTO asked the candidate to rate themselves across OOPs, OS, DBMS, CN, DSA and DAA, then asked about the multiple inheritance diamond problem and polymorphism, DBMS anomalies, minimal cover and functional dependencies, and spanning trees with Prim's and Kruskal's algorithms.
No write-up yet. Related questions below have one.
Related McKinsey questions
Collected from public candidate posts and coding forums. Updated Nov 2026.