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

painless

Programming language:
Spoken language:

A string S consisting of N characters is considered to be *properly nested* if any of the following conditions is true:

- S is empty;
- S has the form "
(U)" or "[U]" or "{U}" where U is a properly nested string;- S has the form "
VW" where V and W are properly nested strings.

For example, the string "`{[()()]}`" is properly nested but "`([)()]`" is not.

Write a function:

int solution(char *S);

that, given a string S consisting of N characters, returns 1 if S is properly nested and 0 otherwise.

For example, given S = "`{[()()]}`", the function should return 1 and given S = "`([)()]`", the function should return 0, as explained above.

Write an ** efficient** algorithm for the following assumptions:

- N is an integer within the range [0..200,000];
- string S consists only of the following characters: "
(", "{", "[", "]", "}" and/or ")".

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

A string S consisting of N characters is considered to be *properly nested* if any of the following conditions is true:

- S is empty;
- S has the form "
(U)" or "[U]" or "{U}" where U is a properly nested string;- S has the form "
VW" where V and W are properly nested strings.

For example, the string "`{[()()]}`" is properly nested but "`([)()]`" is not.

Write a function:

int solution(string &S);

that, given a string S consisting of N characters, returns 1 if S is properly nested and 0 otherwise.

For example, given S = "`{[()()]}`", the function should return 1 and given S = "`([)()]`", the function should return 0, as explained above.

Write an ** efficient** algorithm for the following assumptions:

- N is an integer within the range [0..200,000];
- string S consists only of the following characters: "
(", "{", "[", "]", "}" and/or ")".

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

A string S consisting of N characters is considered to be *properly nested* if any of the following conditions is true:

- S is empty;
- S has the form "
(U)" or "[U]" or "{U}" where U is a properly nested string;- S has the form "
VW" where V and W are properly nested strings.

For example, the string "`{[()()]}`" is properly nested but "`([)()]`" is not.

Write a function:

class Solution { public int solution(string S); }

that, given a string S consisting of N characters, returns 1 if S is properly nested and 0 otherwise.

For example, given S = "`{[()()]}`", the function should return 1 and given S = "`([)()]`", the function should return 0, as explained above.

Write an ** efficient** algorithm for the following assumptions:

- N is an integer within the range [0..200,000];
- string S consists only of the following characters: "
(", "{", "[", "]", "}" and/or ")".

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

*properly nested* if any of the following conditions is true:

- S is empty;
- S has the form "
(U)" or "[U]" or "{U}" where U is a properly nested string;- S has the form "
VW" where V and W are properly nested strings.

For example, the string "`{[()()]}`" is properly nested but "`([)()]`" is not.

Write a function:

func Solution(S string) int

`{[()()]}`", the function should return 1 and given S = "`([)()]`", the function should return 0, as explained above.

Write an ** efficient** algorithm for the following assumptions:

- N is an integer within the range [0..200,000];
- string S consists only of the following characters: "
(", "{", "[", "]", "}" and/or ")".

*properly nested* if any of the following conditions is true:

- S is empty;
- S has the form "
(U)" or "[U]" or "{U}" where U is a properly nested string;- S has the form "
VW" where V and W are properly nested strings.

For example, the string "`{[()()]}`" is properly nested but "`([)()]`" is not.

Write a function:

class Solution { public int solution(String S); }

`{[()()]}`", the function should return 1 and given S = "`([)()]`", the function should return 0, as explained above.

Write an ** efficient** algorithm for the following assumptions:

- N is an integer within the range [0..200,000];
- string S consists only of the following characters: "
(", "{", "[", "]", "}" and/or ")".

*properly nested* if any of the following conditions is true:

- S is empty;
- S has the form "
(U)" or "[U]" or "{U}" where U is a properly nested string;- S has the form "
VW" where V and W are properly nested strings.

For example, the string "`{[()()]}`" is properly nested but "`([)()]`" is not.

Write a function:

function solution(S);

`{[()()]}`", the function should return 1 and given S = "`([)()]`", the function should return 0, as explained above.

Write an ** efficient** algorithm for the following assumptions:

- N is an integer within the range [0..200,000];
- string S consists only of the following characters: "
(", "{", "[", "]", "}" and/or ")".

*properly nested* if any of the following conditions is true:

- S is empty;
- S has the form "
(U)" or "[U]" or "{U}" where U is a properly nested string;- S has the form "
VW" where V and W are properly nested strings.

For example, the string "`{[()()]}`" is properly nested but "`([)()]`" is not.

Write a function:

function solution(S)

`{[()()]}`", the function should return 1 and given S = "`([)()]`", the function should return 0, as explained above.

Write an ** efficient** algorithm for the following assumptions:

- N is an integer within the range [0..200,000];
- string S consists only of the following characters: "
(", "{", "[", "]", "}" and/or ")".

*properly nested* if any of the following conditions is true:

- S is empty;
- S has the form "
(U)" or "[U]" or "{U}" where U is a properly nested string;- S has the form "
VW" where V and W are properly nested strings.

For example, the string "`{[()()]}`" is properly nested but "`([)()]`" is not.

Write a function:

int solution(NSString *S);

`{[()()]}`", the function should return 1 and given S = "`([)()]`", the function should return 0, as explained above.

Write an ** efficient** algorithm for the following assumptions:

- N is an integer within the range [0..200,000];
- string S consists only of the following characters: "
(", "{", "[", "]", "}" and/or ")".

*properly nested* if any of the following conditions is true:

