# Unique Paths (LeetCode 62): Interview Notes

## Problem
Classic interview warm-up — confirm constraints aloud before coding.

## Approach
DP grid or combinatorics C(m+n-2, m-1) for paths down/right only.

## Complexity
Time O(mn) DP or O(min(m,n)) combo; space O(n) DP.

## Practice tip
Walk a dry-run on [https://www.linkjob.ai/](https://www.linkjob.ai/).

*Disclosure: I work on Linkjob AI.*
