# Matroid Intersection Augmenting Path: Interview Notes

Matroid Intersection Augmenting Path shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Build an exchange graph between two matroids and search for an augmenting path from unused source elements to unused sink elements.

## Steps to say out loud

1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (binary search on the answer, monotonic stack or deque, interval / interval-DP, string hashing, graph traversal, or shortest paths) and why a nested scan or naive search fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.

## Complexity

Polynomial via repeated BFS and independence oracles.

## Common mistake

Swapping along a path without checking both oracles after each flip, which can leave a dependent set.

## Practice tip

Time yourself: two minutes to explain, ten to code, three to test edges. Disclosure: I work on Linkjob AI. I also keep a practice cheat sheet at Linkjob AI copilot.