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

AVAILABLE LESSONS:

Lesson 1

Iterations

Lesson 2

Arrays

Lesson 3

Time Complexity

Lesson 4

Counting Elements

Lesson 5

Prefix Sums

Lesson 6

Sorting

Lesson 7

Stacks and Queues

Lesson 8

Leader

Lesson 9

Maximum slice problem

Lesson 10

Prime and composite numbers

Lesson 11

Sieve of Eratosthenes

Lesson 12

Euclidean algorithm

Lesson 13

Fibonacci numbers

Lesson 14

Binary search algorithm

Lesson 15

Caterpillar method

Lesson 16

Greedy algorithms

Lesson 17

Dynamic programming

Lesson 90

Tasks from Indeed Prime 2015 challenge

Lesson 91

Tasks from Indeed Prime 2016 challenge

Lesson 92

Tasks from Indeed Prime 2016 College Coders challenge

Lesson 99

Future training

Programming language:
Spoken language:

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:

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

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:

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

Assume that:

- 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].

Complexity:

- expected worst-case time complexity is O(N);
- expected worst-case space complexity is O(N), 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.

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:

int solution(vector<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:

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

Assume that:

- 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].

Complexity:

- expected worst-case time complexity is O(N);
- expected worst-case space complexity is O(N), 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.

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:

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

Assume that:

- 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].

Complexity:

- expected worst-case time complexity is O(N);
- expected worst-case space complexity is O(N), 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.

Write a function:

func Solution(H []int) int

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

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

Assume that:

- 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].

Complexity:

- expected worst-case time complexity is O(N);

Write a function:

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

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

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

Assume that:

- 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].

Complexity:

- expected worst-case time complexity is O(N);

Write a function:

function solution(H);

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

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

Assume that:

- 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].

Complexity:

- expected worst-case time complexity is O(N);

Write a function:

function solution(H)

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

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

Assume that:

- 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].

Complexity:

- expected worst-case time complexity is O(N);

Note: All arrays in this task are zero-indexed, unlike the common Lua convention. You can use `#A` to get the length of the array A.

Write a function:

int solution(NSMutableArray *H);

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

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

Assume that:

- 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].

Complexity:

- expected worst-case time complexity is O(N);

Write a function:

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

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

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

Assume that:

- 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].

Complexity:

- expected worst-case time complexity is O(N);

Write a function:

function solution($H);

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

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

Assume that:

- 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].

Complexity:

- expected worst-case time complexity is O(N);

Write a function:

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

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

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

Assume that:

- 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].

Complexity:

- expected worst-case time complexity is O(N);

Write a function:

def solution(H)

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

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

Assume that:

- 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].

Complexity:

- expected worst-case time complexity is O(N);

Write a function:

def solution(h)

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

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

Assume that:

- 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].

Complexity:

- expected worst-case time complexity is O(N);

Write a function:

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

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

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

Assume that:

- 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].

Complexity:

- expected worst-case time complexity is O(N);

Write a function:

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

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

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

Assume that:

- 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].

Complexity:

- expected worst-case time complexity is O(N);

Write a function:

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

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

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

Assume that:

- 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].

Complexity:

- expected worst-case time complexity is O(N);

Write a function:

Private Function solution(H As Integer()) As Integer

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

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

Assume that:

- 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].

Complexity:

- expected worst-case time complexity is O(N);

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