Test results - Codility

Tasks Details

easy

1. StoneWall

Cover "Manhattan skyline" using the minimum number of rectangles.

Task Score

100%

Correctness

100%

Performance

100%

You are going to build a stone wall. The wall should be straight and N meters long, and its thickness should be constant; however, it should have different heights in different places. The height of the wall is specified by an array H of N positive integers. H[I] is the height of the wall from I to I+1 meters to the right of its left end. In particular, H[0] is the height of the wall's left end and H[N−1] is the height of the wall's right end.

The wall should be built of cuboid stone blocks (that is, all sides of such blocks are rectangular). Your task is to compute the minimum number of blocks needed to build the wall.

Write a function:

function solution(H);

that, given an array H of N positive integers specifying the height of the wall, returns the minimum number of blocks needed to build it.

For example, given array H containing N = 9 integers:

H[0] = 8 H[1] = 8 H[2] = 5 H[3] = 7 H[4] = 9 H[5] = 8 H[6] = 7 H[7] = 4 H[8] = 8

the function should return 7. The figure shows one possible arrangement of seven blocks.

Write an efficient algorithm for the following assumptions:

N is an integer within the range [1..100,000];

each element of array H is an integer within the range [1..1,000,000,000].

Solution

Programming language used JavaScript

Time spent on task 16 minutes

Notes

not defined yet

Code: 09:12:19 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(int[] H) {
        // write your code in Java SE 8
    }
}

Code: 09:12:23 UTC, js, autosave

show code in pop-up

1 2 3 4 5 6

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

function solution(H) {
    // write your code in JavaScript (Node.js 8.9.4)
}

Code: 09:12:33 UTC, js, autosave

show code in pop-up

1 2 3 4 5 6 7

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

function solution(H) {
    // write your code in JavaScript (Node.js 8.9.4)
    let 
}

Code: 09:12:59 UTC, js, autosave

show code in pop-up

1 2 3 4 5 6 7 8

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

function solution(H) {
    // write your code in JavaScript (Node.js 8.9.4)
    let lastMinHeight = [];
    
}

Code: 09:13:28 UTC, js, autosave

show code in pop-up

1 2 3 4 5 6 7 8

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

function solution(H) {
    // write your code in JavaScript (Node.js 8.9.4)
    let lastMinHeight = [];
    for (let i = 0; i)
}

Code: 09:13:39 UTC, js, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10

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

function solution(H) {
    // write your code in JavaScript (Node.js 8.9.4)
    let lastMinHeight = [];
    for (let i = 0; i < H.length; i++) {
        
    }
}

Code: 09:13:54 UTC, js, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10

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

function solution(H) {
    // write your code in JavaScript (Node.js 8.9.4)
    let lastMinHeight = [H[0]];
    for (let i = 0; i < H.length; i++) {
        
    }
}

Code: 09:14:05 UTC, js, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10

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

function solution(H) {
    // write your code in JavaScript (Node.js 8.9.4)
    let lastMinHeight = [H[0]];
    for (let i = 1; i < H.length; i++) {
        
    }
}

Code: 09:14:35 UTC, js, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10

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

function solution(H) {
    // write your code in JavaScript (Node.js 8.9.4)
    let lastMinHeight = [H[0]];
    for (let i = 1; i < H.length; i++) {
        if
    }
}

Code: 09:14:57 UTC, js, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10

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

function solution(H) {
    // write your code in JavaScript (Node.js 8.9.4)
    let lastMinHeight = [H[0]];
    for (let i = 1; i < H.length; i++) {
        if (H[i] > lastMinHeigh[])
    }
}

Code: 09:15:27 UTC, js, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11

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

function solution(H) {
    // write your code in JavaScript (Node.js 8.9.4)
    let lastMinHeight = [H[0]];
    for (let i = 1; i < H.length; i++) {
        if (las)
        if (H[i] > lastMinHeight[lastMinHeight.length])
    }
}

Code: 09:15:41 UTC, js, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13

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

function solution(H) {
    // write your code in JavaScript (Node.js 8.9.4)
    let lastMinHeight = [H[0]];
    for (let i = 1; i < H.length; i++) {
        if (lastMinHeigh.length === 0) {
            
        }
        if (H[i] > lastMinHeight[lastMinHeight.length])
    }
}

Code: 09:16:09 UTC, js, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13

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

