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 47 minutes

Notes

not defined yet

Task timeline

Code: 10:34:42 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) {
        // Implement your solution here
    }
}

Code: 10:34:48 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) {
    // Implement your solution here
}

Code: 10:35:18 UTC, js, autosave

show code in pop-up

1 2 3 4 5 6

function solution(H) {
    var stack = 0
    for(var i = 0;i<H.length;i++){
        if()
    }
}

Code: 10:35:31 UTC, js, autosave

show code in pop-up

1 2 3 4 5 6 7

function solution(H) {
    var stack = 0
    var current_height = 0
    for(var i = 0;i<H.length;i++){
        if()
    }
}

Code: 10:35:41 UTC, js, autosave

show code in pop-up

1 2 3 4 5 6 7 8

function solution(H) {
    var stack = 0
    var current_height = 0
    for(var i = 0;i<H.length;i++){
        current_height = H[i]
        if()
    }
}

Code: 10:35:52 UTC, js, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9

function solution(H) {
    var stack = 0
    var current_height = 0
    for(var i = 0;i<H.length;i++){
        if(current_height)
        
        current_height = H[i]
    }
}

Code: 10:36:11 UTC, js, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9

function solution(H) {
    var stack = 0
    var current_height = 0
    for(var i = 0;i<H.length;i++){
        if(current_height== )
        
        current_height = H[i]
    }
}

Code: 10:36:21 UTC, js, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11

function solution(H) {
    var stack = 0
    var current_height = 0
    for(var i = 0;i<H.length;i++){
        if(current_height== H[i]){
            
        }
        
        current_height = H[i]
    }
}

Code: 10:36:33 UTC, js, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11

function solution(H) {
    var stack = 0
    var current_height = 0
    for(var i = 0;i<H.length;i++){
        if(current_height > H[i]){
            stack
        }
        
        current_height = H[i]
    }
}

Code: 10:36:44 UTC, js, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11

function solution(H) {
    var stack = 0
    var current_height = 0
    for(var i = 0;i<H.length;i++){
        if(current_height != H[i]){
            stack ++
        }
        
        current_height = H[i]
    }
}

Code: 10:36:46 UTC, js, verify, result: Failed

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11

function solution(H) {
    var stack = 0
    var current_height = 0
    for(var i = 0;i<H.length;i++){
        if(current_height != H[i]){
            stack ++
        }
        
        current_height = H[i]
    }
}

Analysis

expand all Example tests

▶

example

✘

RUNTIME ERROR
tested program terminated with exit code 1

0.056 s

RUNTIME ERROR, tested program terminated with exit code 1

stderr:

Invalid result type, integer expected, 'undefined' found
Perhaps you are missing a 'return'?

Code: 10:36:54 UTC, js, verify, result: Failed

show code in pop-up

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

function solution(H) {
    var stack = 0
    var current_height = 0
    for(var i = 0;i<H.length;i++){
        if(current_height != H[i]){
            stack ++
        }
        
        current_height = H[i]
    }
    return stack
}

Analysis

expand all Example tests

▶

example

✘

WRONG ANSWER
got 8 expected 7

0.056 s

WRONG ANSWER, got 8 expected 7

Code: 10:38:15 UTC, js, autosave

show code in pop-up

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

function solution(H) {
    var stack = 
    var current_height = 0
    for(var i = 0;i<H.length;i++){
        if(current_height != H[i]){
            stack ++
        }
        
        current_height = H[i]
    }
    return stack
}

Code: 10:38:26 UTC, js, autosave

show code in pop-up

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

function solution(H) {
    var stack = []
    var current_height = 0
    for(var i = 0;i<H.length;i++){
        if(current_height  H[i]){
            stack ++
        }
        
        current_height = H[i]
    }
    return stack
}

Code: 10:38:39 UTC, js, autosave

show code in pop-up

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

function solution(H) {
    var stack = []
    var current_height = 0
    for(var i = 0;i<H.length;i++){
        if(current_height < H[i]){
            stack ++
        }
        
        current_height = H[i]
    }
    return stack
}

Code: 10:38:49 UTC, js, autosave

show code in pop-up

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

function solution(H) {
    var stack = []
    var current_height = 0
    for(var i = 0;i<H.length;i++){
        if(current_height < H[i]){
            stack.push()
        }
        
        current_height = H[i]
    }
    return stack
}

Code: 10:39:20 UTC, js, autosave

show code in pop-up

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

function solution(H) {
    var stack = []
    var current_height = 0
    for(var i = 0;i<H.length;i++){
        if(current_height < H[i]){
            stack.push(H[i]-current_height)
        }else{
            
        }
        
        current_height = H[i]
    }
    return stack
}

Code: 10:39:38 UTC, js, autosave

show code in pop-up

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

function solution(H) {
    var stack = []
    var current_height = 0
    for(var i = 0;i<H.length;i++){
        if(current_height < H[i]){
            stack.push(H[i]-current_height)
        }else if(current_height > H[i]){
            stack.push()
        }
        
        current_height = H[i]
    }
    return stack
}

Code: 10:39:48 UTC, js, autosave

show code in pop-up

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

function solution(H) {
    var stack = []
    var current_height = 0
    for(var i = 0;i<H.length;i++){
        if(current_height < H[i]){
            stack.push(H[i]-current_height)
        }else if(current_height > H[i]){
            stack.push(H[i])
        }
        
        current_height = H[i]
    }
    return stack
}

Code: 10:40:13 UTC, js, autosave

show code in pop-up

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

function solution(H) {
    var stack = []
    for(var i = 0;i<H.length;i++){
        if(current_height < H[i]){
            stack.push(H[i]-current_height)
        }else if(current_height > H[i]){
            stack.push(H[i])
        }
        
        current_height = H[i]
    }
    return stack
}

Code: 10:59:04 UTC, js, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9

function solution(H) {
    var stack = []
    for(var i = 0;i<H.length;i++){
        
        
        current_height = H[i]
    }
    return stack
}

Code: 10:59:58 UTC, js, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10

function solution(H) {
    var stack = []
    
    for(var i = 0;i<H.length;i++){
        
        
        current_height = H[i]
    }
    return stack
}

Code: 11:00:11 UTC, js, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10

function solution(H) {
    var stack = []
    var curr = 0
    for(var i = 0;i<H.length;i++){
        
        
        current_height = H[i]
    }
    return stack
}

Code: 11:00:23 UTC, js, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10

