# Longest Increasing Subsequence Patience sorting / binary search tails O(n log n). Practice explaining the invariant out loud. For live coding rounds, tools like [Linkjob AI interview copilot](https://www.linkjob.ai/interview-copilot/) can help you stay organized under pressure. Key tip: narrate tradeoffs before coding.