function solution(H) {
    // write your code in JavaScript (Node.js 8.9.4)
    let lastMinHeight = [];
    for (let i = 0; i < H.length; i++) {
        if (lastMinHeigh.length === 0) {
            lastMinHeigh.push(H[i])
        }
        if (H[i] > lastMinHeight[lastMinHeight.length])
    }
}

Code: 09:16:20 UTC, js, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14

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

function solution(H) {
    // write your code in JavaScript (Node.js 8.9.4)
    let lastMinHeight = [];
    for (let i = 0; i < H.length; i++) {
        if (lastMinHeigh.length === 0) {
            lastMinHeigh.push(H[i])
        } else if (H[i] > lastMinHeight[lastMinHeight.length]) {
            
        }
    }
}

Code: 09:16:30 UTC, js, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14

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

function solution(H) {
    // write your code in JavaScript (Node.js 8.9.4)
    let lastMinHeight = [];
    for (let i = 0; i < H.length; i++) {
        if (lastMinHeigh.length === 0) {
            lastMinHeigh.push(H[i])
        } else if (H[i] > lastMinHeight[lastMinHeight.length]) {
            last
        }
    }
}

Code: 09:16:40 UTC, js, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14

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

function solution(H) {
    // write your code in JavaScript (Node.js 8.9.4)
    let lastMinHeight = [];
    for (let i = 0; i < H.length; i++) {
        if (lastMinHeigh.length === 0 || H[i] > lastMinHeight[lastMinHeight.length]) {
            lastMinHeigh.push(H[i])
        } else if (H[i] > lastMinHeight[lastMinHeight.length]) {
            last
        }
    }
}

Code: 09:16:50 UTC, js, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12

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

function solution(H) {
    // write your code in JavaScript (Node.js 8.9.4)
    let lastMinHeight = [];
    for (let i = 0; i < H.length; i++) {
        if (lastMinHeigh.length === 0 || H[i] > lastMinHeight[lastMinHeight.length]) {
            lastMinHeigh.push(H[i])
        } 
    }
}

Code: 09:17:18 UTC, js, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15

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

function solution(H) {
    // write your code in JavaScript (Node.js 8.9.4)
    let lastMinHeight = [];
    let blocks = 0;
    for (let i = 0; i < H.length; i++) {
        if (lastMinHeigh.length === 0 || H[i] > lastMinHeight[lastMinHeight.length]) {
            lastMinHeigh.push(H[i])
        } else {
            
        }
    }
}

Code: 09:18:49 UTC, js, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15

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

function solution(H) {
    // write your code in JavaScript (Node.js 8.9.4)
    let lastMinHeight = [];
    let blocks = 0;
    for (let i = 0; i < H.length; i++) {
        if (lastMinHeigh.length === 0 || H[i] > lastMinHeight[lastMinHeight.length]) {
            lastMinHeigh.push(H[i])
        } else if{
            
        }
    }
}

Code: 09:19:08 UTC, js, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15

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

