Scribd Logo
Upload

Welcome to Scribd!

  • 702 views

    Codility Demo Test

    Uploaded by

    Razvodnik
    The document describes finding equilibrium indices in an array. An equilibrium index is where the sum of elements with lower indices equals the sum of elements with higher indices. The task is to write a function that returns any of the equilibrium indices, or -1 if none exist, for a given integer array.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd

    Codility Demo Test

    Uploaded by

    Razvodnik
    702 views2 pages
    The document describes finding equilibrium indices in an array. An equilibrium index is where the sum of elements with lower indices equals the sum of elements with higher indices. The task is to write a function that returns any of the equilibrium indices, or -1 if none exist, for a given integer array.

    Original Description:

    Demo test before taking a real test on Codility site.

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    The document describes finding equilibrium indices in an array. An equilibrium index is where the sum of elements with lower indices equals the sum of elements with higher indices. The task is to write a function that returns any of the equilibrium indices, or -1 if none exist, for a given integer array.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    702 views2 pages

    Codility Demo Test

    Uploaded by

    Razvodnik
    The document describes finding equilibrium indices in an array. An equilibrium index is where the sum of elements with lower indices equals the sum of elements with higher indices. The task is to write a function that returns any of the equilibrium indices, or -1 if none exist, for a given integer array.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    of 2

    This is a demo task.

    A zero-indexed array A consisting of N integers is given. An equilibrium index of this array is any
    integer P such that 0 P < N and the sum of elements of lower indices is equal to the sum of
    elements of higher indices, i.e.

    A[0] + A[1] + ... + A[P1] = A[P+1] + ... + A[N2] + A[N1].

    Sum of zero elements is assumed to be equal to 0. This can happen if P = 0 or if P = N1.

    For example, consider the following array A consisting of N = 8 elements:

    A[0] = -1 A[1] = 3 A[2] = -4 A[3] = 5 A[4] = 1 A[5] = -6 A[6] = 2 A[7] = 1

    P = 1 is an equilibrium index of this array, because:

    A[0] = 1 = A[2] + A[3] + A[4] + A[5] + A[6] + A[7]

    P = 3 is an equilibrium index of this array, because:

    A[0] + A[1] + A[2] = 2 = A[4] + A[5] + A[6] + A[7]

    P = 7 is also an equilibrium index, because:

    A[0] + A[1] + A[2] + A[3] + A[4] + A[5] + A[6] = 0

    and there are no elements with indices greater than 7.

    P = 8 is not an equilibrium index, because it does not fulfill the condition 0 P < N.

    Write a function:

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

    that, given a zero-indexed array A consisting of N integers, returns any of its equilibrium indices. The
    function should return 1 if no equilibrium index exists.

    For example, given array A shown above, the function may return 1, 3 or 7, as explained above.

    Assume that:

    N is an integer within the range [0..100,000];

    each element of array A is an integer within the range [2,147,483,648..2,147,483,647].

    Complexity:

    expected worst-case time complexity is O(N);

    expected worst-case space complexity is O(N), beyond input storage (not counting the
    storage required for input arguments).

    Elements of input arrays can be modified.

    Copyright 20092017 by Codility Limited. All Rights Reserved. Unauthorized copying, publication or
    disclosure prohibited.

    using System;

    // 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)

    You might also like