# Create Maximum Number: Walkthrough

Create Maximum Number shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Pick the max subsequence of length i from nums1 and k-i from nums2, then merge them like a merge of two greedy sequences.

## 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 answer, sliding window, stack, or in-place rewrite) and why a simpler scan fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.

## Complexity

O((n+m)^3) typical.

## Common mistake

Merging like merge-sort by single values instead of the remaining suffix.

## 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 https://linkjob.ai.