Your browser (Unknown 0) is no longer supported. Some parts of the website may not work correctly. Please update your browser.

UPCOMING CHALLENGES:

CURRENT CHALLENGES:

Nickel 2018

PAST CHALLENGES

Cobaltum 2018

Ferrum 2018

Manganum 2017

Chromium 2017

Vanadium 2016

Titanium 2016

Scandium 2016

Calcium 2015

Kalium 2015

Argon 2015

Chlorum 2014

Sulphur 2014

Phosphorus 2014

Silicium 2014

Aluminium 2014

Magnesium 2014

Natrium 2014

Neon 2014

Fluorum 2014

Oxygenium 2014

Nitrogenium 2013

Carbo 2013

Boron 2013

Beryllium 2013

Lithium 2013

Helium 2013

Hydrogenium 2013

Omega 2013

Psi 2012

Chi 2012

Phi 2012

Upsilon 2012

Tau 2012

Sigma 2012

Rho 2012

Pi 2012

Omicron 2012

Xi 2012

Nu 2011

Mu 2011

Lambda 2011

Kappa 2011

Iota 2011

Theta 2011

Eta 2011

Zeta 2011

Epsilon 2011

Delta 2011

Gamma 2011

Beta 2010

Alpha 2010

Programming language:
Spoken language:

For a given array A of N integers and a sequence S of N integers from the set {−1, 1}, we define val(A, S) as follows:

val(A, S) = |

sum{ A[i]*S[i] for i = 0..N−1 }|

(Assume that the sum of zero elements equals zero.)

For a given array A, we are looking for such a sequence S that minimizes val(A,S).

Write a function:

int solution(int A[], int N);

that, given an array A of N integers, computes the minimum value of val(A,S) from all possible values of val(A,S) for all possible sequences S of N integers from the set {−1, 1}.

For example, given array:

your function should return 0, since for S = [−1, 1, −1, 1], val(A, S) = 0, which is the minimum possible value.

Assume that:

- N is an integer within the range [0..20,000];
- each element of array A is an integer within the range [−100..100].

Complexity:

- expected worst-case time complexity is O(N*max(abs(A))
^{2});- expected worst-case space complexity is O(N+sum(abs(A))), beyond input storage (not counting the storage required for input arguments).

Copyright 2009–2018 by Codility Limited. All Rights Reserved. Unauthorized copying, publication or disclosure prohibited.

For a given array A of N integers and a sequence S of N integers from the set {−1, 1}, we define val(A, S) as follows:

val(A, S) = |

sum{ A[i]*S[i] for i = 0..N−1 }|

(Assume that the sum of zero elements equals zero.)

For a given array A, we are looking for such a sequence S that minimizes val(A,S).

Write a function:

int solution(vector<int> &A);

that, given an array A of N integers, computes the minimum value of val(A,S) from all possible values of val(A,S) for all possible sequences S of N integers from the set {−1, 1}.

For example, given array:

your function should return 0, since for S = [−1, 1, −1, 1], val(A, S) = 0, which is the minimum possible value.

Assume that:

- N is an integer within the range [0..20,000];
- each element of array A is an integer within the range [−100..100].

Complexity:

- expected worst-case time complexity is O(N*max(abs(A))
^{2});- expected worst-case space complexity is O(N+sum(abs(A))), beyond input storage (not counting the storage required for input arguments).

Copyright 2009–2018 by Codility Limited. All Rights Reserved. Unauthorized copying, publication or disclosure prohibited.

For a given array A of N integers and a sequence S of N integers from the set {−1, 1}, we define val(A, S) as follows:

val(A, S) = |

sum{ A[i]*S[i] for i = 0..N−1 }|

(Assume that the sum of zero elements equals zero.)

For a given array A, we are looking for such a sequence S that minimizes val(A,S).

Write a function:

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

that, given an array A of N integers, computes the minimum value of val(A,S) from all possible values of val(A,S) for all possible sequences S of N integers from the set {−1, 1}.

For example, given array:

your function should return 0, since for S = [−1, 1, −1, 1], val(A, S) = 0, which is the minimum possible value.

Assume that:

- N is an integer within the range [0..20,000];
- each element of array A is an integer within the range [−100..100].

Complexity:

- expected worst-case time complexity is O(N*max(abs(A))
^{2});- expected worst-case space complexity is O(N+sum(abs(A))), beyond input storage (not counting the storage required for input arguments).

Copyright 2009–2018 by Codility Limited. All Rights Reserved. Unauthorized copying, publication or disclosure prohibited.

val(A, S) = |

sum{ A[i]*S[i] for i = 0..N−1 }|

(Assume that the sum of zero elements equals zero.)

For a given array A, we are looking for such a sequence S that minimizes val(A,S).

Write a function:

func Solution(A []int) int

For example, given array:

Assume that:

- N is an integer within the range [0..20,000];
- each element of array A is an integer within the range [−100..100].

Complexity:

- expected worst-case time complexity is O(N*max(abs(A))
^{2});

val(A, S) = |

sum{ A[i]*S[i] for i = 0..N−1 }|

(Assume that the sum of zero elements equals zero.)

For a given array A, we are looking for such a sequence S that minimizes val(A,S).

Write a function:

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

For example, given array:

Assume that:

- N is an integer within the range [0..20,000];
- each element of array A is an integer within the range [−100..100].

Complexity:

- expected worst-case time complexity is O(N*max(abs(A))
^{2});

val(A, S) = |

sum{ A[i]*S[i] for i = 0..N−1 }|

(Assume that the sum of zero elements equals zero.)

For a given array A, we are looking for such a sequence S that minimizes val(A,S).

Write a function:

function solution(A);

For example, given array:

