# Find Kth Largest XOR Coordinate Value: Interview Notes

Find Kth Largest XOR Coordinate Value shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

pref[i][j] = XOR of the rectangle (0,0)..(i,j) via pref[i-1][j] ^ pref[i][j-1] ^ pref[i-1][j-1] ^ matrix[i][j]. Collect every pref value and return the k-th largest (quickselect or a heap).

## 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

O(mn) expected with quickselect.

## Common mistake

XORing only the current row or forgetting the inclusion-exclusion term pref[i-1][j-1].

## 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 interview assistant.