This solution doesn't work properly with double input data.
for examlple try volume = 0.027, side = 0.3
You have to consider accuracy range.

Needs random tests ;-)

Beautiful, clear, efficient solution.
Love the way you avoided writing small loops using Linq and string manipulation: you achieve code readability without losing efficiency.
The only for loop remaining was unavoidable, and yet the code remains very clean. Congrats.

¯_(ツ)_/¯

That's cheating.

I like how you "converted" the list to a tuple

The Stream you're talking about comes from the definition often used in functional languages, except that nobody else uses Stream in that manner. What Stream means by them and every other language is actually Pipes in Haskell: A data structure-y thing able to act as a Producer (generator), Consumer (iteratee), Pipe or stuff.

Anyways: https://msdn.microsoft.com/en-us/library/system.io.stream(v=vs.110).aspx

The most used Streams in C# are MemoryStream (a Stream held in memory, for reading from other arbitrary streams that might have be and ) and FileStream. Lots of other libraries and such implement their own Streams too, because data transfer in C# are very often utilized by Stream classes, and that Streams are much more widely used than in, say, Java.

I'm not too familiar with C#. Could you give some examples?

Don't forget that C# has various Streams too ;-)

My solution MinMax also gets time out error.
But there is less than 20K possible positions.
Use a cache !

I believe the "List.append" to be O(x) (the x in xbonacci is the size of the list).
Maybe a Queue is more efficient..
Do the sum is also O(x), memorize the last sum, substract the outgoing value and add the previous result is a clever option.

It should be.
Actually, with laziness the tests doesn't pass.