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

UPCOMING CHALLENGES:

Strontium 2019

CURRENT CHALLENGES:

Rubidium 2018

PAST CHALLENGES

Arsenicum 2018

Krypton 2018

Bromum 2018

Future Mobility

Grand Challenge

Decoding Master

Digital Gold

Selenium 2018

Germanium 2018

Gallium 2018

Zinc 2018

Cuprum 2018

Cutting Complexity

Nickel 2018

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

ambitious

Calculate the shortest adjacent sequence for given array A.

Programming language:
Spoken language:

A non-empty zero-indexed array A consisting of N integers is given. Two integers P and Q are called *adjacent in array A* if there exists an index 0 ≤ K < N−1 such that:

- P = A[K] and Q = A[K+1], or
- Q = A[K] and P = A[K+1].

A non-empty zero-indexed sequence B consisting of M integers is called *adjacent in array A* if the following conditions hold:

- B[0] = A[0];
- B[M−1] = A[N−1];
- B[K] and B[K+1] are adjacent in A for 0 ≤ K < M−1.

For example, consider array A consisting of eight elements such that:

The following sequences are adjacent in array A:

- [1, 10, 6, 5, 10, 7, 5, 2];
- [1, 10, 7, 5, 2];
- [1, 10, 6, 5, 10, 6, 5, 10, 7, 5, 2];
- [1, 10, 5, 2].

The last sequence is the shortest possible sequence adjacent in array A.

Write a function

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

that, given a non-empty zero-indexed array A consisting of N integers, returns the length of the shortest sequence adjacent in array A.

For example, given array A such that:

the function should return 4, as explained above.

Write an ** efficient** algorithm for the following assumptions:

- N is an integer within the range [1..100,000];
- each element of array A is an integer within the range [−2,147,483,648..2,147,483,647].

A non-empty zero-indexed array A consisting of N integers is given. Two integers P and Q are called *adjacent in array A* if there exists an index 0 ≤ K < N−1 such that:

- P = A[K] and Q = A[K+1], or
- Q = A[K] and P = A[K+1].

A non-empty zero-indexed sequence B consisting of M integers is called *adjacent in array A* if the following conditions hold:

- B[0] = A[0];
- B[M−1] = A[N−1];
- B[K] and B[K+1] are adjacent in A for 0 ≤ K < M−1.

For example, consider array A consisting of eight elements such that:

The following sequences are adjacent in array A:

- [1, 10, 6, 5, 10, 7, 5, 2];
- [1, 10, 7, 5, 2];
- [1, 10, 6, 5, 10, 6, 5, 10, 7, 5, 2];
- [1, 10, 5, 2].

The last sequence is the shortest possible sequence adjacent in array A.

Write a function

int solution(vector<int> &A);

that, given a non-empty zero-indexed array A consisting of N integers, returns the length of the shortest sequence adjacent in array A.

For example, given array A such that:

the function should return 4, as explained above.

Write an ** efficient** algorithm for the following assumptions:

- N is an integer within the range [1..100,000];
- each element of array A is an integer within the range [−2,147,483,648..2,147,483,647].

A non-empty zero-indexed array A consisting of N integers is given. Two integers P and Q are called *adjacent in array A* if there exists an index 0 ≤ K < N−1 such that:

- P = A[K] and Q = A[K+1], or
- Q = A[K] and P = A[K+1].

A non-empty zero-indexed sequence B consisting of M integers is called *adjacent in array A* if the following conditions hold:

- B[0] = A[0];
- B[M−1] = A[N−1];
- B[K] and B[K+1] are adjacent in A for 0 ≤ K < M−1.

For example, consider array A consisting of eight elements such that:

The following sequences are adjacent in array A:

- [1, 10, 6, 5, 10, 7, 5, 2];
- [1, 10, 7, 5, 2];
- [1, 10, 6, 5, 10, 6, 5, 10, 7, 5, 2];
- [1, 10, 5, 2].

The last sequence is the shortest possible sequence adjacent in array A.

Write a function

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

that, given a non-empty zero-indexed array A consisting of N integers, returns the length of the shortest sequence adjacent in array A.

For example, given array A such that:

the function should return 4, as explained above.

Write an ** efficient** algorithm for the following assumptions:

- N is an integer within the range [1..100,000];
- each element of array A is an integer within the range [−2,147,483,648..2,147,483,647].

*adjacent in array A* if there exists an index 0 ≤ K < N−1 such that:

- P = A[K] and Q = A[K+1], or
- Q = A[K] and P = A[K+1].

*adjacent in array A* if the following conditions hold:

