Test results - Codility

Tasks Details

easy

1. Nesting

Determine whether a given string of parentheses (single type) is properly nested.

87%

66%

100%

A string S consisting of N characters is called properly nested if:

S is empty;

S has the form "(U)" where U is a properly nested string;

S has the form "VW" where V and W are properly nested strings.

For example, string "(()(())())" is properly nested but string "())" isn't.

Write a function:

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

that, given a string S consisting of N characters, returns 1 if string 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..1,000,000];

string S is made only of the characters '(' and/or ')'.

Solution

Programming language used C#

Time spent on task 1 minutes

Notes

not defined yet

Task timeline

Code: 17:51:17 UTC, cs, 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 24

using System;
// you can also use other imports, for example:
// using System.Collections.Generic;

// you can use Console.WriteLine for debugging purposes, e.g.
// Console.WriteLine("this is a debug message");

class Solution {
    public int solution(string S) {
        // write your code in C# 6.0 with .NET 4.5 (Mono)
        int l = S.Length;
        int count=0;
        
        if (l == 0) return 1;
        
        foreach (char c in S)
        {
            if (c == '(') count++;
            else count--;
        }
        if (count ==0 && S[0]=='(' && S[l-1]==')') return 1;
        else return 0;
    }
}

Analysis

▶

example1
example test

✔

▶

example2
example test2

✔

Code: 17:51:24 UTC, cs, 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 24

using System;
// you can also use other imports, for example:
// using System.Collections.Generic;

// you can use Console.WriteLine for debugging purposes, e.g.
// Console.WriteLine("this is a debug message");

class Solution {
    public int solution(string S) {
        // write your code in C# 6.0 with .NET 4.5 (Mono)
        int l = S.Length;
        int count=0;
        
        if (l == 0) return 1;
        
        foreach (char c in S)
        {
            if (c == '(') count++;
            else count--;
        }
        if (count ==0 && S[0]=='(' && S[l-1]==')') return 1;
        else return 0;
    }
}

Analysis

▶

example1
example test

✔

▶

example2
example test2

✔

Code: 17:51:29 UTC, cs, final, score: 87

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24

using System;
// you can also use other imports, for example:
// using System.Collections.Generic;

// you can use Console.WriteLine for debugging purposes, e.g.
// Console.WriteLine("this is a debug message");

class Solution {
    public int solution(string S) {
        // write your code in C# 6.0 with .NET 4.5 (Mono)
        int l = S.Length;
        int count=0;
        
        if (l == 0) return 1;
        
        foreach (char c in S)
        {
            if (c == '(') count++;
            else count--;
        }
        if (count ==0 && S[0]=='(' && S[l-1]==')') return 1;
        else return 0;
    }
}

Analysis summary

The following issues have been detected: wrong answers.

Analysis

Detected time complexity:

O(N)

▶

example1
example test

✔

▶

example2
example test2

✔

▶

negative_match
invalid structure, but the number of parentheses matches

✘

WRONG ANSWER
got 1 expected 0

▶

empty
empty string

✔

▶

simple_grouped
simple grouped positive and negative test, length=22

✔

▶

large1
simple large positive test, 10K ('s followed by 10K )'s + )(

✔

▶

large2
simple large negative test, 10K+1 ('s followed by 10K )'s + )( + ()

✔

▶

large_full_ternary_tree
tree of the form T=(TTT) and depth 11, length=177K+

✔

▶

multiple_full_binary_trees
sequence of full trees of the form T=(TT), depths [1..10..1], with/without unmatched ')' at the end, length=49K+

✔

▶

broad_tree_with_deep_paths
string of the form (TTT...T) of 300 T's, each T being '(((...)))' nested 200-fold, length=120K+

✔