# Higher Rank Complete Easy: Explained
Higher Rank Complete Easy shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Use a bidirectional system with a special application rule so higher-rank annotations are checked without a full impredicative instantiation search.
## 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
The Complete and Easy system type-checks in polynomial time for the predicative fragment.
## Common mistake
Instantiating a higher-rank argument with a type that itself contains a forall, which the predicative system rejects.
## 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.