Python: When should a Python developer choose Graphs and Adjacency Lists deliberately?

Difficulty:

Medium

Questions:

1

Time Limit:

2 minutes

Passing Score:

100%

Question

When should a Python developer choose Graphs and Adjacency Lists deliberately?

  1. Use adjacency lists for traversal, dependency, and connectivity problems where the edge set is sparse relative to all possible pairs.
  2. Choose Graphs and Adjacency Lists mainly when you want to postpone validation and fix issues manually later.
  3. Choose Graphs and Adjacency Lists whenever you want the code to look more advanced, even if the design gets less clear.
  4. Choose Graphs and Adjacency Lists only to avoid modeling the real data shape or domain contract explicitly.

Hint

Think about the production scenario where the choice genuinely improves the code.

Answer and rationale

Correct answer: A. Use adjacency lists for traversal, dependency, and connectivity problems where the edge set is sparse relative to all possible pairs.

Use adjacency lists for traversal, dependency, and connectivity problems where the edge set is sparse relative to all possible pairs. Interviewers often ask this to see whether you can connect the concept to real design decisions.

Track: Python