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

UPCOMING CHALLENGES:

CURRENT CHALLENGES:

Nickel 2018

PAST CHALLENGES

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

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);

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);

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);

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