Day 102

[vaskoz]

Good morning! Here's your coding interview problem for today.

This problem was asked by Lyft.

Given a list of integers and a number K, return which contiguous elements of the list sum to K.

For example, if the list is [1, 2, 3, 4, 5] and K is 9, then it should return [2, 3, 4].

[vaskoz]

I just realized this problem doesn't specify only non-negative integers. I will provide another implementation for handling negative integers.