Test results - Codility

Code: 02:06:14 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: 02:06:18 UTC, java, autosave

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

import java.util.*;

class Solution {
    public int solution(String S) {
        Stack<Character> stack = new Stack<>();
        
        for (char s : S.toCharArray()) {
            if ('(' == s || '[' == s || '{' == s) {
                stack.push(s);   
            } else if (!stack.empty()) {
                char pop = stack.pop();
                if (('(' == pop && ')' != s) ||
                    ('[' == pop && ']' != s) ||
                    ('{' == pop && '}' != s)
                ) {
                    return 0;
                }
            }
        }
        
        return stack.empty() ? 1 : 0;
    }
}

Code: 02:06:46 UTC, java, 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

import java.util.*;

class Solution {
    public int solution(String S) {
        Stack<Character> stack = new Stack<>();
        
        for (char s : S.toCharArray()) {
            if ('(' == s || '[' == s || '{' == s) {
                stack.push(s);   
            } else if (stack.empty()) {
                return 0;    
            } else {
                char pop = stack.pop();
                if (('(' == pop && ')' != s) ||
                    ('[' == pop && ']' != s) ||
                    ('{' == pop && '}' != s)
                ) {
                    return 0;
                }
            }
        }
        
        return stack.empty() ? 1 : 0;
    }
}

Code: 02:07:00 UTC, java, 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

import java.util.*;

class Solution {
    public int solution(String S) {
        Stack<Character> stack = new Stack<>();
        
        for (char s : S.toCharArray()) {
            if ('(' == s || '[' == s || '{' == s) {
                stack.push(s);   
            } else if (stack.empty()) {
                return 0;    
            } else {
                char pop = stack.pop();
                if (('(' == pop && ')' != s) ||
                    ('[' == pop && ']' != s) ||
                    ('{' == pop && '}' != s)
                ) {
                    return 0;
                }
            }
        }
        
        return stack.empty() ? 1 : 0;
    }
}

Analysis

▶

example1
example test 1

✔

OK

▶

example2
example test 2

✔

OK

▶

test_data1

✔

OK

▶

test_data2

✔

OK

Code: 02:07:07 UTC, java, 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

import java.util.*;

class Solution {
    public int solution(String S) {
        Stack<Character> stack = new Stack<>();
        
        for (char s : S.toCharArray()) {
            if ('(' == s || '[' == s || '{' == s) {
                stack.push(s);   
            } else if (stack.empty()) {
                return 0;    
            } else {
                char pop = stack.pop();
                if (('(' == pop && ')' != s) ||
                    ('[' == pop && ']' != s) ||
                    ('{' == pop && '}' != s)
                ) {
                    return 0;
                }
            }
        }
        
        return stack.empty() ? 1 : 0;
    }
}

Analysis

▶

example1
example test 1

✔

OK

▶

example2
example test 2

✔

OK

▶

test_data1

✔

OK

▶

test_data2

✔

OK

Code: 02:07:13 UTC, java, 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

import java.util.*;

class Solution {
    public int solution(String S) {
        Stack<Character> stack = new Stack<>();
        
        for (char s : S.toCharArray()) {
            if ('(' == s || '[' == s || '{' == s) {
                stack.push(s);   
            } else if (stack.empty()) {
                return 0;    
            } else {
                char pop = stack.pop();
                if (('(' == pop && ')' != s) ||
                    ('[' == pop && ']' != s) ||
                    ('{' == pop && '}' != s)
                ) {
                    return 0;
                }
            }
        }
        
        return stack.empty() ? 1 : 0;
    }
}

Analysis summary

The solution obtained perfect score.

Analysis

Detected time complexity:

O(N)

▶

example1
example test 1

✔

OK

▶

example2
example test 2

✔

OK

▶

negative_match
invalid structures

✔

OK

▶

empty
empty string

✔

OK

▶

simple_grouped
simple grouped positive and negative test, length=22

✔

OK

▶

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

✔

OK

▶

large2
simple large negative test, 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 some brackets 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=120K+

✔

OK