Test results - Codility

Tasks Details

easy

1. StoneWall

Cover "Manhattan skyline" using the minimum number of rectangles.

100%

You are going to build a stone wall. The wall should be straight and N meters long, and its thickness should be constant; however, it should have different heights in different places. The height of the wall is specified by an array H of N positive integers. H[I] is the height of the wall from I to I+1 meters to the right of its left end. In particular, H[0] is the height of the wall's left end and H[N−1] is the height of the wall's right end.

The wall should be built of cuboid stone blocks (that is, all sides of such blocks are rectangular). Your task is to compute the minimum number of blocks needed to build the wall.

Write a function:

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

that, given an array H of N positive integers specifying the height of the wall, returns the minimum number of blocks needed to build it.

For example, given array H containing N = 9 integers:

H[0] = 8 H[1] = 8 H[2] = 5 H[3] = 7 H[4] = 9 H[5] = 8 H[6] = 7 H[7] = 4 H[8] = 8

the function should return 7. The figure shows one possible arrangement of seven blocks.

Write an efficient algorithm for the following assumptions:

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

each element of array H is an integer within the range [1..1,000,000,000].

Solution

Programming language used Java 8

Time spent on task 1 minutes

Notes

not defined yet

Task timeline

Code: 13:31:32 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

// 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");
import java.util.Stack;
class Solution {
	public int solution(int[] H) {
		Stack<Integer> stack = new Stack<>();

		int count = 0;
		for (int i = 0; i < H.length; i++) {
			while (!stack.isEmpty() && stack.peek() > H[i]) {
				stack.pop();
			}
			if (stack.isEmpty() || stack.peek() < H[i]) {
				stack.push(H[i]);
				count++;
			}
		}
		return count;
	}
}

Analysis

▶

example

✔

Code: 13:31:38 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

// 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");
import java.util.Stack;
class Solution {
	public int solution(int[] H) {
		Stack<Integer> stack = new Stack<>();

		int count = 0;
		for (int i = 0; i < H.length; i++) {
			while (!stack.isEmpty() && stack.peek() > H[i]) {
				stack.pop();
			}
			if (stack.isEmpty() || stack.peek() < H[i]) {
				stack.push(H[i]);
				count++;
			}
		}
		return count;
	}
}

Analysis

▶

example

✔

Code: 13:31:42 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

// 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");
import java.util.Stack;
class Solution {
	public int solution(int[] H) {
		Stack<Integer> stack = new Stack<>();

		int count = 0;
		for (int i = 0; i < H.length; i++) {
			while (!stack.isEmpty() && stack.peek() > H[i]) {
				stack.pop();
			}
			if (stack.isEmpty() || stack.peek() < H[i]) {
				stack.push(H[i]);
				count++;
			}
		}
		return count;
	}
}

Analysis summary

The solution obtained perfect score.

Analysis

Detected time complexity:

O(N)

▶

example

✔

▶

simple1

✔

▶

simple2

✔

▶

simple3

✔

▶

simple4

✔

▶

boundary_cases

✔

▶

medium1

✔

▶

medium2

✔

▶

medium3

✔

▶

medium4

✔

▶

large_piramid

✔

▶

large_increasing_decreasing

✔

▶

large_up_to_20

✔

▶

large_up_to_100

✔

▶

large_max

✔