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

respectable

Find the maximum depth of water in mountains after a huge rainfall.

Programming language:
Spoken language:

You are helping a geologist friend investigate an area with mountain lakes. A recent heavy rainfall has flooded these lakes and their water levels have reached the highest possible point. Your friend is interested to know the maximum depth in the deepest part of these lakes.

We simplify the problem in 2-D dimensions. The whole landscape can be divided into small blocks and described by an array A of length N. Each element of A is the altitude of the rock floor of a block (i.e. the height of this block when there is no water at all). After the rainfall, all the low-lying areas (i.e. blocks that have higher blocks on both sides) are holding as much water as possible. You would like to know the maximum depth of water after this entire area is flooded. You can assume that the altitude outside this area is zero and the outside area can accommodate infinite amount of water.

For example, consider array A such that:

The following picture illustrates the landscape after it has flooded:

The gray area is the rock floor described by the array A above and the blue area with dashed lines represents the water filling the low-lying areas with maximum possible volume. Thus, blocks 3 and 5 have a water depth of 2 while blocks 2, 4, 7 and 8 have a water depth of 1. Therefore, the maximum water depth of this area is 2.

Write a function:

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

that, given a non-empty array A consisting of N integers, returns the maximum depth of water.

Given array A shown above, the function should return 2, as explained above.

For the following array:

the function should return 0, because this landscape cannot hold any water.

Assume that:

- N is an integer within the range [1..100,000];
- each element of array A is an integer within the range [1..100,000,000].

Complexity:

