Apple & Chell | Character dialogue

Chell

Apple, I heard you obsess over flawless code. Ever tried to build a puzzle that forces a machine to fail? I can create one that’ll make your Mac run like a hamster. Think you can solve it?

Apple

Sounds like a fun test—send me the puzzle and I’ll run through it faster than a MacBook can boot. Just remember, the real challenge is making it work perfectly the first time.

Chell

Here’s a quick one for you: you’re given an array of integers and you need to find the maximum sum of any contiguous subarray. Write a function in Python that returns that sum. Do it in O(n) time. If you can do it faster than the computer’s own optimizations, I’ll be impressed.

Apple

Here’s a clean, O(n) solution with Kadane’s algorithm. It runs in a single pass and never misses a peak. ```python def max_subarray(nums): best = current = nums[0] for n in nums[1:]: current = max(n, current + n) best = max(best, current) return best ```

Chell

Nice, but throw a test at it—an array of all negatives. If it still spits out the right result, you’ve earned a nod. If not, I’ll be the one to teach you the hard way.

Apple

Try it with [-3, -5, -2, -9]. The function returns -2, which is the largest element and the correct maximum subarray sum for all‑negative inputs.

Chell

That passes the negative test. Next up: give me a mix of positives, negatives, and zeros. Can you still keep that edge?

Apple

Sure thing—take this mix of values: 2, -1, 3, 4, -5, 6, 0. The biggest contiguous block is [2, –1, 3, 4] which adds up to 8, and the function will return 8 as the maximum subarray sum.