function solution(H) {
    var stack = []
    var curr = 0
    for(var i = 0;i<H.length;i++){
        if(curr )
        
        current_height = H[i]
    }
    return stack
}

Code: 11:00:34 UTC, js, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10

function solution(H) {
    var stack = []
    var curr = 0
    for(var i = 0;i<H.length;i++){
        if(curr < )
        
        current_height = H[i]
    }
    return stack
}

Code: 11:00:49 UTC, js, autosave

show code in pop-up

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

function solution(H) {
    var stack = []
    var curr = 0
    for(var i = 0;i<H.length;i++){
        if(curr < H[i]){
            
        }
        
        current_height = H[i]
    }
    return stack
}

Code: 11:01:14 UTC, js, autosave

show code in pop-up

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

function solution(H) {
    var stack = []
    var curr = 0
    for(var i = 0;i<H.length;i++){
        if(curr < H[i]){
            
        }else if(curr > H[i]){
            stack.push(H[i])
        }
        
        current_height = H[i]
    }
    return stack
}

Code: 11:01:27 UTC, js, autosave

show code in pop-up

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

function solution(H) {
    var stack = []
    var curr = 0
    for(var i = 0;i<H.length;i++){
        if(curr < H[i]){
            stack.push
        }else if(curr > H[i]){
            stack.push(H[i])
        }
        
        current_height = H[i]
    }
    return stack
}

Code: 11:01:48 UTC, js, autosave

show code in pop-up

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

function solution(H) {
    var stack = []
    var curr = 0
    for(var i = 0;i<H.length;i++){
        if(curr < H[i]){
            stack.push
        }else if(curr > H[i]){
            
        }
        
        current_height = H[i]
    }
    return stack
}

Code: 11:02:19 UTC, js, autosave

show code in pop-up

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

function solution(H) {
    var stack = []
    var curr = 0
    var total = 0
    for(var i = 0;i<H.length;i++){
        if(curr < H[i]){
            stack.push
        }else if(curr > H[i]){
            
        }
        
        current_height = H[i]
    }
    return stack
}

Code: 11:02: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

function solution(H) {
    var stack = []
    var curr = 0
    var total = 0
    for(var i = 0;i<H.length;i++){
        if(curr < H[i]){
            stack.push
        }else if(curr > H[i]){
            stack = []
            stack.push()
        }
        
        current_height = H[i]
    }
    return stack
}

Code: 11:02:59 UTC, js, autosave

show code in pop-up

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

function solution(H) {
    var stack = []
    var curr = 0
    var total = 0
    for(var i = 0;i<H.length;i++){
        if(curr < H[i]){
            stack.push
        }else if(curr > H[i]){
            
        }
        
        current_height = H[i]
    }
    return stack
}

Code: 11:04:10 UTC, js, autosave

show code in pop-up

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

function solution(H) {
    var stack = []
    var curr = 0
    var total = 0
    for(var i = 0;i<H.length;i++){
        
        if(curr < H[i]){
            stack.push
        }else if(curr > H[i]){
            
        }
        
        current_height = H[i]
    }
    return stack
}

Code: 11:04: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 18

function solution(H) {
    var stack = []
    var curr = 0
    var total = 0
    for(var i = 0;i<H.length;i++){
        if(stack.length == 0){
            
        }
        if(curr < H[i]){
            stack.push
        }else if(curr > H[i]){
            
        }
        
        current_height = H[i]
    }
    return stack
}

Code: 11:04: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

function solution(H) {
    var stack = []
    var curr = 0
    var total = 0
    for(var i = 0;i<H.length;i++){
        if(stack.length == 0){
            stack.push()
        }
        if(curr < H[i]){
            stack.push
        }else if(curr > H[i]){
            
        }
        
        current_height = H[i]
    }
    return stack
}

Code: 11:04: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

function solution(H) {
    var stack = []
    var curr = 0
    var total = 0
    for(var i = 0;i<H.length;i++){
        if(stack.length == 0){
            stack.push(H[i])
        }else{
            
        }
        if(curr < H[i]){
            stack.push
        }else if(curr > H[i]){
            
        }
        
        current_height = H[i]
    }
    return stack
}

Code: 11:04:58 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

function solution(H) {
    var stack = []
    var curr = 0
    var total = 0
    for(var i = 0;i<H.length;i++){
        if(stack.length == 0){
            stack.push(H[i])
        }else{
            {

            }
        }
        if(curr < H[i]){
            stack.push
        }else if(curr > H[i]){
            
        }
        
        current_height = H[i]
    }
    return stack
}

Code: 11:05:13 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

function solution(H) {
    var stack = []
    var curr = 0
    var total = 0
    for(var i = 0;i<H.length;i++){
        if(stack.length == 0){
            stack.push(H[i])
        }else{
            while(stack.length > 0){
                
            }
        }
        if(curr < H[i]){
            stack.push
        }else if(curr > H[i]){
            
        }
        
        current_height = H[i]
    }
    return stack
}

Code: 11:05: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 22 23

function solution(H) {
    var stack = []
    var curr = 0
    var total = 0
    for(var i = 0;i<H.length;i++){
        if(stack.length == 0){
            stack.push(H[i])
        }else{
            var height = 0
            while(stack.length > 0){
                
            }
        }
        if(curr < H[i]){
            stack.push
        }else if(curr > H[i]){
            
        }
        
        current_height = H[i]
    }
    return stack
}

Code: 11:05:58 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

function solution(H) {
    var stack = []
    var curr = 0
    var total = 0
    for(var i = 0;i<H.length;i++){
        if(stack.length == 0){
            stack.push(H[i])
        }else{
            var height = 0
            while(stack.length > 0){
                var wall = stack.pop()
                
            }
        }
        if(curr < H[i]){
            stack.push
        }else if(curr > H[i]){
            
        }
        
        current_height = H[i]
    }
    return stack
}

Code: 11:06:12 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

function solution(H) {
    var stack = []
    var curr = 0
    var total = 0
    for(var i = 0;i<H.length;i++){
        if(stack.length == 0){
            stack.push(H[i])
        }else{
            var height = H[i-1]
            while(stack.length > 0){
                var wall = stack.pop()
                
            }
        }
        if(curr < H[i]){
            stack.push
        }else if(curr > H[i]){
            
        }
        
        current_height = H[i]
    }
    return stack
}

Code: 11:06:22 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