- B[0] = A[0];
- B[M−1] = A[N−1];
- B[K] and B[K+1] are adjacent in A for 0 ≤ K < M−1.

For example, consider array A consisting of eight elements such that:

The following sequences are adjacent in array A:

- [1, 10, 6, 5, 10, 7, 5, 2];
- [1, 10, 7, 5, 2];
- [1, 10, 6, 5, 10, 6, 5, 10, 7, 5, 2];
- [1, 10, 5, 2].

The last sequence is the shortest possible sequence adjacent in array A.

Write a function

func Solution(A []int) int

For example, given array A such that:

the function should return 4, as explained above.

Write an ** efficient** algorithm for the following assumptions:

- N is an integer within the range [1..100,000];
- each element of array A is an integer within the range [−2,147,483,648..2,147,483,647].

*adjacent in array A* if there exists an index 0 ≤ K < N−1 such that:

- P = A[K] and Q = A[K+1], or
- Q = A[K] and P = A[K+1].

*adjacent in array A* if the following conditions hold:

- B[0] = A[0];
- B[M−1] = A[N−1];
- B[K] and B[K+1] are adjacent in A for 0 ≤ K < M−1.

For example, consider array A consisting of eight elements such that:

The following sequences are adjacent in array A:

- [1, 10, 6, 5, 10, 7, 5, 2];
- [1, 10, 7, 5, 2];
- [1, 10, 6, 5, 10, 6, 5, 10, 7, 5, 2];
- [1, 10, 5, 2].

The last sequence is the shortest possible sequence adjacent in array A.

Write a function

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

For example, given array A such that:

the function should return 4, as explained above.

Write an ** efficient** algorithm for the following assumptions:

- N is an integer within the range [1..100,000];
- each element of array A is an integer within the range [−2,147,483,648..2,147,483,647].

*adjacent in array A* if there exists an index 0 ≤ K < N−1 such that:

- P = A[K] and Q = A[K+1], or
- Q = A[K] and P = A[K+1].

*adjacent in array A* if the following conditions hold:

- B[0] = A[0];
- B[M−1] = A[N−1];
- B[K] and B[K+1] are adjacent in A for 0 ≤ K < M−1.

For example, consider array A consisting of eight elements such that:

The following sequences are adjacent in array A:

- [1, 10, 6, 5, 10, 7, 5, 2];
- [1, 10, 7, 5, 2];
- [1, 10, 6, 5, 10, 6, 5, 10, 7, 5, 2];
- [1, 10, 5, 2].

The last sequence is the shortest possible sequence adjacent in array A.

Write a function

function solution(A);

For example, given array A such that:

the function should return 4, as explained above.

Write an ** efficient** algorithm for the following assumptions:

- N is an integer within the range [1..100,000];
- each element of array A is an integer within the range [−2,147,483,648..2,147,483,647].

*adjacent in array A* if there exists an index 0 ≤ K < N−1 such that:

- P = A[K] and Q = A[K+1], or
- Q = A[K] and P = A[K+1].

*adjacent in array A* if the following conditions hold:

- B[0] = A[0];
- B[M−1] = A[N−1];
- B[K] and B[K+1] are adjacent in A for 0 ≤ K < M−1.

For example, consider array A consisting of eight elements such that:

The following sequences are adjacent in array A:

- [1, 10, 6, 5, 10, 7, 5, 2];
- [1, 10, 7, 5, 2];
- [1, 10, 6, 5, 10, 6, 5, 10, 7, 5, 2];
- [1, 10, 5, 2].

The last sequence is the shortest possible sequence adjacent in array A.

Write a function

function solution(A)

For example, given array A such that:

the function should return 4, as explained above.

Write an ** efficient** algorithm for the following assumptions:

- N is an integer within the range [1..100,000];
- each element of array A is an integer within the range [−2,147,483,648..2,147,483,647].

*adjacent in array A* if there exists an index 0 ≤ K < N−1 such that:

- P = A[K] and Q = A[K+1], or
- Q = A[K] and P = A[K+1].

*adjacent in array A* if the following conditions hold:

- B[0] = A[0];
- B[M−1] = A[N−1];
- B[K] and B[K+1] are adjacent in A for 0 ≤ K < M−1.

For example, consider array A consisting of eight elements such that:

The following sequences are adjacent in array A:

- [1, 10, 6, 5, 10, 7, 5, 2];
- [1, 10, 7, 5, 2];
- [1, 10, 6, 5, 10, 6, 5, 10, 7, 5, 2];
- [1, 10, 5, 2].

The last sequence is the shortest possible sequence adjacent in array A.

Write a function

int solution(NSMutableArray *A);

For example, given array A such that:

the function should return 4, as explained above.

