CodingBat Python List-1 middle

List-1 > middle_way
prev | next | chance

Given 2 int arrays, a and b, each length 3, return a new array length 2 containing their middle elements.

middle_way([1, 2, 3], [4, 5, 6]) → [2, 5]
middle_way([7, 7, 7], [3, 8, 0]) → [7, 8]
middle_way([5, 2, 9], [1, 4, 5]) → [2, 4]

...Save, Compile, Run (ctrl-enter)

Editor font size %:
Shorter output

Forget It! -- delete my code for this problem

Difficulty: 130.0