using System;

public class Program

{

​

    public void Main()

    {

        var test = new int[]{1,2,3,4,5,6,8,9};

        var testNoEvens = new int[]{ 3,5 };

        var testAllEvens = new int[] { -2, 2, 4, 6, 8 };

        var testNegatives = new int[] { 2, 6, 8, -2, 12, 3, 12, -18, 12, 12, 5 };

        var testToFurtherDescribe = new int[] { 12, -18, 12, 12, 5 };

        https://dotnetfiddle.net/SignUp

        Console.WriteLine("Sum all events Results");

        Console.WriteLine(SumAllEvens(test)); // should return 20

        Console.WriteLine(SumAllEvens(testNoEvens)); // should return 0

        Console.WriteLine(SumAllEvens(testAllEvens)); // should return 18

        Console.WriteLine(SumAllEvens(testNegatives)); // should return 44

        Console.WriteLine("Biggest Sum From Sequence Of Events");

        Console.WriteLine(BiggestSumFromSequenceOfEvens(test)); // should return 14

        Console.WriteLine(BiggestSumFromSequenceOfEvens(testNoEvens));  // should return 0

        Console.WriteLine(BiggestSumFromSequenceOfEvens(testAllEvens));  // should return 20

        Console.WriteLine(BiggestSumFromSequenceOfEvens(testNegatives));  // should return 26

        Console.WriteLine(BiggestSumFromSequenceOfEvens(testToFurtherDescribe));  // should return 24

    }

​

    //Sums all even values in the provided array

    public int SumAllEvens(int[] naNumbers)

    {

        int sumValue=0;

        //Below logic to sum the even numbers in the given input...

        for(int i=0; i<naNumbers.Length; i++)

        {

            if(naNumbers[i]%2==0) sumValue += naNumbers[i];

        }

        return sumValue;

    }

    //Returns the greatest sum of continuus even numbers in the provided array

    public int BiggestSumFromSequenceOfEvens(int[] naNumbers)

    {

        int sumValue =0;

        int previousSum=0;

        //Below logic to sum consicutive even numbers sum

        for(int i=0; i<naNumbers.Length; i++)

        {

            if(naNumbers[i]%2==0)

            {

                sumValue += naNumbers[i];                       

            }

            else if(previousSum ==0 && sumValue ==0)

                continue;

            else        

            {

                if(previousSum<sumValue)  previousSum = sumValue;

                sumValue =0;

            }

            if(sumValue < 0) sumValue =0;

        }

        if(previousSum<sumValue) 

            return sumValue;

        else

            return previousSum;       

    }

}