function solution(H) {
    var stack = []
    var curr = 0
    var total = 0
    for(var i = 0;i<H.length;i++){
        if(stack.length == 0){
            stack.push(H[i])
        }else if(){
            var height = H[i-1]
            while(stack.length > 0){
                var wall = stack.pop()
                
            }
        }
        if(curr < H[i]){
            stack.push
        }else if(curr > H[i]){
            
        }
        
        current_height = H[i]
    }
    return stack
}

Code: 11:06: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 21 22 23 24

function solution(H) {
    var stack = []
    var curr = 0
    var total = 0
    for(var i = 0;i<H.length;i++){
        if(stack.length == 0){
            stack.push(H[i])
        }else if(H[i]){
            var height = H[i-1]
            while(stack.length > 0){
                var wall = stack.pop()
                
            }
        }
        if(curr < H[i]){
            stack.push
        }else if(curr > H[i]){
            
        }
        
        current_height = H[i]
    }
    return stack
}

Code: 11:06:58 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

function solution(H) {
    var stack = []
    var curr = 0
    var total = 0
    for(var i = 0;i<H.length;i++){
        if(stack.length == 0){
            stack.push(H[i])
        }else if(i > 0 && H[i-1]){
            var height = H[i-1]
            while(stack.length > 0){
                var wall = stack.pop()
                
            }
        }
        if(curr < H[i]){
            stack.push
        }else if(curr > H[i]){
            
        }
        
        current_height = H[i]
    }
    return stack
}

Code: 11:07:12 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

function solution(H) {
    var stack = []
    var curr = 0
    var total = 0
    for(var i = 0;i<H.length;i++){
        if(stack.length == 0){
            stack.push(H[i])
        }else if(i > 0 && H[i-1] > H[i]){
            var height = H[i-1]
            while(stack.length > 0){
                var wall = stack.pop()
                
            }
        }
        if(curr < H[i]){
            stack.push
        }else if(curr > H[i]){
            
        }
        
        current_height = H[i]
    }
    return stack
}

Code: 11:07:32 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

function solution(H) {
    var stack = []
    var curr = 0
    var total = 0
    for(var i = 0;i<H.length;i++){
        if(stack.length == 0){
            stack.push(H[i])
        }else if(i > 0 && H[i-1] > H[i]){
            while(stack.length > 0){
                var wall = stack.pop()
                
            }
        }
        if(curr < H[i]){
            stack.push
        }else if(curr > H[i]){
            
        }
        
        current_height = H[i]
    }
    return stack
}

Code: 11:07: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

function solution(H) {
    var stack = []
    var curr = 0
    var total = 0
    for(var i = 0;i<H.length;i++){
        if(stack.length == 0){
            stack.push(H[i])
        }else if(i > 0 && H[i-1] > H[i]){
            while(stack.length > 0){
                var wall = stack.pop()
                if(H[i-1]-wall)
            }
        }
        if(curr < H[i]){
            stack.push
        }else if(curr > H[i]){
            
        }
        
        current_height = H[i]
    }
    return stack
}

Code: 11:08:03 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

function solution(H) {
    var stack = []
    var curr = 0
    var total = 0
    for(var i = 0;i<H.length;i++){
        if(stack.length == 0){
            stack.push(H[i])
        }else if(i > 0 && H[i-1] > H[i]){
            var height = 
            while(stack.length > 0){
                var wall = stack.pop()
                if(H[i-1]-wall)
            }
        }
        if(curr < H[i]){
            stack.push
        }else if(curr > H[i]){
            
        }
        
        current_height = H[i]
    }
    return stack
}

Code: 11:08:13 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

function solution(H) {
    var stack = []
    var curr = 0
    var total = 0
    for(var i = 0;i<H.length;i++){
        if(stack.length == 0){
            stack.push(H[i])
        }else if(i > 0 && H[i-1] > H[i]){
            var height = H[i-1]
            while(stack.length > 0){
                var wall = stack.pop()
                if(H[i-1]-wall)
            }
        }
        if(curr < H[i]){
            stack.push
        }else if(curr > H[i]){
            
        }
        
        current_height = H[i]
    }
    return stack
}

Code: 11:08: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

function solution(H) {
    var stack = []
    var curr = 0
    var total = 0
    for(var i = 0;i<H.length;i++){
        if(stack.length == 0){
            stack.push(H[i])
        }else if(i > 0 && H[i-1] > H[i]){
            var height = H[i-1]
            while(stack.length > 0){
                height = height - stack.pop()
                if(H[i-1]-wall)
            }
        }
        if(curr < H[i]){
            stack.push
        }else if(curr > H[i]){
            
        }
        
        current_height = H[i]
    }
    return stack
}

Code: 11:08:36 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

function solution(H) {
    var stack = []
    var curr = 0
    var total = 0
    for(var i = 0;i<H.length;i++){
        if(stack.length == 0){
            stack.push(H[i])
        }else if(i > 0 && H[i-1] > H[i]){
            var height = H[i-1]
            while(stack.length > 0){
                height = height - stack.pop()
                if(height == H[i]) break
            }
        }
        if(curr < H[i]){
            stack.push
        }else if(curr > H[i]){
            
        }
        
        current_height = H[i]
    }
    return stack
}

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

function solution(H) {
    var stack = []
    var curr = 0
    var total = 0
    for(var i = 0;i<H.length;i++){
        if(stack.length == 0){
            stack.push(H[i])
        }else if(i > 0 && H[i-1] > H[i]){
            var height = H[i-1]
            while(stack.length > 0){
                height = height - stack.pop()
                if(height == H[i]) break
            }
            
        }
        if(curr < H[i]){
            stack.push
        }else if(curr > H[i]){
            
        }
        
        current_height = H[i]
    }
    return stack
}

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

function solution(H) {
    var stack = []
    var curr = 0
    var total = 0
    for(var i = 0;i<H.length;i++){
        if(stack.length == 0){
            stack.push(H[i])
        }else if(i > 0 && H[i-1] > H[i]){
            var height = H[i-1]
            while(stack.length > 0){
                height = height - stack.pop()
                if(height == H[i]) break
            }
            if(stack.length == 0){

            }
        }
        if(curr < H[i]){
            stack.push
        }else if(curr > H[i]){
            
        }
        
        current_height = H[i]
    }
    return stack
}

Code: 11:09: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 22 23 24 25 26 27 28

function solution(H) {
    var stack = []
    var curr = 0
    var total = 0
    for(var i = 0;i<H.length;i++){
        if(stack.length == 0){
            stack.push(H[i])
            total++
        }else if(i > 0 && H[i-1] > H[i]){
            var height = H[i-1]
            while(stack.length > 0){
                height = height - stack.pop()
                if(height == H[i]) break
            }
            if(stack.length == 0){
                total++
            }
        }
        if(curr < H[i]){
            stack.push
        }else if(curr > H[i]){
            
        }
        
        current_height = H[i]
    }
    return stack
}

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

