Codility -

 A non-empty array A consisting of N integers is given. Array A represents numbers on a tape.

Any integer P, such that 0 < P < N, splits this tape into two non-empty parts: A[0], A[1], ..., A[P − 1] and A[P], A[P + 1], ..., A[N − 1].

The difference between the two parts is the value of: |(A[0] + A[1] + ... + A[P − 1]) − (A[P] + A[P + 1] + ... + A[N − 1])|

In other words, it is the absolute difference between the sum of the first part and the sum of the second part.

For example, consider array A such that:

A[0] = 3 A[1] = 1 A[2] = 2 A[3] = 4 A[4] = 3

We can split this tape in four places:

• P = 1, difference = |3 − 10| = 7
  
• P = 2, difference = |4 − 9| = 5
  
• P = 3, difference = |6 − 7| = 1
  
• P = 4, difference = |10 − 3| = 7
  

Write a function:

class Solution { public int solution(int[] A); }

that, given a non-empty array A of N integers, returns the minimal difference that can be achieved.

For example, given:

A[0] = 3 A[1] = 1 A[2] = 2 A[3] = 4 A[4] = 3

the function should return 1, as explained above.

Write an efficient algorithm for the following assumptions:

• N is an integer within the range [2..100,000];
• each element of array A is an integer within the range [−1,000..1,000].

 using System;

using System.Linq;

using System.Collections.Generic;

// you can also use other imports, for example:

// using System.Collections.Generic;

// you can write to stdout for debugging purposes, e.g.

// Console.WriteLine("this is a debug message");

class Solution {

    public int solution(int[] A) {

        // write your code in C# 6.0 with .NET 4.5 (Mono) int x = 0; int difference = 0; int d = 99; if (A.Length == 1) return 0; else if (A.Length == 1) return 0; else if (A.Length == 2) return Math.Abs(A[0] - A[1]); else { for (x = 1; x < A.Length; x++) { int sum1 = 0; int sum2 = 0; var arr1 = new ArraySegment<int>(A, 0, x).AsSpan(); foreach(var i in arr1) { sum1 += i; } var arr2 = new ArraySegment<int>(A, x, A.Length - x).AsSpan(); foreach(var i in arr2) { sum2 += i; } difference = Math.Abs(sum1 - sum2); if (difference < d) d = difference; //Console.WriteLine(string.Format("{0} - {1} = {2}", sum1, sum2, difference)); } } return d;

    }

}