JobsJob TrackerJob alerts

McKinsey · 18 questions

All 18Coding 15Product Sense 1
  • Convert binary linked list and SQL even scoresCoding
  • Step jumps and House-pipe graph connectionsCoding
  • Merge Overlapping IntervalsCoding
  • DP ProblemCoding
  • Longest Palindromic SubstringCoding
  • Reverse Linked ListCoding
  • Product Launch AnalysisProduct Sense
  • 0/1 knapsack variant returning the maximum quantityCoding
  • Medium-level bit manipulation problemCoding
  • Minimum cost to reach each city using two bus lines with switching costCoding
  • Search in a rotated sorted arrayCoding
  • Self-rated CS fundamentals: OOP diamond problem, DBMS dependencies and MSTs
  • Count number of groupsCoding
  • Shortest time to move productCoding
  • Computer Science Fundamentals
  • Minimum JumpsCoding
  • Merge Sort ExplanationCoding
  • Linked List and Hash MapsCoding
← McKinsey questions
  1. Interview questions
  2. McKinsey
  3. Merge Sort Explanation
Coding

Merge Sort Explanation

Filed under McKinsey · Also reported at Nasdaq

The question

Explain the algorithm of merge sort with an example on a whiteboard.

No write-up yet. Related questions below have one.

Related McKinsey questions

  • Convert binary linked list and SQL even scores
  • Step jumps and House-pipe graph connections
  • 0/1 knapsack variant returning the maximum quantity
  • Medium-level bit manipulation problem
  • Minimum cost to reach each city using two bus lines with switching cost
← Minimum JumpsLinked List and Hash Maps →

Collected from public candidate posts and coding forums. Updated Nov 2026.