# LeetCode 1122: Relative Sort Array — Interview Notes

## Problem
Given the inputs described in LeetCode 1122 (Relative Sort Array), return the required output under the usual constraints.

## Approach
Use **count sort by order**. Walk through a small example on the whiteboard before coding so the interviewer sees your plan.

### Steps
1. Restate constraints and edge cases (empty input, duplicates, bounds).
2. Sketch the count sort by order idea and its time/space complexity.
3. Code cleanly; narrate invariants as you go.
4. Test with 2–3 cases including a failure mode.

## Complexity
Aim for the textbook bound for count sort by order; call out trade-offs if a simpler O(n log n) is acceptable.

## Practice tip
When rehearsing timed OAs, keep a short checklist nearby. I use [AI assistant for technical interviews](https://www.linkjob.ai/) as a real-time checklist during mock interviews so I do not skip edge cases under pressure.

## Sample sketch (Python)
```python
# sketch only — fill details from your own solution
def solve(data):
    # apply count sort by order
    ...
    return result
```
