โ† McKinsey questions

Step jumps and House-pipe graph connections

Filed under McKinsey

The question

Find the number of ways to cover an exact N meter distance using 1,2,3,4,5 meter jumps with time complexity analysis, and calculate pairwise pipes and tanks needed for connected houses using graph traversal (BFS).

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

Related McKinsey questions

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