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:
A[0] = 1 A[1] = 10 A[2] = 6
A[3] = 5 A[4] = 10 A[5] = 7
A[6] = 5 A[7] = 2
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:
A[0] = 1 A[1] = 10 A[2] = 6
A[3] = 5 A[4] = 10 A[5] = 7
A[6] = 5 A[7] = 2
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].
Copyright 2009–2024 by Codility Limited. All Rights Reserved. Unauthorized copying, publication or disclosure prohibited.
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:
A[0] = 1 A[1] = 10 A[2] = 6
A[3] = 5 A[4] = 10 A[5] = 7
A[6] = 5 A[7] = 2
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:
A[0] = 1 A[1] = 10 A[2] = 6
A[3] = 5 A[4] = 10 A[5] = 7
A[6] = 5 A[7] = 2
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].
Copyright 2009–2024 by Codility Limited. All Rights Reserved. Unauthorized copying, publication or disclosure prohibited.
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:
A[0] = 1 A[1] = 10 A[2] = 6
A[3] = 5 A[4] = 10 A[5] = 7
A[6] = 5 A[7] = 2
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:
A[0] = 1 A[1] = 10 A[2] = 6
A[3] = 5 A[4] = 10 A[5] = 7
A[6] = 5 A[7] = 2
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].
Copyright 2009–2024 by Codility Limited. All Rights Reserved. Unauthorized copying, publication or disclosure prohibited.
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:
A[0] = 1 A[1] = 10 A[2] = 6
A[3] = 5 A[4] = 10 A[5] = 7
A[6] = 5 A[7] = 2
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(List<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:
A[0] = 1 A[1] = 10 A[2] = 6
A[3] = 5 A[4] = 10 A[5] = 7
A[6] = 5 A[7] = 2
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].
Copyright 2009–2024 by Codility Limited. All Rights Reserved. Unauthorized copying, publication or disclosure prohibited.
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:
A[0] = 1 A[1] = 10 A[2] = 6
A[3] = 5 A[4] = 10 A[5] = 7
A[6] = 5 A[7] = 2
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
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:
A[0] = 1 A[1] = 10 A[2] = 6
A[3] = 5 A[4] = 10 A[5] = 7
A[6] = 5 A[7] = 2
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].
Copyright 2009–2024 by Codility Limited. All Rights Reserved. Unauthorized copying, publication or disclosure prohibited.
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:
A[0] = 1 A[1] = 10 A[2] = 6
A[3] = 5 A[4] = 10 A[5] = 7
A[6] = 5 A[7] = 2
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:
A[0] = 1 A[1] = 10 A[2] = 6
A[3] = 5 A[4] = 10 A[5] = 7
A[6] = 5 A[7] = 2
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].
Copyright 2009–2024 by Codility Limited. All Rights Reserved. Unauthorized copying, publication or disclosure prohibited.
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:
A[0] = 1 A[1] = 10 A[2] = 6
A[3] = 5 A[4] = 10 A[5] = 7
A[6] = 5 A[7] = 2
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:
A[0] = 1 A[1] = 10 A[2] = 6
A[3] = 5 A[4] = 10 A[5] = 7
A[6] = 5 A[7] = 2
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].
Copyright 2009–2024 by Codility Limited. All Rights Reserved. Unauthorized copying, publication or disclosure prohibited.
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:
A[0] = 1 A[1] = 10 A[2] = 6
A[3] = 5 A[4] = 10 A[5] = 7
A[6] = 5 A[7] = 2
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);
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:
A[0] = 1 A[1] = 10 A[2] = 6
A[3] = 5 A[4] = 10 A[5] = 7
A[6] = 5 A[7] = 2
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].
Copyright 2009–2024 by Codility Limited. All Rights Reserved. Unauthorized copying, publication or disclosure prohibited.
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:
A[0] = 1 A[1] = 10 A[2] = 6
A[3] = 5 A[4] = 10 A[5] = 7
A[6] = 5 A[7] = 2
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
fun solution(A: IntArray): Int
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:
A[0] = 1 A[1] = 10 A[2] = 6
A[3] = 5 A[4] = 10 A[5] = 7
A[6] = 5 A[7] = 2
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].
Copyright 2009–2024 by Codility Limited. All Rights Reserved. Unauthorized copying, publication or disclosure prohibited.
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:
A[0] = 1 A[1] = 10 A[2] = 6
A[3] = 5 A[4] = 10 A[5] = 7
A[6] = 5 A[7] = 2
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)
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:
A[0] = 1 A[1] = 10 A[2] = 6
A[3] = 5 A[4] = 10 A[5] = 7
A[6] = 5 A[7] = 2
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].
Copyright 2009–2024 by Codility Limited. All Rights Reserved. Unauthorized copying, publication or disclosure prohibited.
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:
A[0] = 1 A[1] = 10 A[2] = 6
A[3] = 5 A[4] = 10 A[5] = 7
A[6] = 5 A[7] = 2
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);
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:
A[0] = 1 A[1] = 10 A[2] = 6
A[3] = 5 A[4] = 10 A[5] = 7
A[6] = 5 A[7] = 2
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].
Copyright 2009–2024 by Codility Limited. All Rights Reserved. Unauthorized copying, publication or disclosure prohibited.
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:
A[0] = 1 A[1] = 10 A[2] = 6
A[3] = 5 A[4] = 10 A[5] = 7
A[6] = 5 A[7] = 2
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;
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:
A[0] = 1 A[1] = 10 A[2] = 6
A[3] = 5 A[4] = 10 A[5] = 7
A[6] = 5 A[7] = 2
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].
Copyright 2009–2024 by Codility Limited. All Rights Reserved. Unauthorized copying, publication or disclosure prohibited.
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:
A[0] = 1 A[1] = 10 A[2] = 6
A[3] = 5 A[4] = 10 A[5] = 7
A[6] = 5 A[7] = 2
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);
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:
A[0] = 1 A[1] = 10 A[2] = 6
A[3] = 5 A[4] = 10 A[5] = 7
A[6] = 5 A[7] = 2
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].
Copyright 2009–2024 by Codility Limited. All Rights Reserved. Unauthorized copying, publication or disclosure prohibited.
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:
A[0] = 1 A[1] = 10 A[2] = 6
A[3] = 5 A[4] = 10 A[5] = 7
A[6] = 5 A[7] = 2
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)
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:
A[0] = 1 A[1] = 10 A[2] = 6
A[3] = 5 A[4] = 10 A[5] = 7
A[6] = 5 A[7] = 2
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].
Copyright 2009–2024 by Codility Limited. All Rights Reserved. Unauthorized copying, publication or disclosure prohibited.
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:
A[0] = 1 A[1] = 10 A[2] = 6
A[3] = 5 A[4] = 10 A[5] = 7
A[6] = 5 A[7] = 2
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)
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:
A[0] = 1 A[1] = 10 A[2] = 6
A[3] = 5 A[4] = 10 A[5] = 7
A[6] = 5 A[7] = 2
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].
Copyright 2009–2024 by Codility Limited. All Rights Reserved. Unauthorized copying, publication or disclosure prohibited.
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:
A[0] = 1 A[1] = 10 A[2] = 6
A[3] = 5 A[4] = 10 A[5] = 7
A[6] = 5 A[7] = 2
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 }
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:
A[0] = 1 A[1] = 10 A[2] = 6
A[3] = 5 A[4] = 10 A[5] = 7
A[6] = 5 A[7] = 2
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].
Copyright 2009–2024 by Codility Limited. All Rights Reserved. Unauthorized copying, publication or disclosure prohibited.
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:
A[0] = 1 A[1] = 10 A[2] = 6
A[3] = 5 A[4] = 10 A[5] = 7
A[6] = 5 A[7] = 2
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
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:
A[0] = 1 A[1] = 10 A[2] = 6
A[3] = 5 A[4] = 10 A[5] = 7
A[6] = 5 A[7] = 2
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].
Copyright 2009–2024 by Codility Limited. All Rights Reserved. Unauthorized copying, publication or disclosure prohibited.
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:
A[0] = 1 A[1] = 10 A[2] = 6
A[3] = 5 A[4] = 10 A[5] = 7
A[6] = 5 A[7] = 2
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: number[]): number;
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:
A[0] = 1 A[1] = 10 A[2] = 6
A[3] = 5 A[4] = 10 A[5] = 7
A[6] = 5 A[7] = 2
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].
Copyright 2009–2024 by Codility Limited. All Rights Reserved. Unauthorized copying, publication or disclosure prohibited.
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:
A[0] = 1 A[1] = 10 A[2] = 6
A[3] = 5 A[4] = 10 A[5] = 7
A[6] = 5 A[7] = 2
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
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:
A[0] = 1 A[1] = 10 A[2] = 6
A[3] = 5 A[4] = 10 A[5] = 7
A[6] = 5 A[7] = 2
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].
Copyright 2009–2024 by Codility Limited. All Rights Reserved. Unauthorized copying, publication or disclosure prohibited.
