Test results - Codility

Tasks Details

easy

1. Brackets

Determine whether a given string of parentheses (multiple types) is properly nested.

Task Score

100%

Correctness

100%

Performance

100%

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 is made only of the following characters: '(', '{', '[', ']', '}' and/or ')'.

Solution

Programming language used C++

Time spent on task 5 minutes

Notes

not defined yet

Task timeline

Code: 12:29:33 UTC, java, autosave

show code in pop-up

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: 12:29:37 UTC, cpp, autosave

show code in pop-up

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: 12:29:44 UTC, cpp, autosave

show code in pop-up

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

#include <stack>

using namespace std;

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

Code: 12:29:48 UTC, cpp, verify, result: Passed

show code in pop-up

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

#include <stack>

using namespace std;

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

User test case 1:

['()']

Analysis

expand all Example tests

▶

example1
example test 1

✔

0.001 s

▶

example2
example test 2

✔

0.001 s

expand all User tests

▶

test_data1

✔

0.001 s

OK
function result: 0

Code: 12:30:40 UTC, cpp, autosave

show code in pop-up

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

#include <stack>

using namespace std;

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

Code: 12:30:46 UTC, cpp, verify, result: Passed

show code in pop-up

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

#include <stack>

using namespace std;

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

User test case 1:

['()']

Analysis

expand all Example tests

▶

example1
example test 1

✔

0.001 s

stdout:

hi

▶

example2
example test 2

✔

0.001 s

expand all User tests

▶

test_data1

✔

0.001 s

OK
function result: 0

Code: 12:31:01 UTC, cpp, autosave

show code in pop-up

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

#include <stack>

using namespace std;

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

Code: 12:31:20 UTC, cpp, verify, result: Passed

show code in pop-up

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

#include <stack>

using namespace std;

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

User test case 1:

['()']

Analysis

expand all Example tests

▶

example1
example test 1

✔

0.001 s

stdout:

hi
hi
hi
hi

▶

example2
example test 2

✔

0.001 s

stdout:

hi

expand all User tests

▶

test_data1

✔

0.001 s

OK
function result: 0

Code: 12:31:31 UTC, cpp, autosave

show code in pop-up

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

#include <stack>

using namespace std;

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

Code: 12:31:32 UTC, cpp, verify, result: Passed

show code in pop-up

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

#include <stack>

using namespace std;

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

User test case 1:

['()']

Analysis

expand all Example tests

▶

example1
example test 1

✔

0.001 s

stdout:

hi

▶

example2
example test 2

✔

0.001 s

stdout:

hi

expand all User tests

▶

test_data1

✔

0.001 s

OK
function result: 0

stdout:

hi

Code: 12:31:43 UTC, cpp, verify, result: Passed

show code in pop-up

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

#include <stack>

using namespace std;

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

User test case 1:

['()']

Analysis

expand all Example tests

▶

example1
example test 1

✔

0.001 s

stdout:

hi

▶

example2
example test 2

✔

0.001 s

stdout:

hi

expand all User tests

▶

test_data1

✔

0.001 s

OK
function result: 0

Code: 12:31:51 UTC, cpp, verify, result: Passed

show code in pop-up

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

#include <stack>

using namespace std;

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

User test case 1:

['()']

Analysis

expand all Example tests

▶

example1
example test 1

✔

0.001 s

stdout:

hi

▶

example2
example test 2

✔

0.001 s

stdout:

hi

expand all User tests

▶

test_data1

✔

0.001 s

OK
function result: 0

Code: 12:32:01 UTC, cpp, autosave

show code in pop-up

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

#include <stack>

using namespace std;

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

Code: 12:32:06 UTC, cpp, verify, result: Passed

show code in pop-up

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

#include <stack>

using namespace std;

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

User test case 1:

['()']

Analysis

expand all Example tests

▶

example1
example test 1

✔

0.001 s

stdout:

hi

▶

example2
example test 2

✔

0.001 s

stdout:

hi

expand all User tests

▶

test_data1

✔

0.001 s

OK
function result: 0

Code: 12:32:17 UTC, cpp, verify, result: Passed

show code in pop-up

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

#include <stack>

using namespace std;

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

User test case 1:

['()']

Analysis

expand all Example tests

▶

example1
example test 1

✔

0.001 s

stdout:

hi

▶

example2
example test 2

✔

0.001 s

stdout:

hi

expand all User tests

▶

test_data1

✔

0.001 s

OK
function result: 1

stdout:

hi

Code: 12:32:42 UTC, cpp, autosave

show code in pop-up

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

#include <stack>

using namespace std;

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

Code: 12:33:10 UTC, cpp, verify, result: Passed

show code in pop-up

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

#include <stack>

using namespace std;

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

User test case 1:

['()']

Analysis

expand all Example tests

▶

example1
example test 1

✔

0.001 s

stdout:

▶

example2
example test 2

✔

0.001 s

stdout:

expand all User tests

▶

test_data1

✔

0.001 s

OK
function result: 0

stdout:

Code: 12:33:25 UTC, cpp, autosave

show code in pop-up

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

#include <stack>

using namespace std;

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

Code: 12:33:35 UTC, cpp, autosave

show code in pop-up

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

#include <stack>

using namespace std;

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

Code: 12:33:36 UTC, cpp, verify, result: Passed

show code in pop-up

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

#include <stack>

using namespace std;

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

User test case 1:

['()']

Analysis

expand all Example tests

▶

example1
example test 1

✔

0.001 s

▶

example2
example test 2

✔

0.001 s

expand all User tests

▶

test_data1

✔

0.001 s

OK
function result: 1

Code: 12:33:39 UTC, cpp, final, score: 100

show code in pop-up

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

#include <stack>

using namespace std;

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

Analysis summary

The solution obtained perfect score.

Analysis

Detected time complexity:

O(N)

expand all Example tests

▶

example1
example test 1

✔

0.001 s

▶

example2
example test 2

✔

0.001 s

expand all Correctness tests

▶

negative_match
invalid structures

✔

0.001 s

▶

empty
empty string

✔

0.001 s

▶

simple_grouped
simple grouped positive and negative test, length=22

✔

0.001 s

expand all Performance tests

▶

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

✔

0.004 s

0.001 s

▶

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

✔

0.001 s

▶

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

✔

0.004 s

▶

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

✔

0.001 s

▶

broad_tree_with_deep_paths
string of the form [TTT...T] of 300 T's, each T being '{{{...}}}' nested 200-fold, length=120K+

✔

0.004 s