function solution(H) {
    var stack = []
    var curr = 0
    var total = 0
    for(var i = 0;i<H.length;i++){
        if(stack.length == 0){
            stack.push(H[i])
            total++
        }else if(i > 0 && H[i-1] > H[i]){
            var height = H[i-1]
            while(stack.length > 0){
                height = height - stack.pop()
                if(height == H[i]) break
            }
            if(stack.length == 0){
                total++
            }
        }
        if(curr < H[i]){
            stack.push
        }else if(curr > H[i]){
            
        }
        
        current_height = H[i]
    }
    return total
}

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

function solution(H) {
    var stack = []
    var total = 0
    for(var i = 0;i<H.length;i++){
        if(stack.length == 0){
            stack.push(H[i])
            total++
        }else if(i > 0 && H[i-1] > H[i]){
            var height = H[i-1]
            while(stack.length > 0){
                height = height - stack.pop()
                if(height == H[i]) break
            }
            if(stack.length == 0){
                total++
            }
        }
    }
    return total
}

Code: 11:10:03 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

function solution(H) {
    var stack = []
    var total = 0
    for(var i = 0;i<H.length;i++){
        if(stack.length == 0){
            stack.push(H[i])
            total++
        }else if(i > 0 && H[i-1] > H[i]){
            var height = H[i-1]
            while(stack.length > 0){
                height = height - stack.pop()
                if(height == H[i]) break
            }
            if(stack.length == 0){
                total++
            }
        }else if
    }
    return total
}

Code: 11:10:16 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

function solution(H) {
    var stack = []
    var total = 0
    for(var i = 0;i<H.length;i++){
        if(stack.length == 0){
            stack.push(H[i])
            total++
        }else if(i > 0 && H[i-1] > H[i]){
            var height = H[i-1]
            while(stack.length > 0){
                height = height - stack.pop()
                if(height == H[i]) break
            }
            if(stack.length == 0){
                total++
            }
        }else if(i > 0 && H[i-1] > H[i]){

        }
    }
    return total
}

Code: 11:10: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

function solution(H) {
    var stack = []
    var total = 0
    for(var i = 0;i<H.length;i++){
        if(stack.length == 0){
            stack.push(H[i])
            total++
        }else if(i > 0 && H[i-1] > H[i]){
            var height = H[i-1]
            while(stack.length > 0){
                height = height - stack.pop()
                if(height == H[i]) break
            }
            if(stack.length == 0){
                total++
            }
        }else if(H[i-1] < H[i]){
            stack.push(H[i])
        }
    }
    return total
}

Code: 11:10:41 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

function solution(H) {
    var stack = []
    var total = 0
    for(var i = 0;i<H.length;i++){
        if(stack.length == 0){
            stack.push(H[i])
            total++
        }else if(i > 0 && H[i-1] > H[i]){
            var height = H[i-1]
            while(stack.length > 0){
                height = height - stack.pop()
                if(height == H[i]) break
            }
            if(stack.length == 0){
                total++
            }
        }else if(H[i-1] < H[i]){
            stack.push(H[i]-H[i-1])
        }
    }
    return total
}

Code: 11:10:58 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

function solution(H) {
    var stack = []
    var total = 0
    for(var i = 0;i<H.length;i++){
        if(stack.length == 0){
            stack.push(H[i])
            total++
        }else if(i > 0 && H[i-1] > H[i]){
            var height = H[i-1]
            while(stack.length > 0){
                height = height - stack.pop()
                if(height == H[i]) break
            }
            if(stack.length == 0){
                total++
            }
        }else if(i > 0 && H[i-1] < H[i]){
            stack.push(H[i]-H[i-1])
        }else if(){
            
        }
    }
    return total
}

Code: 11:11:15 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

function solution(H) {
    var stack = []
    var total = 0
    for(var i = 0;i<H.length;i++){
        if(stack.length == 0){
            stack.push(H[i])
            total++
        }else if(i > 0 && H[i-1] > H[i]){
            var height = H[i-1]
            while(stack.length > 0){
                height = height - stack.pop()
                if(height == H[i]) break
            }
            if(stack.length == 0){
                total++
            }
        }else if(i > 0 && H[i-1] < H[i]){
            stack.push(H[i]-H[i-1])
            total++
        }else if(i ==  0 && H[i-1] < H[i]){
            stack.push(H[i])
            total++
        }
    }
    return total
}

Analysis

expand all Example tests

▶

example

✘

WRONG ANSWER
got 8 expected 7

0.068 s

WRONG ANSWER, got 8 expected 7

Code: 11:12:22 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

function solution(H) {
    var stack = []
    var total = 0
    for(var i = 0;i<H.length;i++){
        if(stack.length == 0){
            stack.push(H[i])
            total++
            
        }else if(i > 0 && H[i-1] > H[i]){
            var height = H[i-1]
            while(stack.length > 0){
                height = height - stack.pop()
                if(height == H[i]) break
            }
            if(stack.length == 0){
                total++
            }
        }else if(i > 0 && H[i-1] < H[i]){
            stack.push(H[i]-H[i-1])
            total++
        }else if(i ==  0 && H[i-1] < H[i]){
            stack.push(H[i])
            total++
        }
    }
    return total
}

Code: 11:12:32 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

function solution(H) {
    var stack = []
    var total = 0
    for(var i = 0;i<H.length;i++){
        if(stack.length == 0){
            stack.push(H[i])
            total++
            console.log("add")
        }else if(i > 0 && H[i-1] > H[i]){
            var height = H[i-1]
            while(stack.length > 0){
                height = height - stack.pop()
                if(height == H[i]) break
            }
            if(stack.length == 0){
                total++
            }
        }else if(i > 0 && H[i-1] < H[i]){
            stack.push(H[i]-H[i-1])
            total++
        }else if(i ==  0 && H[i-1] < H[i]){
            stack.push(H[i])
            total++
        }
    }
    return total
}

Code: 11:12: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 18 19 20 21 22 23 24 25 26 27 28

