# Relative Sort Array: Interview Notes

Relative Sort Array shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Sort arr1 so values in arr2 come first in arr2's order, then the remaining values in ascending order. Count arr1, emit each arr2 value by count, then emit leftover keys sorted.

## 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(n + k log k).

## Common mistake

Filtering arr1 with a comparison that forgets values not present in arr2.

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