SubListWithExtras.cs

/* LINQ Puzzle #17 *******************************************************

Summary: Given two lists of integers, determine if the second list is found in the first while allowing values to come inbetween elements 
of the second list. In other words, can the first list be created purely by inserting integers into the second?

Sample: { 0, 1, 6, 4, 5, 6, 4, 9, 8 }, { 6, 4, 4, 8 } => true
		{ 0, 1, 6, 4, 5, 6, 4, 9, 8 }, { 0, 8 } => true
		{ 0, 1, 6, 4, 5, 6, 4, 9, 8 }, { 4, 5, 1 } => false, while all the integers are in the list, they are out of order

************************************************************************/

var first = new int[] { 0, 1, 6, 4, 5, 6, 4, 9, 8 };
var second = new int[] { 6, 4, 4, 8 };