# Aliens Trick WQS Search: Practice Notes
Aliens Trick WQS Search shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Add a linear penalty to the number of parts and binary-search that penalty so a convex DP that wants exactly k parts becomes an unconstrained one.
## 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(log range) unconstrained DPs.
## Common mistake
Treating a non-convex cost as convex, which makes the penalty search land on the wrong k.
## 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 interview helper that uses your resume.