- S is empty;
- S has the form "
(U)" or "[U]" or "{U}" where U is a properly nested string;- S has the form "
VW" where V and W are properly nested strings.

For example, the string "`{[()()]}`" is properly nested but "`([)()]`" is not.

Write a function:

function solution(S: PChar): longint;

`{[()()]}`", the function should return 1 and given S = "`([)()]`", the function should return 0, as explained above.

Write an ** efficient** algorithm for the following assumptions:

- N is an integer within the range [0..200,000];
- string S consists only of the following characters: "
(", "{", "[", "]", "}" and/or ")".

*properly nested* if any of the following conditions is true:

- S is empty;
- S has the form "
(U)" or "[U]" or "{U}" where U is a properly nested string;- S has the form "
VW" where V and W are properly nested strings.

For example, the string "`{[()()]}`" is properly nested but "`([)()]`" is not.

Write a function:

function solution($S);

`{[()()]}`", the function should return 1 and given S = "`([)()]`", the function should return 0, as explained above.

Write an ** efficient** algorithm for the following assumptions:

- N is an integer within the range [0..200,000];
- string S consists only of the following characters: "
(", "{", "[", "]", "}" and/or ")".

*properly nested* if any of the following conditions is true:

- S is empty;
- S has the form "
(U)" or "[U]" or "{U}" where U is a properly nested string;- S has the form "
VW" where V and W are properly nested strings.

For example, the string "`{[()()]}`" is properly nested but "`([)()]`" is not.

Write a function:

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

`{[()()]}`", the function should return 1 and given S = "`([)()]`", the function should return 0, as explained above.

Write an ** efficient** algorithm for the following assumptions:

- N is an integer within the range [0..200,000];
- string S consists only of the following characters: "
(", "{", "[", "]", "}" and/or ")".

*properly nested* if any of the following conditions is true:

- S is empty;
- S has the form "
(U)" or "[U]" or "{U}" where U is a properly nested string;- S has the form "
VW" where V and W are properly nested strings.

For example, the string "`{[()()]}`" is properly nested but "`([)()]`" is not.

Write a function:

def solution(S)

`{[()()]}`", the function should return 1 and given S = "`([)()]`", the function should return 0, as explained above.

Write an ** efficient** algorithm for the following assumptions:

- N is an integer within the range [0..200,000];
- string S consists only of the following characters: "
(", "{", "[", "]", "}" and/or ")".

*properly nested* if any of the following conditions is true:

- S is empty;
- S has the form "
(U)" or "[U]" or "{U}" where U is a properly nested string;- S has the form "
VW" where V and W are properly nested strings.

For example, the string "`{[()()]}`" is properly nested but "`([)()]`" is not.

Write a function:

def solution(s)

`{[()()]}`", the function should return 1 and given S = "`([)()]`", the function should return 0, as explained above.

Write an ** efficient** algorithm for the following assumptions:

- N is an integer within the range [0..200,000];
- string S consists only of the following characters: "
(", "{", "[", "]", "}" and/or ")".

*properly nested* if any of the following conditions is true:

- S is empty;
- S has the form "
(U)" or "[U]" or "{U}" where U is a properly nested string;- S has the form "
VW" where V and W are properly nested strings.

For example, the string "`{[()()]}`" is properly nested but "`([)()]`" is not.

Write a function:

object Solution { def solution(s: String): Int }

`{[()()]}`", the function should return 1 and given S = "`([)()]`", the function should return 0, as explained above.

Write an ** efficient** algorithm for the following assumptions:

- N is an integer within the range [0..200,000];
- string S consists only of the following characters: "
(", "{", "[", "]", "}" and/or ")".

*properly nested* if any of the following conditions is true:

- S is empty;
- S has the form "
(U)" or "[U]" or "{U}" where U is a properly nested string;- S has the form "
VW" where V and W are properly nested strings.

For example, the string "`{[()()]}`" is properly nested but "`([)()]`" is not.

Write a function:

public func solution(inout S : String) -> Int

`{[()()]}`", the function should return 1 and given S = "`([)()]`", the function should return 0, as explained above.

Write an ** efficient** algorithm for the following assumptions:

- N is an integer within the range [0..200,000];
- string S consists only of the following characters: "
(", "{", "[", "]", "}" and/or ")".

*properly nested* if any of the following conditions is true:

- S is empty;
- S has the form "
(U)" or "[U]" or "{U}" where U is a properly nested string;- S has the form "
VW" where V and W are properly nested strings.

For example, the string "`{[()()]}`" is properly nested but "`([)()]`" is not.

Write a function:

public func solution(_ S : inout String) -> Int

`{[()()]}`", the function should return 1 and given S = "`([)()]`", the function should return 0, as explained above.

Write an ** efficient** algorithm for the following assumptions:

- N is an integer within the range [0..200,000];
- string S consists only of the following characters: "
(", "{", "[", "]", "}" and/or ")".

*properly nested* if any of the following conditions is true:

- S is empty;
- S has the form "
(U)" or "[U]" or "{U}" where U is a properly nested string;- S has the form "
VW" where V and W are properly nested strings.

For example, the string "`{[()()]}`" is properly nested but "`([)()]`" is not.

Write a function:

Private Function solution(S As String) As Integer

`{[()()]}`", the function should return 1 and given S = "`([)()]`", the function should return 0, as explained above.

Write an ** efficient** algorithm for the following assumptions:

- N is an integer within the range [0..200,000];
- string S consists only of the following characters: "
(", "{", "[", "]", "}" and/or ")".

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