function solution(H) {
    var stack = []
    var total = 0
    for(var i = 0;i<H.length;i++){
        if(stack.length == 0){
            stack.push(H[i])
            total++
            console.log("add")
        }else if(i > 0 && H[i-1] > H[i]){
            var height = H[i-1]
            while(stack.length > 0){
                height = height - stack.pop()
                if(height == H[i]) break
            }
            if(stack.length == 0){
                total++
                stack.push()
            }
        }else if(i > 0 && H[i-1] < H[i]){
            stack.push(H[i]-H[i-1])
            total++
        }else if(i ==  0 && H[i-1] < H[i]){
            stack.push(H[i])
            total++
        }
    }
    return total
}

Code: 11:13:05 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

function solution(H) {
    var stack = []
    var total = 0
    for(var i = 0;i<H.length;i++){
        if(stack.length == 0){
            stack.push(H[i])
            total++
        }else if(i > 0 && H[i-1] > H[i]){
            var height = H[i-1]
            while(stack.length > 0){
                height = height - stack.pop()
                if(height == H[i]) break
            }
            if(stack.length == 0){
                total++
                stack.push(H[i])
            }
        }else if(i > 0 && H[i-1] < H[i]){
            stack.push(H[i]-H[i-1])
            total++
        }else if(i ==  0 && H[i-1] < H[i]){
            stack.push(H[i])
            total++
        }
    }
    return total
}

Analysis

expand all Example tests

▶

example

✘

WRONG ANSWER
got 8 expected 7

0.056 s

WRONG ANSWER, got 8 expected 7

Code: 11:13:32 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

function solution(H) {
    var stack = []
    var total = 0
    for(var i = 0;i<H.length;i++){
        if(stack.length == 0){
            stack.push(H[i])
            total++
        }else if(i > 0 && H[i-1] > H[i]){
            var height = H[i-1]
            
            while(stack.length > 0){
                height = height - stack.pop()
                if(height == H[i]) break
            }
            if(stack.length == 0){
                total++
                stack.push(H[i])
            }
        }else if(i > 0 && H[i-1] < H[i]){
            stack.push(H[i]-H[i-1])
            total++
        }else if(i ==  0 && H[i-1] < H[i]){
            stack.push(H[i])
            total++
        }
    }
    return total
}

Code: 11:13:40 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

function solution(H) {
    var stack = []
    var total = 0
    for(var i = 0;i<H.length;i++){
        if(stack.length == 0){
            stack.push(H[i])
            total++
        }else if(i > 0 && H[i-1] > H[i]){
            var height = H[i-1]
            console.log(stack)
            while(stack.length > 0){
                height = height - stack.pop()
                if(height == H[i]) break
            }
            console.log(stack)
            if(stack.length == 0){
                total++
                stack.push(H[i])
            }
        }else if(i > 0 && H[i-1] < H[i]){
            stack.push(H[i]-H[i-1])
            total++
        }else if(i ==  0 && H[i-1] < H[i]){
            stack.push(H[i])
            total++
        }
    }
    return total
}

Analysis

expand all Example tests

▶

example

✘

WRONG ANSWER
got 8 expected 7

0.060 s

WRONG ANSWER, got 8 expected 7

stdout:

[ 8 ]
[]
[ 5, 2, 2 ]
[]
[ 8 ]
[]
[ 7 ]
[]

Code: 11:13:54 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

function solution(H) {
    var stack = []
    var total = 0
    for(var i = 0;i<H.length;i++){
        if(stack.length == 0){
            stack.push(H[i])
            total++
            console.log(stack)
        }else if(i > 0 && H[i-1] > H[i]){
            var height = H[i-1]
            console.log(stack)
            while(stack.length > 0){
                height = height - stack.pop()
                if(height == H[i]) break
            }
            console.log(stack)
            if(stack.length == 0){
                total++
                stack.push(H[i])
            }
        }else if(i > 0 && H[i-1] < H[i]){
            stack.push(H[i]-H[i-1])
            total++
            console.log(stack)
        }else if(i ==  0 && H[i-1] < H[i]){
            stack.push(H[i])
            total++
            console.log(stack)
        }
    }
    return total
}

Analysis

expand all Example tests

▶

example

✘

WRONG ANSWER
got 8 expected 7

0.056 s

WRONG ANSWER, got 8 expected 7

stdout:

[ 8 ]
[ 8 ]
[]
[ 5, 2 ]
[ 5, 2, 2 ]
[ 5, 2, 2 ]
[]
[ 8 ]
[]
[ 7 ]
[]
[ 4, 4 ]

Code: 11:14:07 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

function solution(H) {
    var stack = []
    var total = 0
    for(var i = 0;i<H.length;i++){
        if(stack.length == 0){
            stack.push(H[i])
            total++
            console.log(stack, )
        }else if(i > 0 && H[i-1] > H[i]){
            var height = H[i-1]
            console.log(stack)
            while(stack.length > 0){
                height = height - stack.pop()
                if(height == H[i]) break
            }
            console.log(stack)
            if(stack.length == 0){
                total++
                stack.push(H[i])
            }
        }else if(i > 0 && H[i-1] < H[i]){
            stack.push(H[i]-H[i-1])
            total++
            console.log(stack)
        }else if(i ==  0 && H[i-1] < H[i]){
            stack.push(H[i])
            total++
            console.log(stack)
        }
    }
    return total
}

Code: 11:14:20 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

function solution(H) {
    var stack = []
    var total = 0
    for(var i = 0;i<H.length;i++){
        if(stack.length == 0){
            stack.push(H[i])
            total++
            console.log(stack, total)
        }else if(i > 0 && H[i-1] > H[i]){
            var height = H[i-1]
            console.log(stack, total)
            while(stack.length > 0){
                height = height - stack.pop()
                if(height == H[i]) break
            }
            console.log(stack, total)
            if(stack.length == 0){
                total++
                stack.push(H[i])
            console.log(stack, total)
            }
        }else if(i > 0 && H[i-1] < H[i]){
            stack.push(H[i]-H[i-1])
            total++
            console.log(stack, total)
        }else if(i ==  0 && H[i-1] < H[i]){
            stack.push(H[i])
            total++
            console.log(stack, total)
        }
    }
    return total
}

Analysis

expand all Example tests

▶

example

✘

WRONG ANSWER
got 8 expected 7

0.060 s

WRONG ANSWER, got 8 expected 7

stdout:

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

Code: 11:14: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