Write an ** efficient** algorithm for the following assumptions:

- N is an integer within the range [1..100,000];
- each element of array A is an integer within the range [−2,147,483,648..2,147,483,647].

*adjacent in array A* if there exists an index 0 ≤ K < N−1 such that:

- P = A[K] and Q = A[K+1], or
- Q = A[K] and P = A[K+1].

*adjacent in array A* if the following conditions hold:

- B[0] = A[0];
- B[M−1] = A[N−1];
- B[K] and B[K+1] are adjacent in A for 0 ≤ K < M−1.

For example, consider array A consisting of eight elements such that:

The following sequences are adjacent in array A:

- [1, 10, 6, 5, 10, 7, 5, 2];
- [1, 10, 7, 5, 2];
- [1, 10, 6, 5, 10, 6, 5, 10, 7, 5, 2];
- [1, 10, 5, 2].

The last sequence is the shortest possible sequence adjacent in array A.

Write a function

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

For example, given array A such that:

the function should return 4, as explained above.

Write an ** efficient** algorithm for the following assumptions:

- N is an integer within the range [1..100,000];
- each element of array A is an integer within the range [−2,147,483,648..2,147,483,647].

*adjacent in array A* if there exists an index 0 ≤ K < N−1 such that:

- P = A[K] and Q = A[K+1], or
- Q = A[K] and P = A[K+1].

*adjacent in array A* if the following conditions hold:

- B[0] = A[0];
- B[M−1] = A[N−1];
- B[K] and B[K+1] are adjacent in A for 0 ≤ K < M−1.

For example, consider array A consisting of eight elements such that:

The following sequences are adjacent in array A:

- [1, 10, 6, 5, 10, 7, 5, 2];
- [1, 10, 7, 5, 2];
- [1, 10, 6, 5, 10, 6, 5, 10, 7, 5, 2];
- [1, 10, 5, 2].

The last sequence is the shortest possible sequence adjacent in array A.

Write a function

function solution($A);

For example, given array A such that:

the function should return 4, as explained above.

Write an ** efficient** algorithm for the following assumptions:

- N is an integer within the range [1..100,000];
- each element of array A is an integer within the range [−2,147,483,648..2,147,483,647].

*adjacent in array A* if there exists an index 0 ≤ K < N−1 such that:

- P = A[K] and Q = A[K+1], or
- Q = A[K] and P = A[K+1].

*adjacent in array A* if the following conditions hold:

- B[0] = A[0];
- B[M−1] = A[N−1];
- B[K] and B[K+1] are adjacent in A for 0 ≤ K < M−1.

For example, consider array A consisting of eight elements such that:

The following sequences are adjacent in array A:

- [1, 10, 6, 5, 10, 7, 5, 2];
- [1, 10, 7, 5, 2];
- [1, 10, 6, 5, 10, 6, 5, 10, 7, 5, 2];
- [1, 10, 5, 2].

The last sequence is the shortest possible sequence adjacent in array A.

Write a function

def solution(A)

For example, given array A such that:

the function should return 4, as explained above.

Write an ** efficient** algorithm for the following assumptions:

- N is an integer within the range [1..100,000];
- each element of array A is an integer within the range [−2,147,483,648..2,147,483,647].

*adjacent in array A* if there exists an index 0 ≤ K < N−1 such that:

- P = A[K] and Q = A[K+1], or
- Q = A[K] and P = A[K+1].

*adjacent in array A* if the following conditions hold:

- B[0] = A[0];
- B[M−1] = A[N−1];
- B[K] and B[K+1] are adjacent in A for 0 ≤ K < M−1.

For example, consider array A consisting of eight elements such that:

The following sequences are adjacent in array A:

- [1, 10, 6, 5, 10, 7, 5, 2];
- [1, 10, 7, 5, 2];
- [1, 10, 6, 5, 10, 6, 5, 10, 7, 5, 2];
- [1, 10, 5, 2].

The last sequence is the shortest possible sequence adjacent in array A.

Write a function

def solution(a)

For example, given array A such that:

the function should return 4, as explained above.

Write an ** efficient** algorithm for the following assumptions:

- N is an integer within the range [1..100,000];
- each element of array A is an integer within the range [−2,147,483,648..2,147,483,647].

*adjacent in array A* if there exists an index 0 ≤ K < N−1 such that:

- P = A[K] and Q = A[K+1], or
- Q = A[K] and P = A[K+1].

*adjacent in array A* if the following conditions hold:

- B[0] = A[0];
- B[M−1] = A[N−1];
- B[K] and B[K+1] are adjacent in A for 0 ≤ K < M−1.

