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:

function solution(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 JavaScript

Time spent on task 9 minutes

Notes

not defined yet

Task timeline

Code: 06:21:20 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: 06:21:20 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: 06:21:27 UTC, js, verify, result: Failed

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 37 38 39 40 41 42 43

// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');

function solution(S) {
    // write your code in JavaScript (Node.js 8.9.4)
    const N = S.length;
    let stack = [];
    
    for(let i=0; i<N; i++){
        switch(S.chatAt(i)){
            case '(':
            case '{':
            case '[':
                stack.push(S.chatAt(i));
                break;
            case ')':
                if(stack.top() == '('){
                    stack.pop();
                }
                else{
                    return 0;
                }
                break;
            case '}':
                if(stack.top() == '{'){
                    stack.pop();
                }
                else{
                    return 0;
                }
                break;
            case ']':
                if(stack.top() == '['){
                    stack.pop();
                }
                else{
                    return 0;
                }
                break;
        }
    }
    return stack.empty();
}

Analysis

expand all Example tests

▶

example1
example test 1

✘

RUNTIME ERROR
tested program terminated with exit code 1

0.072 s

RUNTIME ERROR, tested program terminated with exit code 1

stderr:

TypeError: S.chatAt is not a function
    at solution (solution.js:10:18)
    at solutionWrapper (/tmp/exec.js:394:28)
    at Promise.resolve.then (/tmp/exec.js:420:24)
    at <anonymous>
    at process._tickCallback (internal/process/next_tick.js:188:7)
    at Function.Module.runMain (module.js:686:11)
    at startup (bootstrap_node.js:187:16)
    at bootstrap_node.js:608:3

▶

example2
example test 2

✘

RUNTIME ERROR
tested program terminated with exit code 1

0.072 s

RUNTIME ERROR, tested program terminated with exit code 1

stderr:

TypeError: S.chatAt is not a function
    at solution (solution.js:10:18)
    at solutionWrapper (/tmp/exec.js:394:28)
    at Promise.resolve.then (/tmp/exec.js:420:24)
    at <anonymous>
    at process._tickCallback (internal/process/next_tick.js:188:7)
    at Function.Module.runMain (module.js:686:11)
    at startup (bootstrap_node.js:187:16)
    at bootstrap_node.js:608:3

Code: 06:21:51 UTC, js, 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 37 38 39 40 41 42 43

// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');

function solution(S) {
    // write your code in JavaScript (Node.js 8.9.4)
    const N = S.length;
    let stack = [];
    
    for(let i=0; i<N; i++){
        switch(S.charAt(i)){
            case '(':
            case '{':
            case '[':
                stack.push(S.chatAt(i));
                break;
            case ')':
                if(stack.top() == '('){
                    stack.pop();
                }
                else{
                    return 0;
                }
                break;
            case '}':
                if(stack.top() == '{'){
                    stack.pop();
                }
                else{
                    return 0;
                }
                break;
            case ']':
                if(stack.top() == '['){
                    stack.pop();
                }
                else{
                    return 0;
                }
                break;
        }
    }
    return stack.empty();
}

Code: 06:21:58 UTC, js, verify, result: Failed

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 37 38 39 40 41 42 43

// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');

function solution(S) {
    // write your code in JavaScript (Node.js 8.9.4)
    const N = S.length;
    let stack = [];
    
    for(let i=0; i<N; i++){
        switch(S.charAt(i)){
            case '(':
            case '{':
            case '[':
                stack.push(S.charAt(i));
                break;
            case ')':
                if(stack.top() == '('){
                    stack.pop();
                }
                else{
                    return 0;
                }
                break;
            case '}':
                if(stack.top() == '{'){
                    stack.pop();
                }
                else{
                    return 0;
                }
                break;
            case ']':
                if(stack.top() == '['){
                    stack.pop();
                }
                else{
                    return 0;
                }
                break;
        }
    }
    return stack.empty();
}

Analysis

expand all Example tests

▶

example1
example test 1

✘

RUNTIME ERROR
tested program terminated with exit code 1

0.072 s

RUNTIME ERROR, tested program terminated with exit code 1

stderr:

TypeError: stack.top is not a function
    at solution (solution.js:17:26)
    at solutionWrapper (/tmp/exec.js:394:28)
    at Promise.resolve.then (/tmp/exec.js:420:24)
    at <anonymous>
    at process._tickCallback (internal/process/next_tick.js:188:7)
    at Function.Module.runMain (module.js:686:11)
    at startup (bootstrap_node.js:187:16)
    at bootstrap_node.js:608:3

▶

example2
example test 2

✘

RUNTIME ERROR
tested program terminated with exit code 1

0.072 s

RUNTIME ERROR, tested program terminated with exit code 1

stderr:

TypeError: stack.top is not a function
    at solution (solution.js:17:26)
    at solutionWrapper (/tmp/exec.js:394:28)
    at Promise.resolve.then (/tmp/exec.js:420:24)
    at <anonymous>
    at process._tickCallback (internal/process/next_tick.js:188:7)
    at Function.Module.runMain (module.js:686:11)
    at startup (bootstrap_node.js:187:16)
    at bootstrap_node.js:608:3

Code: 06:24:43 UTC, js, 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 37 38 39 40 41 42 43

// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');

function solution(S) {
    // write your code in JavaScript (Node.js 8.9.4)
    const N = S.length;
    let stack = [];
    
    for(let i=0; i<N; i++){
        switch(S.charAt(i)){
            case '(':
            case '{':
            case '[':
                stack.push(S.charAt(i));
                break;
            case ')':
                if(stack. == '('){
                    stack.pop();
                }
                else{
                    return 0;
                }
                break;
            case '}':
                if(stack.top() == '{'){
                    stack.pop();
                }
                else{
                    return 0;
                }
                break;
            case ']':
                if(stack.top() == '['){
                    stack.pop();
                }
                else{
                    return 0;
                }
                break;
        }
    }
    return stack.empty();
}

Code: 06:24:53 UTC, js, 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 37 38 39 40 41 42 43

// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');

function solution(S) {
    // write your code in JavaScript (Node.js 8.9.4)
    const N = S.length;
    let stack = [];
    
    for(let i=0; i<N; i++){
        switch(S.charAt(i)){
            case '(':
            case '{':
            case '[':
                stack.push(S.charAt(i));
                break;
            case ')':
                if(stack[stack.length-1] == '('){
                    stack.pop();
                }
                else{
                    return 0;
                }
                break;
            case '}':
                if(stack.top() == '{'){
                    stack.pop();
                }
                else{
                    return 0;
                }
                break;
            case ']':
                if(stack.top() == '['){
                    stack.pop();
                }
                else{
                    return 0;
                }
                break;
        }
    }
    return stack.empty();
}

Code: 06:25:02 UTC, js, verify, result: Failed

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 37 38 39 40 41 42 43

// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');

function solution(S) {
    // write your code in JavaScript (Node.js 8.9.4)
    const N = S.length;
    let stack = [];
    
    for(let i=0; i<N; i++){
        switch(S.charAt(i)){
            case '(':
            case '{':
            case '[':
                stack.push(S.charAt(i));
                break;
            case ')':
                if(stack[stack.length-1] == '('){
                    stack.pop();
                }
                else{
                    return 0;
                }
                break;
            case '}':
                if(stack[stack.length-1] == '{'){
                    stack.pop();
                }
                else{
                    return 0;
                }
                break;
            case ']':
                if(stack[stack.length-1] == '['){
                    stack.pop();
                }
                else{
                    return 0;
                }
                break;
        }
    }
    return stack.empty();
}

Analysis

expand all Example tests

▶

example1
example test 1

✘

RUNTIME ERROR
tested program terminated with exit code 1

0.124 s

RUNTIME ERROR, tested program terminated with exit code 1

stderr:

TypeError: stack.empty is not a function
    at solution (solution.js:42:18)
    at solutionWrapper (/tmp/exec.js:394:28)
    at Promise.resolve.then (/tmp/exec.js:420:24)
    at <anonymous>
    at process._tickCallback (internal/process/next_tick.js:188:7)
    at Function.Module.runMain (module.js:686:11)
    at startup (bootstrap_node.js:187:16)
    at bootstrap_node.js:608:3

▶

example2
example test 2

✔

0.120 s

Code: 06:25:31 UTC, js, 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 37 38 39 40 41 42 43 44

// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');

function solution(S) {
    // write your code in JavaScript (Node.js 8.9.4)
    const N = S.length;
    let stack = [];
    
    for(let i=0; i<N; i++){
        switch(S.charAt(i)){
            case '(':
            case '{':
            case '[':
                stack.push(S.charAt(i));
                break;
            case ')':
                if(stack[stack.length-1] == '('){
                    stack.pop();
                }
                else{
                    return 0;
                }
                break;
            case '}':
                if(stack[stack.length-1] == '{'){
                    stack.pop();
                }
                else{
                    return 0;
                }
                break;
            case ']':
                if(stack[stack.length-1] == '['){
                    stack.pop();
                }
                else{
                    return 0;
                }
                break;
        }
    }
    if
    return stack.empty();
}

Code: 06:25:57 UTC, js, 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 37 38 39 40 41 42 43 44 45 46 47 48

// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');

function solution(S) {
    // write your code in JavaScript (Node.js 8.9.4)
    const N = S.length;
    let stack = [];
    
    for(let i=0; i<N; i++){
        switch(S.charAt(i)){
            case '(':
            case '{':
            case '[':
                stack.push(S.charAt(i));
                break;
            case ')':
                if(stack[stack.length-1] == '('){
                    stack.pop();
                }
                else{
                    return 0;
                }
                break;
            case '}':
                if(stack[stack.length-1] == '{'){
                    stack.pop();
                }
                else{
                    return 0;
                }
                break;
            case ']':
                if(stack[stack.length-1] == '['){
                    stack.pop();
                }
                else{
                    return 0;
                }
                break;
        }
    }
    if(!stack){
        return 1;
    }
    else{
        return 0;
    }
}

Code: 06:25:58 UTC, js, verify, result: Failed

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 37 38 39 40 41 42 43 44 45 46 47 48

// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');

function solution(S) {
    // write your code in JavaScript (Node.js 8.9.4)
    const N = S.length;
    let stack = [];
    
    for(let i=0; i<N; i++){
        switch(S.charAt(i)){
            case '(':
            case '{':
            case '[':
                stack.push(S.charAt(i));
                break;
            case ')':
                if(stack[stack.length-1] == '('){
                    stack.pop();
                }
                else{
                    return 0;
                }
                break;
            case '}':
                if(stack[stack.length-1] == '{'){
                    stack.pop();
                }
                else{
                    return 0;
                }
                break;
            case ']':
                if(stack[stack.length-1] == '['){
                    stack.pop();
                }
                else{
                    return 0;
                }
                break;
        }
    }
    if(!stack){
        return 1;
    }
    else{
        return 0;
    }
}

Analysis

expand all Example tests

▶

example1
example test 1

✘

WRONG ANSWER
got 0 expected 1

0.072 s

WRONG ANSWER, got 0 expected 1

▶

example2
example test 2

✔

0.072 s

Code: 06:26:23 UTC, js, verify, result: Failed

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 37 38 39 40 41 42 43 44 45 46 47 48 49

// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');

function solution(S) {
    // write your code in JavaScript (Node.js 8.9.4)
    const N = S.length;
    let stack = [];
    
    for(let i=0; i<N; i++){
        switch(S.charAt(i)){
            case '(':
            case '{':
            case '[':
                stack.push(S.charAt(i));
                break;
            case ')':
                if(stack[stack.length-1] == '('){
                    stack.pop();
                }
                else{
                    return 0;
                }
                break;
            case '}':
                if(stack[stack.length-1] == '{'){
                    stack.pop();
                }
                else{
                    return 0;
                }
                break;
            case ']':
                if(stack[stack.length-1] == '['){
                    stack.pop();
                }
                else{
                    return 0;
                }
                break;
        }
    }
    console.log(stack);
    if(!stack){
        return 1;
    }
    else{
        return 0;
    }
}

Analysis

expand all Example tests

▶

example1
example test 1

✘

WRONG ANSWER
got 0 expected 1

0.072 s

WRONG ANSWER, got 0 expected 1

stdout:

[]

▶

example2
example test 2

✔

0.068 s

Code: 06:28:45 UTC, js, 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 37 38 39 40 41 42 43 44 45 46 47 48 49

// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');

function solution(S) {
    // write your code in JavaScript (Node.js 8.9.4)
    const N = S.length;
    let stack = [];
    
    for(let i=0; i<N; i++){
        switch(S.charAt(i)){
            case '(':
            case '{':
            case '[':
                stack.push(S.charAt(i));
                break;
            case ')':
                if(stack[stack.length-1] == '('){
                    stack.pop();
                }
                else{
                    return 0;
                }
                break;
            case '}':
                if(stack[stack.length-1] == '{'){
                    stack.pop();
                }
                else{
                    return 0;
                }
                break;
            case ']':
                if(stack[stack.length-1] == '['){
                    stack.pop();
                }
                else{
                    return 0;
                }
                break;
        }
    }
    console.log(stack);
    if(stack){
        return 1;
    }
    else{
        return 0;
    }
}

Code: 06:29:02 UTC, js, 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 37 38 39 40 41 42 43 44 45 46 47 48 49

// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');

function solution(S) {
    // write your code in JavaScript (Node.js 8.9.4)
    const N = S.length;
    let stack = [];
    
    for(let i=0; i<N; i++){
        switch(S.charAt(i)){
            case '(':
            case '{':
            case '[':
                stack.push(S.charAt(i));
                break;
            case ')':
                if(stack[stack.length-1] == '('){
                    stack.pop();
                }
                else{
                    return 0;
                }
                break;
            case '}':
                if(stack[stack.length-1] == '{'){
                    stack.pop();
                }
                else{
                    return 0;
                }
                break;
            case ']':
                if(stack[stack.length-1] == '['){
                    stack.pop();
                }
                else{
                    return 0;
                }
                break;
        }
    }
    console.log(stack);
    if(stack.length > 0){
        return 0;
    }
    else{
        return 1;
    }
}

Analysis

expand all Example tests

▶

example1
example test 1

✔

0.072 s

stdout:

[]

▶

example2
example test 2

✔

0.068 s

Code: 06:29:14 UTC, js, 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 37 38 39 40 41 42 43 44 45 46 47 48 49

// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');

function solution(S) {
    // write your code in JavaScript (Node.js 8.9.4)
    const N = S.length;
    let stack = [];
    
    for(let i=0; i<N; i++){
        switch(S.charAt(i)){
            case '(':
            case '{':
            case '[':
                stack.push(S.charAt(i));
                break;
            case ')':
                if(stack[stack.length-1] == '('){
                    stack.pop();
                }
                else{
                    return 0;
                }
                break;
            case '}':
                if(stack[stack.length-1] == '{'){
                    stack.pop();
                }
                else{
                    return 0;
                }
                break;
            case ']':
                if(stack[stack.length-1] == '['){
                    stack.pop();
                }
                else{
                    return 0;
                }
                break;
        }
    }
    
    if(stack.length > 0){
        return 0;
    }
    else{
        return 1;
    }
}

Code: 06:29:52 UTC, js, 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 37 38 39 40 41 42 43 44 45 46 47 48 49

// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');

function solution(S) {
    // write your code in JavaScript (Node.js 8.9.4)
    const N = S.length;
    let stack = [];
    
    for(let i=0; i<N; i++){
        switch(S.charAt(i)){
            case '(':
            case '{':
            case '[':
                stack.push(S.charAt(i));
                break;
            case ')':
                if(stack[stack.length-1] == '('){
                    stack.pop();
                }
                else{
                    return 0;
                }
                break;
            case '}':
                if(stack[stack.length-1] == '{'){
                    stack.pop();
                }
                else{
                    return 0;
                }
                break;
            case ']':
                if(stack[stack.length-1] == '['){
                    stack.pop();
                }
                else{
                    return 0;
                }
                break;
        }
    }
    
    if(stack.length > 0){
        return 0;
    }
    else{
        return 1;
    }
}

Analysis

expand all Example tests

▶

example1
example test 1

✔

0.072 s

▶

example2
example test 2

✔

0.072 s

Code: 06:29:57 UTC, js, 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 37 38 39 40 41 42 43 44 45 46 47 48 49

// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');

function solution(S) {
    // write your code in JavaScript (Node.js 8.9.4)
    const N = S.length;
    let stack = [];
    
    for(let i=0; i<N; i++){
        switch(S.charAt(i)){
            case '(':
            case '{':
            case '[':
                stack.push(S.charAt(i));
                break;
            case ')':
                if(stack[stack.length-1] == '('){
                    stack.pop();
                }
                else{
                    return 0;
                }
                break;
            case '}':
                if(stack[stack.length-1] == '{'){
                    stack.pop();
                }
                else{
                    return 0;
                }
                break;
            case ']':
                if(stack[stack.length-1] == '['){
                    stack.pop();
                }
                else{
                    return 0;
                }
                break;
        }
    }
    
    if(stack.length > 0){
        return 0;
    }
    else{
        return 1;
    }
}

Analysis

expand all Example tests

▶

example1
example test 1

✔

0.068 s

▶

example2
example test 2

✔

0.072 s

Code: 06:29:59 UTC, js, 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 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49

// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');

function solution(S) {
    // write your code in JavaScript (Node.js 8.9.4)
    const N = S.length;
    let stack = [];
    
    for(let i=0; i<N; i++){
        switch(S.charAt(i)){
            case '(':
            case '{':
            case '[':
                stack.push(S.charAt(i));
                break;
            case ')':
                if(stack[stack.length-1] == '('){
                    stack.pop();
                }
                else{
                    return 0;
                }
                break;
            case '}':
                if(stack[stack.length-1] == '{'){
                    stack.pop();
                }
                else{
                    return 0;
                }
                break;
            case ']':
                if(stack[stack.length-1] == '['){
                    stack.pop();
                }
                else{
                    return 0;
                }
                break;
        }
    }
    
    if(stack.length > 0){
        return 0;
    }
    else{
        return 1;
    }
}

Analysis summary

The solution obtained perfect score.

Analysis

Detected time complexity:

O(N)

expand all Example tests

▶

example1
example test 1

✔

0.072 s

▶

example2
example test 2

✔

0.072 s

expand all Correctness tests

▶

negative_match
invalid structures

✔

0.072 s

▶

empty
empty string

✔

0.072 s

▶

simple_grouped
simple grouped positive and negative test, length=22

✔

0.072 s

expand all Performance tests

▶

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

✔

0.096 s

0.072 s

0.080 s

▶

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

✔

0.076 s

0.072 s

▶

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

✔

0.080 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.076 s

0.072 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.084 s

0.080 s