function solution(H) {
    var stack = []
    var total = 0
    for(var i = 0;i<H.length;i++){
        if(stack.length == 0){
            stack.push(H[i])
            total++
            console.log(i,stack, total)
        }else if(i > 0 && H[i-1] > H[i]){
            var height = H[i-1]
            console.log(stack, total)
            while(stack.length > 0){
                height = height - stack.pop()
                if(height == H[i]) break
            }
            console.log(stack, total)
            if(stack.length == 0){
                total++
                stack.push(H[i])
            console.log(stack, total)
            }
        }else if(i > 0 && H[i-1] < H[i]){
            stack.push(H[i]-H[i-1])
            total++
            console.log(stack, total)
        }else if(i ==  0 && H[i-1] < H[i]){
            stack.push(H[i])
            total++
            console.log(stack, total)
        }
    }
    return total
}

Code: 11:14:53 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

function solution(H) {
    var stack = []
    var total = 0
    for(var i = 0;i<H.length;i++){
        if(stack.length == 0){
            stack.push(H[i])
            total++
            console.log(i,stack, total)
        }else if(i > 0 && H[i-1] > H[i]){
            var height = H[i-1]
            console.log(i,stack, total)
            while(stack.length > 0){
                height = height - stack.pop()
                if(height == H[i]) break
            }
            console.log(i,stack, total)
            if(stack.length == 0){
                total++
                stack.push(H[i])
            console.log(i,stack, total)
            }
        }else if(i > 0 && H[i-1] < H[i]){
            stack.push(H[i]-H[i-1])
            total++
            console.log(i,stack, total)
        }else if(i ==  0 && H[i-1] < H[i]){
            stack.push(H[i])
            total++
            console.log(i,stack, total)
        }
    }
    return total
}

Analysis

expand all Example tests

▶

example

✘

WRONG ANSWER
got 8 expected 7

0.056 s

WRONG ANSWER, got 8 expected 7

stdout:

0 [ 8 ] 1
2 [ 8 ] 1
2 [] 1
2 [ 5 ] 2
3 [ 5, 2 ] 3
4 [ 5, 2, 2 ] 4
5 [ 5, 2, 2 ] 4
5 [] 4
5 [ 8 ] 5
6 [ 8 ] 5
6 [] 5
6 [ 7 ] 6
7 [ 7 ] 6
7 [] 6
7 [ 4 ] 7
8 [ 4, 4 ] 8

Code: 11:16:32 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

function solution(H) {
    var stack = []
    var total = 0
    for(var i = 0;i<H.length;i++){
        if(stack.length == 0){
            stack.push(H[i])
            total++
            console.log(i,stack, total)
        }else if(i > 0 && H[i-1] > H[i]){
            var height = H[i-1]
            console.log(i,stack, total)
            while(stack.length > 0){
                height = height - stack.pop()
                if(height == H[i]) break
            }
            console.log(i,stack, total)
            if(stack.length == 0){
                total++
                stack.push(H[i])
            console.log(i,stack, total)
            }
        }else if(i > 0 && H[i-1] < H[i]){
            stack.push(H[i]-H[i-1])
            total++
            console.log(i,stack, total)
        }else if(i ==  0 && H[i-1] < H[i]){
            stack.push(H[i])
            total++
        }
    }
    return total
}

Code: 11:16:43 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

function solution(H) {
    var stack = []
    var total = 0
    for(var i = 0;i<H.length;i++){
        if(stack.length == 0){
            stack.push(H[i])
            total++
            console.log(i,stack, total)
        }else if(i > 0 && H[i-1] > H[i]){
            var height = H[i-1]
            while(stack.length > 0){
                height = height - stack.pop()
                if(height == H[i]) break
            }
            if(stack.length == 0){
                total++
                stack.push(H[i])
            }
        }else if(i > 0 && H[i-1] < H[i]){
            stack.push(H[i]-H[i-1])
            total++
        }else if(i ==  0 && H[i-1] < H[i]){
            stack.push(H[i])
            total++
        }
        console.log(i,stack, total)
    }
    return total
}

Analysis

expand all Example tests

▶

example

✘

WRONG ANSWER
got 8 expected 7

0.056 s

WRONG ANSWER, got 8 expected 7

stdout:

0 [ 8 ] 1
0 [ 8 ] 1
1 [ 8 ] 1
2 [ 5 ] 2
3 [ 5, 2 ] 3
4 [ 5, 2, 2 ] 4
5 [ 8 ] 5
6 [ 7 ] 6
7 [ 4 ] 7
8 [ 4, 4 ] 8

Code: 11:16: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

function solution(H) {
    var stack = []
    var total = 0
    for(var i = 0;i<H.length;i++){
        if(stack.length == 0){
            stack.push(H[i])
            total++
        }else if(i > 0 && H[i-1] > H[i]){
            var height = H[i-1]
            while(stack.length > 0){
                height = height - stack.pop()
                if(height == H[i]) break
            }
            if(stack.length == 0){
                total++
                stack.push(H[i])
            }
        }else if(i > 0 && H[i-1] < H[i]){
            stack.push(H[i]-H[i-1])
            total++
        }else if(i ==  0 && H[i-1] < H[i]){
            stack.push(H[i])
            total++
        }
        console.log(i,stack, total)
    }
    return total
}

Analysis

expand all Example tests

▶

example

✘

WRONG ANSWER
got 8 expected 7

0.056 s

WRONG ANSWER, got 8 expected 7

stdout:

0 [ 8 ] 1
1 [ 8 ] 1
2 [ 5 ] 2
3 [ 5, 2 ] 3
4 [ 5, 2, 2 ] 4
5 [ 8 ] 5
6 [ 7 ] 6
7 [ 4 ] 7
8 [ 4, 4 ] 8

Code: 11:17: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

function solution(H) {
    var stack = []
    var total = 0
    for(var i = 0;i<H.length;i++){
        if(stack.length == 0){
            stack.push(H[i])
            total++
        }else if(i > 0 && H[i-1] > H[i]){
            var height = H[i-1]
            while(stack.length > 0){
                height = height - stack.pop()
                if(height < H[i]) break
            }
            if(stack.length == 0){
                total++
                stack.push(H[i])
            }
        }else if(i > 0 && H[i-1] < H[i]){
            stack.push(H[i]-H[i-1])
            total++
        }else if(i ==  0 && H[i-1] < H[i]){
            stack.push(H[i])
            total++
        }
        console.log(i,stack, total)
    }
    return total
}

Code: 11:18:15 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

