# Rank Transform Of A Matrix: Study Guide
Rank Transform Of A Matrix shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Process values in increasing order. Union-Find cells that share a row or a column and have the same value so they must receive one shared rank. That rank is 1 + max(rowMax, colMax) over the group; then update those row/col maxima.
## Steps to say out loud
1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (a heap or priority queue, Union-Find, interval scheduling, bitmask DP, a topological order, or a Trie) 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
O(mn log(mn)).
## Common mistake
Ranking each cell independently from its own row and column max, which breaks ties that must share a rank.
## 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 AI job interview answers in real time.