- expected worst-case time complexity is O(N);
- expected worst-case space complexity is O(N) (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 helping a geologist friend investigate an area with mountain lakes. A recent heavy rainfall has flooded these lakes and their water levels have reached the highest possible point. Your friend is interested to know the maximum depth in the deepest part of these lakes.

We simplify the problem in 2-D dimensions. The whole landscape can be divided into small blocks and described by an array A of length N. Each element of A is the altitude of the rock floor of a block (i.e. the height of this block when there is no water at all). After the rainfall, all the low-lying areas (i.e. blocks that have higher blocks on both sides) are holding as much water as possible. You would like to know the maximum depth of water after this entire area is flooded. You can assume that the altitude outside this area is zero and the outside area can accommodate infinite amount of water.

For example, consider array A such that:

The following picture illustrates the landscape after it has flooded:

The gray area is the rock floor described by the array A above and the blue area with dashed lines represents the water filling the low-lying areas with maximum possible volume. Thus, blocks 3 and 5 have a water depth of 2 while blocks 2, 4, 7 and 8 have a water depth of 1. Therefore, the maximum water depth of this area is 2.

Write a function:

int solution(vector<int> &A);

that, given a non-empty array A consisting of N integers, returns the maximum depth of water.

Given array A shown above, the function should return 2, as explained above.

For the following array:

the function should return 0, because this landscape cannot hold any water.

Assume that:

- N is an integer within the range [1..100,000];
- each element of array A is an integer within the range [1..100,000,000].

Complexity:

- expected worst-case time complexity is O(N);
- expected worst-case space complexity is O(N) (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 helping a geologist friend investigate an area with mountain lakes. A recent heavy rainfall has flooded these lakes and their water levels have reached the highest possible point. Your friend is interested to know the maximum depth in the deepest part of these lakes.

We simplify the problem in 2-D dimensions. The whole landscape can be divided into small blocks and described by an array A of length N. Each element of A is the altitude of the rock floor of a block (i.e. the height of this block when there is no water at all). After the rainfall, all the low-lying areas (i.e. blocks that have higher blocks on both sides) are holding as much water as possible. You would like to know the maximum depth of water after this entire area is flooded. You can assume that the altitude outside this area is zero and the outside area can accommodate infinite amount of water.

For example, consider array A such that:

The following picture illustrates the landscape after it has flooded:

The gray area is the rock floor described by the array A above and the blue area with dashed lines represents the water filling the low-lying areas with maximum possible volume. Thus, blocks 3 and 5 have a water depth of 2 while blocks 2, 4, 7 and 8 have a water depth of 1. Therefore, the maximum water depth of this area is 2.

Write a function:

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

that, given a non-empty array A consisting of N integers, returns the maximum depth of water.

Given array A shown above, the function should return 2, as explained above.

For the following array:

the function should return 0, because this landscape cannot hold any water.

Assume that:

- N is an integer within the range [1..100,000];
- each element of array A is an integer within the range [1..100,000,000].

Complexity:

- expected worst-case time complexity is O(N);
- expected worst-case space complexity is O(N) (not counting the storage required for input arguments).

Copyright 2009–2018 by Codility Limited. All Rights Reserved. Unauthorized copying, publication or disclosure prohibited.

For example, consider array A such that:

The following picture illustrates the landscape after it has flooded:

Write a function:

func Solution(A []int) int

that, given a non-empty array A consisting of N integers, returns the maximum depth of water.

Given array A shown above, the function should return 2, as explained above.

For the following array:

the function should return 0, because this landscape cannot hold any water.

Assume that:

- N is an integer within the range [1..100,000];
- each element of array A is an integer within the range [1..100,000,000].

Complexity:

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

For example, consider array A such that:

The following picture illustrates the landscape after it has flooded:

Write a function:

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

that, given a non-empty array A consisting of N integers, returns the maximum depth of water.

Given array A shown above, the function should return 2, as explained above.

For the following array:

the function should return 0, because this landscape cannot hold any water.

Assume that:

- N is an integer within the range [1..100,000];
- each element of array A is an integer within the range [1..100,000,000].

Complexity:

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

For example, consider array A such that:

The following picture illustrates the landscape after it has flooded:

Write a function:

function solution(A);

that, given a non-empty array A consisting of N integers, returns the maximum depth of water.

Given array A shown above, the function should return 2, as explained above.

For the following array:

the function should return 0, because this landscape cannot hold any water.

Assume that:

- N is an integer within the range [1..100,000];
- each element of array A is an integer within the range [1..100,000,000].

Complexity:

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

For example, consider array A such that:

The following picture illustrates the landscape after it has flooded:

Write a function:

function solution(A)

that, given a non-empty array A consisting of N integers, returns the maximum depth of water.

Given array A shown above, the function should return 2, as explained above.

For the following array:

the function should return 0, because this landscape cannot hold any water.

Assume that:

- N is an integer within the range [1..100,000];
- each element of array A is an integer within the range [1..100,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.

For example, consider array A such that:

The following picture illustrates the landscape after it has flooded:

Write a function:

int solution(NSMutableArray *A);

that, given a non-empty array A consisting of N integers, returns the maximum depth of water.

Given array A shown above, the function should return 2, as explained above.

For the following array:

the function should return 0, because this landscape cannot hold any water.

Assume that:

- N is an integer within the range [1..100,000];
- each element of array A is an integer within the range [1..100,000,000].

Complexity:

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

For example, consider array A such that:

The following picture illustrates the landscape after it has flooded:

Write a function:

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

that, given a non-empty array A consisting of N integers, returns the maximum depth of water.

Given array A shown above, the function should return 2, as explained above.

For the following array:

the function should return 0, because this landscape cannot hold any water.

Assume that:

- N is an integer within the range [1..100,000];
- each element of array A is an integer within the range [1..100,000,000].

Complexity:

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

For example, consider array A such that:

The following picture illustrates the landscape after it has flooded:

Write a function:

function solution($A);

that, given a non-empty array A consisting of N integers, returns the maximum depth of water.

Given array A shown above, the function should return 2, as explained above.

For the following array:

the function should return 0, because this landscape cannot hold any water.

Assume that:

- N is an integer within the range [1..100,000];
- each element of array A is an integer within the range [1..100,000,000].

Complexity:

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

For example, consider array A such that:

The following picture illustrates the landscape after it has flooded:

Write a function:

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

that, given a non-empty array A consisting of N integers, returns the maximum depth of water.

Given array A shown above, the function should return 2, as explained above.

For the following array:

the function should return 0, because this landscape cannot hold any water.

Assume that:

- N is an integer within the range [1..100,000];
- each element of array A is an integer within the range [1..100,000,000].

Complexity:

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

For example, consider array A such that:

The following picture illustrates the landscape after it has flooded:

Write a function:

def solution(A)

that, given a non-empty array A consisting of N integers, returns the maximum depth of water.

Given array A shown above, the function should return 2, as explained above.

For the following array:

the function should return 0, because this landscape cannot hold any water.

Assume that:

- N is an integer within the range [1..100,000];
- each element of array A is an integer within the range [1..100,000,000].

Complexity:

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

For example, consider array A such that:

The following picture illustrates the landscape after it has flooded:

Write a function:

def solution(a)

that, given a non-empty array A consisting of N integers, returns the maximum depth of water.

Given array A shown above, the function should return 2, as explained above.

For the following array:

the function should return 0, because this landscape cannot hold any water.

Assume that:

- N is an integer within the range [1..100,000];
- each element of array A is an integer within the range [1..100,000,000].

Complexity:

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

For example, consider array A such that:

The following picture illustrates the landscape after it has flooded:

Write a function:

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

that, given a non-empty array A consisting of N integers, returns the maximum depth of water.

Given array A shown above, the function should return 2, as explained above.

For the following array:

the function should return 0, because this landscape cannot hold any water.

Assume that:

- N is an integer within the range [1..100,000];
- each element of array A is an integer within the range [1..100,000,000].

Complexity:

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

For example, consider array A such that:

The following picture illustrates the landscape after it has flooded:

Write a function:

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

that, given a non-empty array A consisting of N integers, returns the maximum depth of water.

Given array A shown above, the function should return 2, as explained above.

For the following array:

the function should return 0, because this landscape cannot hold any water.

Assume that:

- N is an integer within the range [1..100,000];
- each element of array A is an integer within the range [1..100,000,000].

Complexity:

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

For example, consider array A such that:

The following picture illustrates the landscape after it has flooded:

Write a function:

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

that, given a non-empty array A consisting of N integers, returns the maximum depth of water.

Given array A shown above, the function should return 2, as explained above.

For the following array:

the function should return 0, because this landscape cannot hold any water.

Assume that:

- N is an integer within the range [1..100,000];
- each element of array A is an integer within the range [1..100,000,000].

Complexity:

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

For example, consider array A such that:

The following picture illustrates the landscape after it has flooded:

Write a function:

Private Function solution(A As Integer()) As Integer

that, given a non-empty array A consisting of N integers, returns the maximum depth of water.

Given array A shown above, the function should return 2, as explained above.

For the following array:

the function should return 0, because this landscape cannot hold any water.

Assume that:

- N is an integer within the range [1..100,000];
- each element of array A is an integer within the range [1..100,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