Test results - Codility

Code: 15:06:32 UTC, java, autosave

1 2 3 4 5 6 7 8 9 10 11

// you can also use imports, for example:
// import java.util.*;

// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");

class Solution {
    public int solution(String S) {
        // write your code in Java SE 8
    }
}

Code: 15:06:34 UTC, cpp, autosave

1 2 3 4 5 6 7 8 9

// you can use includes, for example:
// #include <algorithm>

// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;

int solution(string &S) {
    // write your code in C++14 (g++ 6.2.0)
}

Code: 15:06:38 UTC, cpp, autosave

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36

// you can use includes, for example:
// #include <algorithm>
#include <stack>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;

int solution(string &S) {
    // write your code in C++14 (g++ 6.2.0)
    stack<char> s;
    int count = 0;
    
    if(S.empty())
        return 1;
    
    
    if(S.size() % 2 == 1 || S[0] != '(')
        return 0;
        
        
    for(int i = 0; i < S.size(); i++){
        if(S[i] == '(')
            s.push(S[i]);
        else{
            s.pop();
            count++;
        }
            
    }
    
    if(s.empty() && count == S.size() / 2)
        return 1;
    else
        return 0;
    
    
}

Code: 15:08:31 UTC, cpp, autosave

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38

// you can use includes, for example:
// #include <algorithm>
#include <stack>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;

int solution(string &S) {
    // write your code in C++14 (g++ 6.2.0)
    stack<char> s;
    int count = 0;
    
    if(S.empty())
        return 1;
    
    
    if(S.size() % 2 == 1 || S[0] != '(')
        return 0;
        
        
    for(int i = 0; i < S.size(); i++){
        
        
        if(S[i] == '(')
            s.push(S[i]);
        else{
            s.pop();
            count++;
        }
            
    }
    
    if(s.empty() && count == S.size() / 2)
        return 1;
    else
        return 0;
    
    
}

Code: 15:09:07 UTC, cpp, autosave

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38

// you can use includes, for example:
// #include <algorithm>
#include <stack>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;

int solution(string &S) {
    // write your code in C++14 (g++ 6.2.0)
    stack<char> s;
    int count = 0;
    
    if(S.empty())
        return 1;
    
    
    if(S.size() % 2 == 1 || S[0] != '(')
        return 0;
        
        
    for(int i = 0; i < S.size(); i++){
        f
        
        if(S[i] == '(')
            s.push(S[i]);
        else{
            s.pop();
            count++;
        }
            
    }
    
    if(s.empty() && count == S.size() / 2)
        return 1;
    else
        return 0;
    
    
}

Code: 15:09:29 UTC, cpp, 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 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39

// you can use includes, for example:
// #include <algorithm>
#include <stack>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;

int solution(string &S) {
    // write your code in C++14 (g++ 6.2.0)
    stack<char> s;
    int count = 0;
    
    if(S.empty())
        return 1;
    
    
    if(S.size() % 2 == 1 || S[0] != '(')
        return 0;
        
        
    for(int i = 0; i < S.size(); i++){
        if(s.empty() && S[i] == ')')
            return 0;
        
        if(S[i] == '(')
            s.push(S[i]);
        else{
            s.pop();
            count++;
        }
            
    }
    
    if(s.empty() && count == S.size() / 2)
        return 1;
    else
        return 0;
    
    
}

Analysis

▶

example1
example test

✔

OK

▶

example2
example test2

✔

OK

Code: 15:09:32 UTC, cpp, final, score: 100

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39

// you can use includes, for example:
// #include <algorithm>
#include <stack>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;

int solution(string &S) {
    // write your code in C++14 (g++ 6.2.0)
    stack<char> s;
    int count = 0;
    
    if(S.empty())
        return 1;
    
    
    if(S.size() % 2 == 1 || S[0] != '(')
        return 0;
        
        
    for(int i = 0; i < S.size(); i++){
        if(s.empty() && S[i] == ')')
            return 0;
        
        if(S[i] == '(')
            s.push(S[i]);
        else{
            s.pop();
            count++;
        }
            
    }
    
    if(s.empty() && count == S.size() / 2)
        return 1;
    else
        return 0;
    
    
}

Analysis summary

The solution obtained perfect score.

Analysis

Detected time complexity:

O(N)

▶

example1
example test

✔

OK

▶

example2
example test2

✔

OK

▶

negative_match
invalid structure, but the number of parentheses matches

✔

OK

▶

empty
empty string

✔

OK

▶

simple_grouped
simple grouped positive and negative test, length=22

✔

OK

▶

small_random

✔

OK

▶

large1
simple large positive and negative test, 10K or 10K+1 ('s followed by 10K )'s

✔

OK

▶

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

✔

OK

▶

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+

✔

OK

▶

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

✔

OK