static void Main(string[] args)
int[] arr = { 4, 5, 6, 1, 4, };
Console.WriteLine(EvenOddSum(arr));
Node<int> node = LstfromArr(arr);
public static Node<T> LstfromArr<T>(T[] arr)
Node<T> start = new Node<T>(arr[0]);
for (int i = 1; i < arr.Length; i++)
last.SetNext(new Node<T>(arr[i]));
public static int EvenOddSum(int[] arr, int i=0, int evenSum=0, int oddSum=0)
if ((evenSum + oddSum) % 2 == 0)
return EvenOddSum(arr, i + 1, evenSum, oddSum);
public static int DividesSum(int[] arr, int sum=0, int i=0)
sum = DividesSum(arr, sum + arr[i], i + 1);
Console.WriteLine(arr[i]);
public static Node<int> RemoveDups(Node<int> list)
Node<int> newList = new Node<int>(list.GetValue());
Node<int> ogPos = list.GetNext();
Node<int> newPos = newList;
if(newPos.GetValue() != ogPos.GetValue())
newPos.SetNext(ogPos.GetNext());