function solution(H) {
    // write your code in JavaScript (Node.js 8.9.4)
    let lastMinHeight = [];
    let blocks = 0;
    for (let i = 0; i < H.length; i++) {
        if (lastMinHeigh.length === 0 || H[i] > lastMinHeight[lastMinHeight.length]) {
            lastMinHeigh.push(H[i])
        } else if (H[i] < lastMinHeight[] {
            
        }
    }
}

Code: 09:19:29 UTC, js, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15

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

function solution(H) {
    // write your code in JavaScript (Node.js 8.9.4)
    let lastMinHeight = [];
    let blocks = 0;
    for (let i = 0; i < H.length; i++) {
        if (lastMinHeigh.length === 0 || H[i] > lastMinHeight[lastMinHeight.length]) {
            lastMinHeigh.push(H[i])
        } else if (H[i] < lastMinHeight[lastMinHeigh.length-1] {
            
        }
    }
}

Code: 09:19:39 UTC, js, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15

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

function solution(H) {
    // write your code in JavaScript (Node.js 8.9.4)
    let lastMinHeight = [];
    let blocks = 0;
    for (let i = 0; i < H.length; i++) {
        if (lastMinHeigh.length === 0 || H[i] > lastMinHeight[lastMinHeight.length-1]) {
            lastMinHeigh.push(H[i])
        } else if (H[i] < lastMinHeight[lastMinHeigh.length-1] {
            
        }
    }
}

Code: 09:20:04 UTC, js, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15

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

function solution(H) {
    // write your code in JavaScript (Node.js 8.9.4)
    let lastMinHeight = [];
    let blocks = 0;
    for (let i = 0; i < H.length; i++) {
        if (lastMinHeigh.length === 0 || H[i] > lastMinHeight[lastMinHeight.length-1]) {
            lastMinHeigh.push(H[i])
        } else if (H[i] < lastMinHeight[lastMinHeigh.length-1] {
            while ()
        }
    }
}

Code: 09:20:24 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

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

function solution(H) {
    // write your code in JavaScript (Node.js 8.9.4)
    let lastMinHeight = [];
    let blocks = 0;
    for (let i = 0; i < H.length; i++) {
        if (lastMinHeight.length === 0 || H[i] > lastMinHeight[lastMinHeight.length-1]) {
            lastMinHeight.push(H[i])
        } else if (H[i] < lastMinHeight[lastMinHeigh.length-1] {
            while (lastMinHeight.length > 0) {
                
            }
        }
    }
}

Code: 09:20:54 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

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

function solution(H) {
    // write your code in JavaScript (Node.js 8.9.4)
    let blc = [];
    let blocks = 0;
    for (let i = 0; i < H.length; i++) {
        if (lastMinHeight.length === 0 || H[i] > lastMinHeight[lastMinHeight.length-1]) {
            lastMinHeight.push(H[i])
        } else if (H[i] < lastMinHeight[lastMinHeigh.length-1] {
            while (lastMinHeight.length > 0) {
                
            }
        }
    }
}

Code: 09:21:11 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

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

function solution(H) {
    // write your code in JavaScript (Node.js 8.9.4)
    let blockStack = [];
    let blocks = 0;
    for (let i = 0; i < H.length; i++) {
        if (blockStack.length === 0 || H[i] > blockStack[blockStack.length-1]) {
            blockStack.push(H[i])
        } else if (H[i] < blockStack[blockStack.length-1] {
            while (blockStack.length > 0) {
                
            }
        }
    }
}

Code: 09:21:23 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

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

function solution(H) {
    // write your code in JavaScript (Node.js 8.9.4)
    let blockStack = [];
    let blocks = 0;
    for (let i = 0; i < H.length; i++) {
        if (blockStack.length === 0 || H[i] > blockStack[blockStack.length-1]) {
            blockStack.push(H[i]);
        } else if (H[i] < blockStack[blockStack.length-1] {
            while (blockStack.length > 0) {
                
            }
        }
    }
}

Code: 09:21:59 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

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

function solution(H) {
    // write your code in JavaScript (Node.js 8.9.4)
    let blockStack = [];
    let blocks = 0;
    for (let i = 0; i < H.length; i++) {
        if (blockStack.length === 0 || H[i] > blockStack[blockStack.length-1]) {
            blockStack.push(H[i]);
        } else if (H[i] < blockStack[blockStack.length-1] {
            while (blockStack.length > 0) {
                let 
            }
        }
    }
}

Code: 09:22:21 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

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

function solution(H) {
    // write your code in JavaScript (Node.js 8.9.4)
    let blockStack = [];
    let blocks = 0;
    for (let i = 0; i < H.length; i++) {
        if (blockStack.length === 0 || H[i] > blockStack[blockStack.length-1]) {
            blockStack.push(H[i]);
        } else if (H[i] < blockStack[blockStack.length-1] {
            while (blockStack.length > 0) {
                let j = blockStack.length - 1;
                if (H[i])
            }
        }
    }
}

Code: 09:22:40 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

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

function solution(H) {
    // write your code in JavaScript (Node.js 8.9.4)
    let blockStack = [];
    let blocks = 0;
    for (let i = 0; i < H.length; i++) {
        if (blockStack.length === 0 || H[i] > blockStack[blockStack.length-1]) {
            blockStack.push(H[i]);
        } else if (H[i] < blockStack[blockStack.length-1] {
            while (blockStack.length > 0) {
                let j = blockStack.length - 1;
                if (H[i] < blockStack[j]) {
                    
                }
            }
        }
    }
}

Code: 09:23:00 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

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

function solution(H) {
    // write your code in JavaScript (Node.js 8.9.4)
    let blockStack = [];
    let blocks = 0;
    for (let i = 0; i < H.length; i++) {
        if (blockStack.length === 0 || H[i] > blockStack[blockStack.length-1]) {
            blockStack.push(H[i]);
        } else if (H[i] < blockStack[blockStack.length-1] {
            while (blockStack.length > 0) {
                let j = blockStack.length - 1;
                if (H[i] < blockStack[j]) {
                    blocks++;
                    blockStack.pop();
                }
            }
        }
    }
}

Code: 09:23:30 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

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

function solution(H) {
    // write your code in JavaScript (Node.js 8.9.4)
    let blockStack = [];
    let blocks = 0;
    for (let i = 0; i < H.length; i++) {
        if (blockStack.length === 0 || H[i] > blockStack[blockStack.length-1]) {
            blockStack.push(H[i]);
        } else if (H[i] < blockStack[blockStack.length-1] {
            while (blockStack.length > 0) {
                let j = blockStack.length - 1;
                if (H[i] < blockStack[j]) {
                    blocks++;
                    blockStack.pop();
                } else if (H[i] > block)
            }
        }
    }
}

Code: 09:23:54 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

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

function solution(H) {
    // write your code in JavaScript (Node.js 8.9.4)
    let blockStack = [];
    let blocks = 0;
    for (let i = 0; i < H.length; i++) {
        if (blockStack.length === 0 || H[i] > blockStack[blockStack.length-1]) {
            blockStack.push(H[i]);
        } else if (H[i] < blockStack[blockStack.length-1] {
            while (blockStack.length > 0) {
                let j = blockStack.length - 1;
                if (H[i] < blockStack[j]) {
                    blocks++;
                    blockStack.pop();
                } else if (H[i] > blockStack[j]) {
                    blockStack.push(H[i]);
                }
            }
        }
    }
}

Code: 09:24:24 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

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

function solution(H) {
    // write your code in JavaScript (Node.js 8.9.4)
    let blockStack = [];
    let blocks = 0;
    for (let i = 0; i < H.length; i++) {
        if (blockStack.length === 0 || H[i] > blockStack[blockStack.length-1]) {
            blockStack.push(H[i]);
        } else if (H[i] < blockStack[blockStack.length-1] {
            while (blockStack.length > 0) {
                let j = blockStack.length - 1;
                if (H[i] < blockStack[j]) {
                    blocks++;
                    blockStack.pop();
                } else if (H[i] > blockStack[j]) {
                    blockStack.push(H[i]);
                    break;
                } else {
                    break;
                }
            }
        }
    }
}

Code: 09:24:54 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

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

function solution(H) {
    // write your code in JavaScript (Node.js 8.9.4)
    let blockStack = [];
    let blocks = 0;
    for (let i = 0; i < H.length; i++) {
        if (blockStack.length === 0 || H[i] > blockStack[blockStack.length-1]) {
            blockStack.push(H[i]);
        } else if (H[i] < blockStack[blockStack.length-1] {
            while (blockStack.length > 0) {
                let j = blockStack.length - 1;
                if (H[i] < blockStack[j]) {
                    blocks++;
                    blockStack.pop();
                } else if (H[i] > blockStack[j]) {
                    blockStack.push(H[i]);
                    break;
                } else {
                    break;
                }
            }
        }
        if (blockStack.length === 0) {
            blockStack.push(H[i])
        }
    }
}

Code: 09:25:04 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

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

function solution(H) {
    // write your code in JavaScript (Node.js 8.9.4)
    let blockStack = [];
    let blocks = 0;
    for (let i = 0; i < H.length; i++) {
        if (blockStack.length === 0 || H[i] > blockStack[blockStack.length-1]) {
            blockStack.push(H[i]);
        } else if (H[i] < blockStack[blockStack.length-1] {
            while (blockStack.length > 0) {
                let j = blockStack.length - 1;
                if (H[i] < blockStack[j]) {
                    blocks++;
                    blockStack.pop();
                } else if (H[i] > blockStack[j]) {
                    blockStack.push(H[i]);
                    break;
                } else {
                    break;
                }
            }
        }
        if (blockStack.length === 0) {
            blockStack.push(H[i]);
        }
    }
}

Code: 09:25:34 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

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

function solution(H) {
    // write your code in JavaScript (Node.js 8.9.4)
    let blockStack = [];
    let blocks = 0;
    for (let i = 0; i < H.length; i++) {
        if (blockStack.length === 0 || H[i] > blockStack[blockStack.length-1]) {
            blockStack.push(H[i]);
        } else if (H[i] < blockStack[blockStack.length-1] {
            while (blockStack.length > 0) {
                let j = blockStack.length - 1;
                if (H[i] < blockStack[j]) {
                    blocks++;
                    blockStack.pop();
                } else if (H[i] > blockStack[j]) {
                    blockStack.push(H[i]);
                    break;
                } else {
                    break;
                }
            }
        }
        if (blockStack.length === 0) {
            blockStack.push(H[i]);
        }
    }
    return blocks +
}

Code: 09:25:47 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

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

function solution(H) {
    // write your code in JavaScript (Node.js 8.9.4)
    let blockStack = [];
    let blocks = 0;
    for (let i = 0; i < H.length; i++) {
        if (blockStack.length === 0 || H[i] > blockStack[blockStack.length-1]) {
            blockStack.push(H[i]);
        } else if (H[i] < blockStack[blockStack.length-1] {
            while (blockStack.length > 0) {
                let j = blockStack.length - 1;
                if (H[i] < blockStack[j]) {
                    blocks++;
                    blockStack.pop();
                } else if (H[i] > blockStack[j]) {
                    blockStack.push(H[i]);
                    break;
                } else {
                    break;
                }
            }
        }
        if (blockStack.length === 0) {
            blockStack.push(H[i]);
        }
    }
    return blocks + blockStack.length;
}

Analysis

expand all Example tests

▶

example

✘

RUNTIME ERROR
tested program terminated with exit code 1

0.072 s

RUNTIME ERROR, tested program terminated with exit code 1

stderr:

solution.js:11
        } else if (H[i] < blockStack[blockStack.length-1] {
                                                          ^

SyntaxError: Unexpected token {
    at createScript (vm.js:80:10)
    at Object.runInNewContext (vm.js:135:10)
    at getSolution (/tmp/exec.js:392:29)
    at Promise.resolve.then (/tmp/exec.js:426:34)
    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: 09:25: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

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

function solution(H) {
    // write your code in JavaScript (Node.js 8.9.4)
    let blockStack = [];
    let blocks = 0;
    for (let i = 0; i < H.length; i++) {
        if (blockStack.length === 0 || H[i] > blockStack[blockStack.length-1]) {
            blockStack.push(H[i]);
        } else if (H[i] < blockStack[blockStack.length-1]) {
            while (blockStack.length > 0) {
                let j = blockStack.length - 1;
                if (H[i] < blockStack[j]) {
                    blocks++;
                    blockStack.pop();
                } else if (H[i] > blockStack[j]) {
                    blockStack.push(H[i]);
                    break;
                } else {
                    break;
                }
            }
        }
        if (blockStack.length === 0) {
            blockStack.push(H[i]);
        }
    }
    return blocks + blockStack.length;
}

Analysis

expand all Example tests

▶

example

✔

0.068 s

Code: 09:26:05 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

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

function solution(H) {
    // write your code in JavaScript (Node.js 8.9.4)
    let blockStack = [];
    let blocks = 0;
    for (let i = 0; i < H.length; i++) {
        if (blockStack.length === 0 || H[i] > blockStack[blockStack.length-1]) {
            blockStack.push(H[i]);
        } else if (H[i] < blockStack[blockStack.length-1]) {
            while (blockStack.length > 0) {
                let j = blockStack.length - 1;
                if (H[i] < blockStack[j]) {
                    blocks++;
                    blockStack.pop();
                } else if (H[i] > blockStack[j]) {
                    blockStack.push(H[i]);
                    break;
                } else {
                    break;
                }
            }
        }
        if (blockStack.length === 0) {
            blockStack.push(H[i]);
        }
    }
    return blocks + blockStack.length;
}

Code: 09:26:11 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

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

function solution(H) {
    // write your code in JavaScript (Node.js 8.9.4)
    let blockStack = [];
    let blocks = 0;
    for (let i = 0; i < H.length; i++) {
        if (blockStack.length === 0 || H[i] > blockStack[blockStack.length-1]) {
            blockStack.push(H[i]);
        } else if (H[i] < blockStack[blockStack.length-1]) {
            while (blockStack.length > 0) {
                let j = blockStack.length - 1;
                if (H[i] < blockStack[j]) {
                    blocks++;
                    blockStack.pop();
                } else if (H[i] > blockStack[j]) {
                    blockStack.push(H[i]);
                    break;
                } else {
                    break;
                }
            }
        }
        if (blockStack.length === 0) {
            blockStack.push(H[i]);
        }
    }
    return blocks + blockStack.length;
}

User test case 1:

[1, 1, 1]

Analysis

expand all Example tests

▶

example

✔

0.072 s

expand all User tests

▶

test_data1

✔

0.068 s

OK
function result: 1

Code: 09:26:21 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

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

function solution(H) {
    // write your code in JavaScript (Node.js 8.9.4)
    let blockStack = [];
    let blocks = 0;
    for (let i = 0; i < H.length; i++) {
        if (blockStack.length === 0 || H[i] > blockStack[blockStack.length-1]) {
            blockStack.push(H[i]);
        } else if (H[i] < blockStack[blockStack.length-1]) {
            while (blockStack.length > 0) {
                let j = blockStack.length - 1;
                if (H[i] < blockStack[j]) {
                    blocks++;
                    blockStack.pop();
                } else if (H[i] > blockStack[j]) {
                    blockStack.push(H[i]);
                    break;
                } else {
                    break;
                }
            }
        }
        if (blockStack.length === 0) {
            blockStack.push(H[i]);
        }
    }
    return blocks + blockStack.length;
}

User test case 1:

[1, 1, 1]

User test case 2:

[1, 2, 3]

Analysis

expand all Example tests

▶

example

✔

0.068 s

expand all User tests

▶

test_data1

✔

0.068 s

OK
function result: 1

▶

test_data2

✔

0.068 s

OK
function result: 3

Code: 09:26:33 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

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

function solution(H) {
    // write your code in JavaScript (Node.js 8.9.4)
    let blockStack = [];
    let blocks = 0;
    for (let i = 0; i < H.length; i++) {
        if (blockStack.length === 0 || H[i] > blockStack[blockStack.length-1]) {
            blockStack.push(H[i]);
        } else if (H[i] < blockStack[blockStack.length-1]) {
            while (blockStack.length > 0) {
                let j = blockStack.length - 1;
                if (H[i] < blockStack[j]) {
                    blocks++;
                    blockStack.pop();
                } else if (H[i] > blockStack[j]) {
                    blockStack.push(H[i]);
                    break;
                } else {
                    break;
                }
            }
        }
        if (blockStack.length === 0) {
            blockStack.push(H[i]);
        }
    }
    return blocks + blockStack.length;
}

User test case 1:

[1, 1, 1]

User test case 2:

[1, 2, 3]

User test case 3:

[1, 2, 3, 2, 1]

Analysis

expand all Example tests

▶

example

✔

0.072 s

expand all User tests

▶

test_data1

✔

0.072 s

OK
function result: 1

▶

test_data2

✔

0.072 s

OK
function result: 3

▶

test_data3

✔

0.068 s

OK
function result: 3

Code: 09:26:37 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

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

function solution(H) {
    // write your code in JavaScript (Node.js 8.9.4)
    let blockStack = [];
    let blocks = 0;
    for (let i = 0; i < H.length; i++) {
        if (blockStack.length === 0 || H[i] > blockStack[blockStack.length-1]) {
            blockStack.push(H[i]);
        } else if (H[i] < blockStack[blockStack.length-1]) {
            while (blockStack.length > 0) {
                let j = blockStack.length - 1;
                if (H[i] < blockStack[j]) {
                    blocks++;
                    blockStack.pop();
                } else if (H[i] > blockStack[j]) {
                    blockStack.push(H[i]);
                    break;
                } else {
                    break;
                }
            }
        }
        if (blockStack.length === 0) {
            blockStack.push(H[i]);
        }
    }
    return blocks + blockStack.length;
}

Code: 09:26:48 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

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

function solution(H) {
    // write your code in JavaScript (Node.js 8.9.4)
    let blockStack = [];
    let blocks = 0;
    for (let i = 0; i < H.length; i++) {
        if (blockStack.length === 0 || H[i] > blockStack[blockStack.length-1]) {
            blockStack.push(H[i]);
        } else if (H[i] < blockStack[blockStack.length-1]) {
            while (blockStack.length > 0) {
                let j = blockStack.length - 1;
                if (H[i] < blockStack[j]) {
                    blocks++;
                    blockStack.pop();
                } else if (H[i] > blockStack[j]) {
                    blockStack.push(H[i]);
                    break;
                } else {
                    break;
                }
            }
        }
        if (blockStack.length === 0) {
            blockStack.push(H[i]);
        }
    }
    return blocks + blockStack.length;
}

Code: 09:26:55 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

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

function solution(H) {
    // write your code in JavaScript (Node.js 8.9.4)
    let blockStack = [];
    let blocks = 0;
    for (let i = 0; i < H.length; i++) {
        if (blockStack.length === 0 || H[i] > blockStack[blockStack.length-1]) {
            blockStack.push(H[i]);
        } else if (H[i] < blockStack[blockStack.length-1]) {
            while (blockStack.length > 0) {
                let j = blockStack.length - 1;
                if (H[i] < blockStack[j]) {
                    blocks++;
                    blockStack.pop();
                } else if (H[i] > blockStack[j]) {
                    blockStack.push(H[i]);
                    break;
                } else {
                    break;
                }
            }
        }
        if (blockStack.length === 0) {
            blockStack.push(H[i]);
        }
    }
    return blocks + blockStack.length;
}

User test case 1:

[1, 1, 1]

User test case 2:

[1, 2, 3]

User test case 3:

[1, 2, 3, 2, 1]

User test case 4:

[4, 5, 6, 4, 1, 2, 3, 2]

Analysis

expand all Example tests

▶

example

✔

0.068 s

expand all User tests

▶

test_data1

✔

0.068 s

OK
function result: 1

▶

test_data2

✔

0.068 s

OK
function result: 3

▶

test_data3

✔

0.068 s

OK
function result: 3

▶

test_data4

✔

0.068 s

OK
function result: 6

Code: 09:27:25 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

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

function solution(H) {
    // write your code in JavaScript (Node.js 8.9.4)
    let blockStack = [];
    let blocks = 0;
    for (let i = 0; i < H.length; i++) {
        if (blockStack.length === 0 || H[i] > blockStack[blockStack.length-1]) {
            blockStack.push(H[i]);
        } else if (H[i] < blockStack[blockStack.length-1]) {
            while (blockStack.length > 0) {
                let j = blockStack.length - 1;
                if (H[i] < blockStack[j]) {
                    blocks++;
                    blockStack.pop();
                } else if (H[i] > blockStack[j]) {
                    blockStack.push(H[i]);
                    break;
                } else {
                    break;
                }
            }
        }
        if (blockStack.length === 0) {
            blockStack.push(H[i]);
        }
    }
    return blocks + blockStack.length;
}

User test case 1:

[1, 1, 1]

User test case 2:

[1, 2, 3]

User test case 3:

[1, 2, 3, 2, 1]

User test case 4:

[4, 5, 6, 4, 1, 2, 3, 2]

Analysis

expand all Example tests

▶

example

✔

0.072 s

expand all User tests

▶

test_data1

✔

0.072 s

OK
function result: 1

▶

test_data2

✔

0.072 s

OK
function result: 3

▶

test_data3

✔

0.072 s

OK
function result: 3

▶

test_data4

✔

0.072 s

OK
function result: 6

Code: 09:27:27 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

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

function solution(H) {
    // write your code in JavaScript (Node.js 8.9.4)
    let blockStack = [];
    let blocks = 0;
    for (let i = 0; i < H.length; i++) {
        if (blockStack.length === 0 || H[i] > blockStack[blockStack.length-1]) {
            blockStack.push(H[i]);
        } else if (H[i] < blockStack[blockStack.length-1]) {
            while (blockStack.length > 0) {
                let j = blockStack.length - 1;
                if (H[i] < blockStack[j]) {
                    blocks++;
                    blockStack.pop();
                } else if (H[i] > blockStack[j]) {
                    blockStack.push(H[i]);
                    break;
                } else {
                    break;
                }
            }
        }
        if (blockStack.length === 0) {
            blockStack.push(H[i]);
        }
    }
    return blocks + blockStack.length;
}

Analysis summary

The solution obtained perfect score.

Analysis

Detected time complexity:

O(N)

expand all Example tests

▶

example

✔

0.068 s

expand all Correctness tests

▶

simple1

✔

0.068 s

▶

simple2

✔

0.072 s

▶

simple3

✔

0.072 s

▶

simple4

✔

0.072 s

▶

boundary_cases

✔

0.068 s

expand all Performance tests

▶

medium1

✔

0.068 s

▶

medium2

✔

0.068 s

▶

medium3

✔

0.068 s

▶

medium4

✔

0.068 s

▶

large_piramid

✔

0.112 s

▶

large_increasing_decreasing

✔

0.112 s

▶

large_up_to_20

✔

0.108 s

▶

large_up_to_100

✔

0.108 s

▶

large_max

✔

0.112 s