Assume that:

- N is an integer within the range [0..20,000];
- each element of array A is an integer within the range [−100..100].

Complexity:

- expected worst-case time complexity is O(N*max(abs(A))
^{2});

val(A, S) = |

sum{ A[i]*S[i] for i = 0..N−1 }|

(Assume that the sum of zero elements equals zero.)

For a given array A, we are looking for such a sequence S that minimizes val(A,S).

Write a function:

function solution(A)

For example, given array:

Assume that:

- N is an integer within the range [0..20,000];
- each element of array A is an integer within the range [−100..100].

Complexity:

- expected worst-case time complexity is O(N*max(abs(A))
^{2});

val(A, S) = |

sum{ A[i]*S[i] for i = 0..N−1 }|

(Assume that the sum of zero elements equals zero.)

For a given array A, we are looking for such a sequence S that minimizes val(A,S).

Write a function:

int solution(NSMutableArray *A);

For example, given array:

Assume that:

- N is an integer within the range [0..20,000];
- each element of array A is an integer within the range [−100..100].

Complexity:

- expected worst-case time complexity is O(N*max(abs(A))
^{2});

val(A, S) = |

sum{ A[i]*S[i] for i = 0..N−1 }|

(Assume that the sum of zero elements equals zero.)

For a given array A, we are looking for such a sequence S that minimizes val(A,S).

Write a function:

function solution(A: array of longint; N: longint): longint;

For example, given array:

Assume that:

- N is an integer within the range [0..20,000];
- each element of array A is an integer within the range [−100..100].

Complexity:

- expected worst-case time complexity is O(N*max(abs(A))
^{2});

val(A, S) = |

sum{ A[i]*S[i] for i = 0..N−1 }|

(Assume that the sum of zero elements equals zero.)

For a given array A, we are looking for such a sequence S that minimizes val(A,S).

Write a function:

function solution($A);

For example, given array:

Assume that:

- N is an integer within the range [0..20,000];
- each element of array A is an integer within the range [−100..100].

Complexity:

- expected worst-case time complexity is O(N*max(abs(A))
^{2});

val(A, S) = |

sum{ A[i]*S[i] for i = 0..N−1 }|

(Assume that the sum of zero elements equals zero.)

For a given array A, we are looking for such a sequence S that minimizes val(A,S).

Write a function:

sub solution { my (@A)=@_; ... }

For example, given array:

Assume that:

- N is an integer within the range [0..20,000];
- each element of array A is an integer within the range [−100..100].

Complexity:

- expected worst-case time complexity is O(N*max(abs(A))
^{2});

val(A, S) = |

sum{ A[i]*S[i] for i = 0..N−1 }|

(Assume that the sum of zero elements equals zero.)

For a given array A, we are looking for such a sequence S that minimizes val(A,S).

Write a function:

def solution(A)

For example, given array:

Assume that:

- N is an integer within the range [0..20,000];
- each element of array A is an integer within the range [−100..100].

Complexity:

- expected worst-case time complexity is O(N*max(abs(A))
^{2});

val(A, S) = |

sum{ A[i]*S[i] for i = 0..N−1 }|

(Assume that the sum of zero elements equals zero.)

For a given array A, we are looking for such a sequence S that minimizes val(A,S).

Write a function:

def solution(a)

For example, given array:

Assume that:

- N is an integer within the range [0..20,000];
- each element of array A is an integer within the range [−100..100].

Complexity:

- expected worst-case time complexity is O(N*max(abs(A))
^{2});

val(A, S) = |

sum{ A[i]*S[i] for i = 0..N−1 }|

(Assume that the sum of zero elements equals zero.)

For a given array A, we are looking for such a sequence S that minimizes val(A,S).

Write a function:

object Solution { def solution(a: Array[Int]): Int }

For example, given array:

Assume that:

- N is an integer within the range [0..20,000];
- each element of array A is an integer within the range [−100..100].

Complexity:

- expected worst-case time complexity is O(N*max(abs(A))
^{2});

val(A, S) = |

sum{ A[i]*S[i] for i = 0..N−1 }|

(Assume that the sum of zero elements equals zero.)

For a given array A, we are looking for such a sequence S that minimizes val(A,S).

Write a function:

public func solution(inout A : [Int]) -> Int

For example, given array:

Assume that:

- N is an integer within the range [0..20,000];
- each element of array A is an integer within the range [−100..100].

Complexity:

- expected worst-case time complexity is O(N*max(abs(A))
^{2});

val(A, S) = |

sum{ A[i]*S[i] for i = 0..N−1 }|

(Assume that the sum of zero elements equals zero.)

For a given array A, we are looking for such a sequence S that minimizes val(A,S).

Write a function:

public func solution(_ A : inout [Int]) -> Int

For example, given array:

Assume that:

- N is an integer within the range [0..20,000];
- each element of array A is an integer within the range [−100..100].

Complexity:

- expected worst-case time complexity is O(N*max(abs(A))
^{2});

val(A, S) = |

sum{ A[i]*S[i] for i = 0..N−1 }|

(Assume that the sum of zero elements equals zero.)

For a given array A, we are looking for such a sequence S that minimizes val(A,S).

Write a function:

Private Function solution(A As Integer()) As Integer

For example, given array:

Assume that:

- N is an integer within the range [0..20,000];
- each element of array A is an integer within the range [−100..100].

Complexity:

- expected worst-case time complexity is O(N*max(abs(A))
^{2});

Information about upcoming challenges, solutions and lessons directly in your inbox.

© 2009–2018 Codility Ltd., registered in England and Wales (No. 7048726). VAT ID GB981191408. Registered office: 107 Cheapside, London EC2V 6DN