function solution(H) {
    var stack = []
    var total = 0
    for(var i = 0;i<H.length;i++){
        if(stack.length == 0){
            stack.push(H[i])
            total++
        }else if(i > 0 && H[i-1] > H[i]){
            var height = H[i-1]
            while(stack.length > 0){
                height = height - stack.pop()
                if(height <= H[i]) break
            }
            if(stack.length == 0){
                total++
                stack.push(H[i])
            }else
        }else if(i > 0 && H[i-1] < H[i]){
            stack.push(H[i]-H[i-1])
            total++
        }else if(i ==  0 && H[i-1] < H[i]){
            stack.push(H[i])
            total++
        }
        console.log(i,stack, total)
    }
    return total
}

Code: 11:18: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 22 23 24 25 26 27 28 29 30 31

function solution(H) {
    var stack = []
    var total = 0
    for(var i = 0;i<H.length;i++){
        if(stack.length == 0){
            stack.push(H[i])
            total++
        }else if(i > 0 && H[i-1] > H[i]){
            var height = H[i-1]
            while(stack.length > 0){
                height = height - stack.pop()
                if(height <= H[i]) {
                    
                    break
                }
            }
            if(stack.length == 0){
                total++
                stack.push(H[i])
            }
        }else if(i > 0 && H[i-1] < H[i]){
            stack.push(H[i]-H[i-1])
            total++
        }else if(i ==  0 && H[i-1] < H[i]){
            stack.push(H[i])
            total++
        }
        console.log(i,stack, total)
    }
    return total
}

Code: 11:18:47 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

function solution(H) {
    var stack = []
    var total = 0
    for(var i = 0;i<H.length;i++){
        if(stack.length == 0){
            stack.push(H[i])
            total++
        }else if(i > 0 && H[i-1] > H[i]){
            var height = H[i-1]
            while(stack.length > 0){
                height = height - stack.pop()
                if(height <= H[i]) {
                    total++
                    stack.push(H[i])
                    break
                }
            }
            if(stack.length == 0){
            }
        }else if(i > 0 && H[i-1] < H[i]){
            stack.push(H[i]-H[i-1])
            total++
        }else if(i ==  0 && H[i-1] < H[i]){
            stack.push(H[i])
            total++
        }
        console.log(i,stack, total)
    }
    return total
}

Code: 11:19: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 30

function solution(H) {
    var stack = []
    var total = 0
    for(var i = 0;i<H.length;i++){
        if(stack.length == 0){
            stack.push(H[i])
            total++
        }else if(i > 0 && H[i-1] > H[i]){
            var height = H[i-1]
            while(stack.length > 0){
                height = height - stack.pop()
                if(height <= H[i]) {
                    total++
                    stack.push(H[i]-height)
                    break
                }
            }
            if(stack.length == 0){
            }
        }else if(i > 0 && H[i-1] < H[i]){
            stack.push(H[i]-H[i-1])
            total++
        }else if(i ==  0 && H[i-1] < H[i]){
            stack.push(H[i])
            total++
        }
        console.log(i,stack, total)
    }
    return total
}

Code: 11:19:13 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

function solution(H) {
    var stack = []
    var total = 0
    for(var i = 0;i<H.length;i++){
        if(stack.length == 0){
            stack.push(H[i])
            total++
        }else if(i > 0 && H[i-1] > H[i]){
            var height = H[i-1]
            while(stack.length > 0){
                height = height - stack.pop()
                if(height <= H[i]) {
                    total++
                    stack.push(H[i]-height)
                    break
                }
            }
        }else if(i > 0 && H[i-1] < H[i]){
            stack.push(H[i]-H[i-1])
            total++
        }else if(i ==  0 && H[i-1] < H[i]){
            stack.push(H[i])
            total++
        }
        console.log(i,stack, total)
    }
    return total
}

Analysis

expand all Example tests

▶

example

✘

WRONG ANSWER
got 8 expected 7

0.056 s

WRONG ANSWER, got 8 expected 7

stdout:

0 [ 8 ] 1
1 [ 8 ] 1
2 [ 5 ] 2
3 [ 5, 2 ] 3
4 [ 5, 2, 2 ] 4
5 [ 5, 2, 1 ] 5
6 [ 5, 2, 0 ] 6
7 [ 4 ] 7
8 [ 4, 4 ] 8

Code: 11:19: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

function solution(H) {
    var stack = []
    var total = 0
    for(var i = 0;i<H.length;i++){
        if(stack.length == 0){
            stack.push(H[i])
            total++
        }else if(i > 0 && H[i-1] > H[i]){
            var height = H[i-1]
            while(stack.length > 0){
                height = height - stack.pop()
                if(height < H[i]) {
                    total++
                    stack.push(H[i]-height)
                    break
                }
            }
        }else if(i > 0 && H[i-1] < H[i]){
            stack.push(H[i]-H[i-1])
            total++
        }else if(i ==  0 && H[i-1] < H[i]){
            stack.push(H[i])
            total++
        }
        console.log(i,stack, total)
    }
    return total
}

Analysis

expand all Example tests

▶

example

✘

WRONG ANSWER
got 8 expected 7

0.056 s

WRONG ANSWER, got 8 expected 7

stdout:

0 [ 8 ] 1
1 [ 8 ] 1
2 [ 5 ] 2
3 [ 5, 2 ] 3
4 [ 5, 2, 2 ] 4
5 [ 5, 2, 1 ] 5
6 [ 5, 2 ] 6
7 [ 4 ] 7
8 [ 4, 4 ] 8

Code: 11:20:06 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

function solution(H) {
    var stack = []
    var total = 0
    for(var i = 0;i<H.length;i++){
        if(stack.length == 0){
            stack.push(H[i])
            total++
        }else if(i > 0 && H[i-1] > H[i]){
            var height = H[i-1]
            while(stack.length > 0){
                height = height - stack.pop()
                if(height <= H[i]) {
                    total++
                    stack.push(H[i]-height)
                    break
                }
            }
        }else if(i > 0 && H[i-1] < H[i]){
            stack.push(H[i]-H[i-1])
            total++
        }else if(i ==  0 && H[i-1] < H[i]){
            stack.push(H[i])
            total++
        }
        console.log(i,stack, total)
    }
    return total
}

Code: 11:20:19 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

function solution(H) {
    var stack = []
    var total = 0
    for(var i = 0;i<H.length;i++){
        if(stack.length == 0){
            stack.push(H[i])
            total++
        }else if(i > 0 && H[i-1] > H[i]){
            var height = H[i-1]
            while(stack.length > 0){
                height = height - stack.pop()
                if(height < H[i]) {
                    total++
                    stack.push(H[i]-height)
                    break
                }else if(){
                    
                }
            }
        }else if(i > 0 && H[i-1] < H[i]){
            stack.push(H[i]-H[i-1])
            total++
        }else if(i ==  0 && H[i-1] < H[i]){
            stack.push(H[i])
            total++
        }
        console.log(i,stack, total)
    }
    return total
}

