# Maximum Score Of Spliced Array: Practice Notes

Maximum Score Of Spliced Array shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

You may swap one aligned subarray between nums1 and nums2. The best sum for nums1 is sum(nums1) plus Kadane of (nums2-nums1). Also try the symmetric swap onto nums2.

## 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(n).

## Common mistake

Allowing several disjoint swapped segments, or running Kadane on the raw arrays.

## 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 multilingual AI interview assistant.