Test results - Codility

Tasks Details

medium

1. Peaks

Divide an array into the maximum number of same-sized blocks, each of which should contain an index P such that A[P - 1] < A[P] > A[P + 1].

100%

A non-empty array A consisting of N integers is given.

A peak is an array element which is larger than its neighbors. More precisely, it is an index P such that 0 < P < N − 1, A[P − 1] < A[P] and A[P] > A[P + 1].

For example, the following array A:

A[0] = 1 A[1] = 2 A[2] = 3 A[3] = 4 A[4] = 3 A[5] = 4 A[6] = 1 A[7] = 2 A[8] = 3 A[9] = 4 A[10] = 6 A[11] = 2

has exactly three peaks: 3, 5, 10.

We want to divide this array into blocks containing the same number of elements. More precisely, we want to choose a number K that will yield the following blocks:

A[0], A[1], ..., A[K − 1],

A[K], A[K + 1], ..., A[2K − 1],
...

A[N − K], A[N − K + 1], ..., A[N − 1].

What's more, every block should contain at least one peak. Notice that extreme elements of the blocks (for example A[K − 1] or A[K]) can also be peaks, but only if they have both neighbors (including one in an adjacent blocks).

The goal is to find the maximum number of blocks into which the array A can be divided.

Array A can be divided into blocks as follows:

one block (1, 2, 3, 4, 3, 4, 1, 2, 3, 4, 6, 2). This block contains three peaks.

two blocks (1, 2, 3, 4, 3, 4) and (1, 2, 3, 4, 6, 2). Every block has a peak.

three blocks (1, 2, 3, 4), (3, 4, 1, 2), (3, 4, 6, 2). Every block has a peak. Notice in particular that the first block (1, 2, 3, 4) has a peak at A[3], because A[2] < A[3] > A[4], even though A[4] is in the adjacent block.

However, array A cannot be divided into four blocks, (1, 2, 3), (4, 3, 4), (1, 2, 3) and (4, 6, 2), because the (1, 2, 3) blocks do not contain a peak. Notice in particular that the (4, 3, 4) block contains two peaks: A[3] and A[5].

The maximum number of blocks that array A can be divided into is three.

Write a function:

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

that, given a non-empty array A consisting of N integers, returns the maximum number of blocks into which A can be divided.

If A cannot be divided into some number of blocks, the function should return 0.

For example, given:

A[0] = 1 A[1] = 2 A[2] = 3 A[3] = 4 A[4] = 3 A[5] = 4 A[6] = 1 A[7] = 2 A[8] = 3 A[9] = 4 A[10] = 6 A[11] = 2

the function should return 3, 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 [0..1,000,000,000].

Solution

Programming language used Java 8

Time spent on task 1 minutes

Notes

not defined yet

Task timeline

Code: 09:25:13 UTC, java, verify, result: Passed

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36

// you can also use imports, for example:
// import java.util.*;

// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");

class Solution {
    public int solution(int[] A) {
		int[] peaks = getPeaks(A);
		for (int idx = A.length; idx >= 1; idx--) {
			if (A.length % idx == 0) {
				int blockSize = A.length / idx;
				int blockCount = 0;
				for (int peakIndex : peaks) {
					if (peakIndex != 0 && peakIndex / blockSize == blockCount) {
						blockCount++;
					}
				}
				if (blockCount == idx) {
					return blockCount;
				}
			}
		}
		// If A cannot be divided into some number of blocks, the function should return 0.
        return 0;
    }
	private int[] getPeaks(int[] A) {
		int[] peaks = new int[A.length];
		for (int idx = 1; idx < A.length - 1; idx++) {
			if (A[idx - 1] < A[idx] && A[idx] > A[idx + 1]) {
				peaks[idx] = idx;
			}
		}
		return peaks;
	}
}

Analysis

▶

example
example test

✔

Code: 09:25:20 UTC, java, verify, result: Passed

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36

// you can also use imports, for example:
// import java.util.*;

// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");

class Solution {
    public int solution(int[] A) {
		int[] peaks = getPeaks(A);
		for (int idx = A.length; idx >= 1; idx--) {
			if (A.length % idx == 0) {
				int blockSize = A.length / idx;
				int blockCount = 0;
				for (int peakIndex : peaks) {
					if (peakIndex != 0 && peakIndex / blockSize == blockCount) {
						blockCount++;
					}
				}
				if (blockCount == idx) {
					return blockCount;
				}
			}
		}
		// If A cannot be divided into some number of blocks, the function should return 0.
        return 0;
    }
	private int[] getPeaks(int[] A) {
		int[] peaks = new int[A.length];
		for (int idx = 1; idx < A.length - 1; idx++) {
			if (A[idx - 1] < A[idx] && A[idx] > A[idx + 1]) {
				peaks[idx] = idx;
			}
		}
		return peaks;
	}
}

Analysis

▶

example
example test

✔

Code: 09:25:25 UTC, java, final, score: 100

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36

// you can also use imports, for example:
// import java.util.*;

// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");

class Solution {
    public int solution(int[] A) {
		int[] peaks = getPeaks(A);
		for (int idx = A.length; idx >= 1; idx--) {
			if (A.length % idx == 0) {
				int blockSize = A.length / idx;
				int blockCount = 0;
				for (int peakIndex : peaks) {
					if (peakIndex != 0 && peakIndex / blockSize == blockCount) {
						blockCount++;
					}
				}
				if (blockCount == idx) {
					return blockCount;
				}
			}
		}
		// If A cannot be divided into some number of blocks, the function should return 0.
        return 0;
    }
	private int[] getPeaks(int[] A) {
		int[] peaks = new int[A.length];
		for (int idx = 1; idx < A.length - 1; idx++) {
			if (A[idx - 1] < A[idx] && A[idx] > A[idx + 1]) {
				peaks[idx] = idx;
			}
		}
		return peaks;
	}
}

Analysis summary

The solution obtained perfect score.

Analysis

Detected time complexity:

O(N * log(log(N)))

▶

example
example test

✔

▶

extreme_min
extreme min test

✔

▶

extreme_without_peaks
test without peaks

✔

▶

prime_length
test with prime sequence length

✔

▶

anti_bin_search
anti bin_search test

✔

▶

simple1
simple test

✔

▶

simple2
second simple test

✔

▶

medium_random
chaotic medium sequences, length = ~5,000

✔

▶

medium_anti_slow
medium test anti slow solutions

✔

▶

large_random
chaotic large sequences, length = ~50,000

✔

▶

large_anti_slow
large test anti slow solutions

✔

▶

extreme_max
extreme max test

✔