Code: 11:20: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

function solution(H) {
    var stack = []
    var total = 0
    for(var i = 0;i<H.length;i++){
        if(stack.length == 0){
            stack.push(H[i])
            total++
        }else if(i > 0 && H[i-1] > H[i]){
            var height = H[i-1]
            while(stack.length > 0){
                height = height - stack.pop()
                if(height < H[i]) {
                    total++
                    stack.push(H[i]-height)
                }else if(height == H[i]){
                    break
                }
            }
        }else if(i > 0 && H[i-1] < H[i]){
            stack.push(H[i]-H[i-1])
            total++
        }else if(i ==  0 && H[i-1] < H[i]){
            stack.push(H[i])
            total++
        }
        console.log(i,stack, total)
    }
    return total
}

Analysis

expand all Example tests

▶

example

✘

TIMEOUT ERROR
Killed. Hard limit reached: 5.000 sec.

5.000 s

TIMEOUT ERROR, Killed. Hard limit reached: 5.000 sec.

stdout:

0 [ 8 ] 1
1 [ 8 ] 1

Code: 11:20:49 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

function solution(H) {
    var stack = []
    var total = 0
    for(var i = 0;i<H.length;i++){
        if(stack.length == 0){
            stack.push(H[i])
            total++
        }else if(i > 0 && H[i-1] > H[i]){
            var height = H[i-1]
            while(stack.length > 0){
                height = height - stack.pop()
                if(height < H[i]) {
                    total++
                    stack.push(H[i]-height)
                }else if(height = H[i]){
                    break
                }
            }
        }else if(i > 0 && H[i-1] < H[i]){
            stack.push(H[i]-H[i-1])
            total++
        }else if(i ==  0 && H[i-1] < H[i]){
            stack.push(H[i])
            total++
        }
        console.log(i,stack, total)
    }
    return total
}

Code: 11:20: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

function solution(H) {
    var stack = []
    var total = 0
    for(var i = 0;i<H.length;i++){
        if(stack.length == 0){
            stack.push(H[i])
            total++
        }else if(i > 0 && H[i-1] > H[i]){
            var height = H[i-1]
            while(stack.length > 0){
                height = height - stack.pop()
                if(height < H[i]) {
                    total++
                    stack.push(H[i]-height)
                    break
                }else if(height == H[i]){
                    break
                }
            }
        }else if(i > 0 && H[i-1] < H[i]){
            stack.push(H[i]-H[i-1])
            total++
        }else if(i ==  0 && H[i-1] < H[i]){
            stack.push(H[i])
            total++
        }
        console.log(i,stack, total)
    }
    return total
}

Analysis

expand all Example tests

▶

example

✔

0.056 s

stdout:

0 [ 8 ] 1
1 [ 8 ] 1
2 [ 5 ] 2
3 [ 5, 2 ] 3
4 [ 5, 2, 2 ] 4
5 [ 5, 2, 1 ] 5
6 [ 5, 2 ] 5
7 [ 4 ] 6
8 [ 4, 4 ] 7

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

function solution(H) {
    var stack = []
    var total = 0
    for(var i = 0;i<H.length;i++){
        if(stack.length == 0){
            stack.push(H[i])
            total++
        }else if(i > 0 && H[i-1] > H[i]){
            var height = H[i-1]
            while(stack.length > 0){
                height = height - stack.pop()
                if(height < H[i]) {
                    total++
                    stack.push(H[i]-height)
                    break
                }else if(height == H[i]){
                    break
                }
            }
        }else if(i > 0 && H[i-1] < H[i]){
            stack.push(H[i]-H[i-1])
            total++
        }else if(i ==  0 && H[i-1] < H[i]){
            stack.push(H[i])
            total++
        }
        //console.log(i,stack, total)
    }
    return total
}

Analysis

expand all Example tests

▶

example

✔

0.056 s

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

function solution(H) {
    var stack = []
    var total = 0
    for(var i = 0;i<H.length;i++){
        if(stack.length == 0){
            stack.push(H[i])
            total++
        }else if(i > 0 && H[i-1] > H[i]){
            var height = H[i-1]
            while(stack.length > 0){
                height = height - stack.pop()
                if(height < H[i]) {
                    total++
                    stack.push(H[i]-height)
                    break
                }else if(height == H[i]){
                    break
                }
            }
        }else if(i > 0 && H[i-1] < H[i]){
            stack.push(H[i]-H[i-1])
            total++
        }else if(i ==  0 && H[i-1] < H[i]){
            stack.push(H[i])
            total++
        }
        //console.log(i,stack, total)
    }
    return total
}

Analysis

expand all Example tests

▶

example

✔

0.060 s

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

function solution(H) {
    var stack = []
    var total = 0
    for(var i = 0;i<H.length;i++){
        if(stack.length == 0){
            stack.push(H[i])
            total++
        }else if(i > 0 && H[i-1] > H[i]){
            var height = H[i-1]
            while(stack.length > 0){
                height = height - stack.pop()
                if(height < H[i]) {
                    total++
                    stack.push(H[i]-height)
                    break
                }else if(height == H[i]){
                    break
                }
            }
        }else if(i > 0 && H[i-1] < H[i]){
            stack.push(H[i]-H[i-1])
            total++
        }else if(i ==  0 && H[i-1] < H[i]){
            stack.push(H[i])
            total++
        }
        //console.log(i,stack, total)
    }
    return total
}

Analysis summary

The solution obtained perfect score.

Analysis

Detected time complexity:

O(N)

expand all Example tests

▶

example

✔

0.056 s

expand all Correctness tests

▶

simple1

✔

0.056 s

▶

simple2

✔

0.052 s

▶

simple3

✔

0.052 s

▶

simple4

✔

0.056 s

▶

boundary_cases

✔

0.056 s

expand all Performance tests

▶

medium1

✔

0.056 s

▶

medium2

✔

0.060 s

▶

medium3

✔

0.056 s

▶

medium4

✔

0.056 s

▶

large_piramid

✔

0.096 s

▶

large_increasing_decreasing

✔

0.092 s

0.100 s

▶

large_up_to_20

✔

0.088 s

▶

large_up_to_100

✔

0.088 s

▶

large_max

✔

0.092 s