For example, consider array A consisting of eight elements such that:

The following sequences are adjacent in array A:

- [1, 10, 6, 5, 10, 7, 5, 2];
- [1, 10, 7, 5, 2];
- [1, 10, 6, 5, 10, 6, 5, 10, 7, 5, 2];
- [1, 10, 5, 2].

The last sequence is the shortest possible sequence adjacent in array A.

Write a function

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

For example, given array A such that:

the function should return 4, as explained above.

Write an ** efficient** algorithm for the following assumptions:

- N is an integer within the range [1..100,000];
- each element of array A is an integer within the range [−2,147,483,648..2,147,483,647].

*adjacent in array A* if there exists an index 0 ≤ K < N−1 such that:

- P = A[K] and Q = A[K+1], or
- Q = A[K] and P = A[K+1].

*adjacent in array A* if the following conditions hold:

- B[0] = A[0];
- B[M−1] = A[N−1];
- B[K] and B[K+1] are adjacent in A for 0 ≤ K < M−1.

For example, consider array A consisting of eight elements such that:

The following sequences are adjacent in array A:

- [1, 10, 6, 5, 10, 7, 5, 2];
- [1, 10, 7, 5, 2];
- [1, 10, 6, 5, 10, 6, 5, 10, 7, 5, 2];
- [1, 10, 5, 2].

The last sequence is the shortest possible sequence adjacent in array A.

Write a function

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

For example, given array A such that:

the function should return 4, as explained above.

Write an ** efficient** algorithm for the following assumptions:

- N is an integer within the range [1..100,000];
- each element of array A is an integer within the range [−2,147,483,648..2,147,483,647].

*adjacent in array A* if there exists an index 0 ≤ K < N−1 such that:

- P = A[K] and Q = A[K+1], or
- Q = A[K] and P = A[K+1].

*adjacent in array A* if the following conditions hold:

- B[0] = A[0];
- B[M−1] = A[N−1];
- B[K] and B[K+1] are adjacent in A for 0 ≤ K < M−1.

For example, consider array A consisting of eight elements such that:

The following sequences are adjacent in array A:

- [1, 10, 6, 5, 10, 7, 5, 2];
- [1, 10, 7, 5, 2];
- [1, 10, 6, 5, 10, 6, 5, 10, 7, 5, 2];
- [1, 10, 5, 2].

The last sequence is the shortest possible sequence adjacent in array A.

Write a function

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

For example, given array A such that:

the function should return 4, as explained above.

Write an ** efficient** algorithm for the following assumptions:

- N is an integer within the range [1..100,000];
- each element of array A is an integer within the range [−2,147,483,648..2,147,483,647].

*adjacent in array A* if there exists an index 0 ≤ K < N−1 such that:

- P = A[K] and Q = A[K+1], or
- Q = A[K] and P = A[K+1].

*adjacent in array A* if the following conditions hold:

- B[0] = A[0];
- B[M−1] = A[N−1];
- B[K] and B[K+1] are adjacent in A for 0 ≤ K < M−1.

For example, consider array A consisting of eight elements such that:

The following sequences are adjacent in array A:

- [1, 10, 6, 5, 10, 7, 5, 2];
- [1, 10, 7, 5, 2];
- [1, 10, 6, 5, 10, 6, 5, 10, 7, 5, 2];
- [1, 10, 5, 2].

The last sequence is the shortest possible sequence adjacent in array A.

Write a function

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

For example, given array A such that:

the function should return 4, as explained above.

Write an ** efficient** algorithm for the following assumptions:

- N is an integer within the range [1..100,000];
- each element of array A is an integer within the range [−2,147,483,648..2,147,483,647].

*adjacent in array A* if there exists an index 0 ≤ K < N−1 such that:

- P = A[K] and Q = A[K+1], or
- Q = A[K] and P = A[K+1].

*adjacent in array A* if the following conditions hold:

- B[0] = A[0];
- B[M−1] = A[N−1];
- B[K] and B[K+1] are adjacent in A for 0 ≤ K < M−1.

For example, consider array A consisting of eight elements such that:

The following sequences are adjacent in array A:

- [1, 10, 6, 5, 10, 7, 5, 2];
- [1, 10, 7, 5, 2];
- [1, 10, 6, 5, 10, 6, 5, 10, 7, 5, 2];
- [1, 10, 5, 2].

The last sequence is the shortest possible sequence adjacent in array A.

Write a function

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

For example, given array A such that:

the function should return 4, as explained above.

Write an ** efficient** algorithm for the following assumptions:

- N is an integer within the range [1..100,000];
- each element of array A is an integer within the range [−2,147,483,648..2,147,483,647].

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

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