arrayMaxConsecutiveSum

My solution:

int arrayMaxConsecutiveSum(int[] inputArray, int k) 
{
    var max = 0;
    var rem = 0;
    for (var i = 0; i <= inputArray.Length - k; i++)
    {
        if (i == 0)
            rem = inputArray.Where((i1, i2) => i2 >= i && i2 < i + k).Sum();
        else
            rem = rem + inputArray[i + k - 1] - inputArray[i - 1];

        max = Math.Max(rem, max);
    }

    return max;
}

Previous Next

differentSymbolsNaive

My solution:

int differentSymbolsNaive(string s) 
{
    return s.Distinct().Count();
}

Previous Next

firstDigit

My solution:

char firstDigit(string inputString) 
{
    return Regex.Match(inputString, "\\d{1}").Value[0];
}

Previous Next

extractEachKth

My solution:

int[] extractEachKth(int[] inputArray, int k) 
{
    return inputArray.Where((i, i1) => i1 % k != k - 1).ToArray();
}

Previous Next