Test results - Codility

Code: 10:57:33 UTC, java, autosave

1 2 3 4 5 6 7 8 9 10 11

// you can also use imports, for example:
// import java.util.*;

// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");

class Solution {
    public int solution(int[] A) {
        // write your code in Java SE 8
    }
}

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

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(A) {
    // write your code in JavaScript (Node.js 8.9.4)
}

Code: 10:57:53 UTC, js, autosave

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74

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

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

// mergeSort -> 

// 분할
const divided = []

const divideArr = (arr)=>{
    if(arr.length===1){
        divided.push(arr);
        return arr;
    } 
    const mid = parseInt(arr.length/2)
    const first = arr.slice(0,mid)
    const second = arr.slice(mid)
    divideArr(first)
    divideArr(second)
}
divideArr(A)

console.log(divided)
let merged = divided.slice(0)

const mergeAB = (a,b)=> {
    debugger;
    if(b===undefined) return a;
    let length = a.length+b.length
    let mergeArr = []
    let aCompare = a[0]
    let bCompare = b[0]
    let bIndex = 0;
    let aIndex = 0;
    for(let i =0; i<length; i++){
        if(aCompare>bCompare){
            mergeArr[i]=bCompare
            bIndex +=1
            if(bIndex===b.length){
                return mergeArr = mergeArr.concat(a.slice(aIndex))
            }
            else{
                bCompare=b[bIndex]
            }            
        }
        else{
            mergeArr[i]=aCompare
            aIndex +=1
            if(aIndex===a.length){
                return mergeArr = mergeArr.concat(b.slice(bIndex))
            }
            else{
                aCompare=a[aIndex]
            }   
        }
    }
    return mergeArr
}

const mergeArr = (mergedArr)=> {
    debugger;
    if(mergedArr.length===1) return mergedArr
    let newMergeArr = []
    for(let i =0; i<mergedArr.length; i+=2){
        newMergeArr.push(mergeAB(mergedArr[i], mergedArr[i+1]))
    }
    return mergeArr(newMergeArr)
}
const finalMerged = mergeArr(merged)
return finalMerged
}

Code: 10:58:00 UTC, js, verify, result: Failed

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74

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

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

// mergeSort -> 

// 분할
const divided = []

const divideArr = (arr)=>{
    if(arr.length===1){
        divided.push(arr);
        return arr;
    } 
    const mid = parseInt(arr.length/2)
    const first = arr.slice(0,mid)
    const second = arr.slice(mid)
    divideArr(first)
    divideArr(second)
}
divideArr(A)

console.log(divided)
let merged = divided.slice(0)

const mergeAB = (a,b)=> {
    debugger;
    if(b===undefined) return a;
    let length = a.length+b.length
    let mergeArr = []
    let aCompare = a[0]
    let bCompare = b[0]
    let bIndex = 0;
    let aIndex = 0;
    for(let i =0; i<length; i++){
        if(aCompare>bCompare){
            mergeArr[i]=bCompare
            bIndex +=1
            if(bIndex===b.length){
                return mergeArr = mergeArr.concat(a.slice(aIndex))
            }
            else{
                bCompare=b[bIndex]
            }            
        }
        else{
            mergeArr[i]=aCompare
            aIndex +=1
            if(aIndex===a.length){
                return mergeArr = mergeArr.concat(b.slice(bIndex))
            }
            else{
                aCompare=a[aIndex]
            }   
        }
    }
    return mergeArr
}

const mergeArr = (mergedArr)=> {
    debugger;
    if(mergedArr.length===1) return mergedArr
    let newMergeArr = []
    for(let i =0; i<mergedArr.length; i+=2){
        newMergeArr.push(mergeAB(mergedArr[i], mergedArr[i+1]))
    }
    return mergeArr(newMergeArr)
}
const finalMerged = mergeArr(merged)
return finalMerged
}

Analysis

▶

example
example, positive answer, length=6

✘

RUNTIME ERROR
tested program terminated with exit code 1

▶

example1
example, answer is zero, length=4

✘

RUNTIME ERROR
tested program terminated with exit code 1

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

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70

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

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

const divided = []

const divideArr = (arr)=>{
    if(arr.length===1){
        divided.push(arr);
        return arr;
    } 
    const mid = parseInt(arr.length/2)
    const first = arr.slice(0,mid)
    const second = arr.slice(mid)
    divideArr(first)
    divideArr(second)
}
divideArr(A)

console.log(divided)
let merged = divided.slice(0)

const mergeAB = (a,b)=> {
    debugger;
    if(b===undefined) return a;
    let length = a.length+b.length
    let mergeArr = []
    let aCompare = a[0]
    let bCompare = b[0]
    let bIndex = 0;
    let aIndex = 0;
    for(let i =0; i<length; i++){
        if(aCompare>bCompare){
            mergeArr[i]=bCompare
            bIndex +=1
            if(bIndex===b.length){
                return mergeArr = mergeArr.concat(a.slice(aIndex))
            }
            else{
                bCompare=b[bIndex]
            }            
        }
        else{
            mergeArr[i]=aCompare
            aIndex +=1
            if(aIndex===a.length){
                return mergeArr = mergeArr.concat(b.slice(bIndex))
            }
            else{
                aCompare=a[aIndex]
            }   
        }
    }
    return mergeArr
}

const mergeArr = (mergedArr)=> {
    debugger;
    if(mergedArr.length===1) return mergedArr
    let newMergeArr = []
    for(let i =0; i<mergedArr.length; i+=2){
        newMergeArr.push(mergeAB(mergedArr[i], mergedArr[i+1]))
    }
    return mergeArr(newMergeArr)
}
const finalMerged = mergeArr(merged)
return finalMerged
}

Code: 10:58:17 UTC, js, verify, result: Failed

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70

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

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

const divided = []

const divideArr = (arr)=>{
    if(arr.length===1){
        divided.push(arr);
        return arr;
    } 
    const mid = parseInt(arr.length/2)
    const first = arr.slice(0,mid)
    const second = arr.slice(mid)
    divideArr(first)
    divideArr(second)
}
divideArr(A)

console.log(divided)
let merged = divided.slice(0)

const mergeAB = (a,b)=> {
    debugger;
    if(b===undefined) return a;
    let length = a.length+b.length
    let mergeArr = []
    let aCompare = a[0]
    let bCompare = b[0]
    let bIndex = 0;
    let aIndex = 0;
    for(let i =0; i<length; i++){
        if(aCompare>bCompare){
            mergeArr[i]=bCompare
            bIndex +=1
            if(bIndex===b.length){
                return mergeArr = mergeArr.concat(a.slice(aIndex))
            }
            else{
                bCompare=b[bIndex]
            }            
        }
        else{
            mergeArr[i]=aCompare
            aIndex +=1
            if(aIndex===a.length){
                return mergeArr = mergeArr.concat(b.slice(bIndex))
            }
            else{
                aCompare=a[aIndex]
            }   
        }
    }
    return mergeArr
}

const mergeArr = (mergedArr)=> {
    debugger;
    if(mergedArr.length===1) return mergedArr
    let newMergeArr = []
    for(let i =0; i<mergedArr.length; i+=2){
        newMergeArr.push(mergeAB(mergedArr[i], mergedArr[i+1]))
    }
    return mergeArr(newMergeArr)
}
const finalMerged = mergeArr(merged)
return finalMerged
}

Analysis

▶

example
example, positive answer, length=6

✘

RUNTIME ERROR
tested program terminated with exit code 1

▶

example1
example, answer is zero, length=4

✘

RUNTIME ERROR
tested program terminated with exit code 1

Code: 10:58:32 UTC, js, verify, result: Failed

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70

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

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

const divided = []

const divideArr = (arr)=>{
    if(arr.length===1){
        divided.push(arr);
        return arr;
    } 
    const mid = parseInt(arr.length/2)
    const first = arr.slice(0,mid)
    const second = arr.slice(mid)
    divideArr(first)
    divideArr(second)
}
divideArr(A)

console.log(divided)
let merged = divided.slice(0)

const mergeAB = (a,b)=> {
  
    if(b===undefined) return a;
    let length = a.length+b.length
    let mergeArr = []
    let aCompare = a[0]
    let bCompare = b[0]
    let bIndex = 0;
    let aIndex = 0;
    for(let i =0; i<length; i++){
        if(aCompare>bCompare){
            mergeArr[i]=bCompare
            bIndex +=1
            if(bIndex===b.length){
                return mergeArr = mergeArr.concat(a.slice(aIndex))
            }
            else{
                bCompare=b[bIndex]
            }            
        }
        else{
            mergeArr[i]=aCompare
            aIndex +=1
            if(aIndex===a.length){
                return mergeArr = mergeArr.concat(b.slice(bIndex))
            }
            else{
                aCompare=a[aIndex]
            }   
        }
    }
    return mergeArr
}

const mergeArr = (mergedArr)=> {
    debugger;
    if(mergedArr.length===1) return mergedArr
    let newMergeArr = []
    for(let i =0; i<mergedArr.length; i+=2){
        newMergeArr.push(mergeAB(mergedArr[i], mergedArr[i+1]))
    }
    return mergeArr(newMergeArr)
}
const finalMerged = mergeArr(merged)
return finalMerged
}

Analysis

▶

example
example, positive answer, length=6

✘

RUNTIME ERROR
tested program terminated with exit code 1

▶

example1
example, answer is zero, length=4

✘

RUNTIME ERROR
tested program terminated with exit code 1

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

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70

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

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

const divided = []

const divideArr = (arr)=>{
    if(arr.length===1){
        divided.push(arr);
        return arr;
    } 
    const mid = parseInt(arr.length/2)
    const first = arr.slice(0,mid)
    const second = arr.slice(mid)
    divideArr(first)
    divideArr(second)
}
divideArr(A)


let merged = divided.slice(0)

const mergeAB = (a,b)=> {
  
    if(b===undefined) return a;
    let length = a.length+b.length
    let mergeArr = []
    let aCompare = a[0]
    let bCompare = b[0]
    let bIndex = 0;
    let aIndex = 0;
    for(let i =0; i<length; i++){
        if(aCompare>bCompare){
            mergeArr[i]=bCompare
            bIndex +=1
            if(bIndex===b.length){
                return mergeArr = mergeArr.concat(a.slice(aIndex))
            }
            else{
                bCompare=b[bIndex]
            }            
        }
        else{
            mergeArr[i]=aCompare
            aIndex +=1
            if(aIndex===a.length){
                return mergeArr = mergeArr.concat(b.slice(bIndex))
            }
            else{
                aCompare=a[aIndex]
            }   
        }
    }
    return mergeArr
}

const mergeArr = (mergedArr)=> {
    debugger;
    if(mergedArr.length===1) return mergedArr
    let newMergeArr = []
    for(let i =0; i<mergedArr.length; i+=2){
        newMergeArr.push(mergeAB(mergedArr[i], mergedArr[i+1]))
    }
    return mergeArr(newMergeArr)
}
const finalMerged = mergeArr(merged)
return finalMerged
}

Code: 10:58:57 UTC, js, verify, result: Failed

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68

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

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

const divided = []

const divideArr = (arr)=>{
    if(arr.length===1){
        divided.push(arr);
        return arr;
    } 
    const mid = parseInt(arr.length/2)
    const first = arr.slice(0,mid)
    const second = arr.slice(mid)
    divideArr(first)
    divideArr(second)
}
divideArr(A)
let merged = divided.slice(0)

const mergeAB = (a,b)=> {
  
    if(b===undefined) return a;
    let length = a.length+b.length
    let mergeArr = []
    let aCompare = a[0]
    let bCompare = b[0]
    let bIndex = 0;
    let aIndex = 0;
    for(let i =0; i<length; i++){
        if(aCompare>bCompare){
            mergeArr[i]=bCompare
            bIndex +=1
            if(bIndex===b.length){
                return mergeArr = mergeArr.concat(a.slice(aIndex))
            }
            else{
                bCompare=b[bIndex]
            }            
        }
        else{
            mergeArr[i]=aCompare
            aIndex +=1
            if(aIndex===a.length){
                return mergeArr = mergeArr.concat(b.slice(bIndex))
            }
            else{
                aCompare=a[aIndex]
            }   
        }
    }
    return mergeArr
}

const mergeArr = (mergedArr)=> {
    debugger;
    if(mergedArr.length===1) return mergedArr
    let newMergeArr = []
    for(let i =0; i<mergedArr.length; i+=2){
        newMergeArr.push(mergeAB(mergedArr[i], mergedArr[i+1]))
    }
    return mergeArr(newMergeArr)
}
const finalMerged = mergeArr(merged)
return finalMerged
}

Analysis

▶

example
example, positive answer, length=6

✘

RUNTIME ERROR
tested program terminated with exit code 1

▶

example1
example, answer is zero, length=4

✘

RUNTIME ERROR
tested program terminated with exit code 1

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

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67

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

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

const divided = []

const divideArr = (arr)=>{
    if(arr.length===1){
        divided.push(arr);
        return arr;
    } 
    const mid = parseInt(arr.length/2)
    const first = arr.slice(0,mid)
    const second = arr.slice(mid)
    divideArr(first)
    divideArr(second)
}
divideArr(A)
let merged = divided.slice(0)
const mergeAB = (a,b)=> {
  
    if(b===undefined) return a;
    let length = a.length+b.length
    let mergeArr = []
    let aCompare = a[0]
    let bCompare = b[0]
    let bIndex = 0;
    let aIndex = 0;
    for(let i =0; i<length; i++){
        if(aCompare>bCompare){
            mergeArr[i]=bCompare
            bIndex +=1
            if(bIndex===b.length){
                return mergeArr = mergeArr.concat(a.slice(aIndex))
            }
            else{
                bCompare=b[bIndex]
            }            
        }
        else{
            mergeArr[i]=aCompare
            aIndex +=1
            if(aIndex===a.length){
                return mergeArr = mergeArr.concat(b.slice(bIndex))
            }
            else{
                aCompare=a[aIndex]
            }   
        }
    }
    return mergeArr
}

const mergeArr = (mergedArr)=> {
    debugger;
    if(mergedArr.length===1) return mergedArr
    let newMergeArr = []
    for(let i =0; i<mergedArr.length; i+=2){
        newMergeArr.push(mergeAB(mergedArr[i], mergedArr[i+1]))
    }
    return mergeArr(newMergeArr)
}
const finalMerged = mergeArr(merged)
return finalMerged
}

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

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66

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

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

const divided = []

const divideArr = (arr)=>{
    if(arr.length===1){
        divided.push(arr);
        return arr;
    } 
    const mid = parseInt(arr.length/2)
    const first = arr.slice(0,mid)
    const second = arr.slice(mid)
    divideArr(first)
    divideArr(second)
}
divideArr(A)
let merged = divided.slice(0)
const mergeAB = (a,b)=> {
  
    if(b===undefined) return a;
    let length = a.length+b.length
    let mergeArr = []
    let aCompare = a[0]
    let bCompare = b[0]
    let bIndex = 0;
    let aIndex = 0;
    for(let i =0; i<length; i++){
        if(aCompare>bCompare){
            mergeArr[i]=bCompare
            bIndex +=1
            if(bIndex===b.length){
                return mergeArr = mergeArr.concat(a.slice(aIndex))
            }
            else{
                bCompare=b[bIndex]
            }            
        }
        else{
            mergeArr[i]=aCompare
            aIndex +=1
            if(aIndex===a.length){
                return mergeArr = mergeArr.concat(b.slice(bIndex))
            }
            else{
                aCompare=a[aIndex]
            }   
        }
    }
    return mergeArr
}
const mergeArr = (mergedArr)=> {
    debugger;
    if(mergedArr.length===1) return mergedArr
    let newMergeArr = []
    for(let i =0; i<mergedArr.length; i+=2){
        newMergeArr.push(mergeAB(mergedArr[i], mergedArr[i+1]))
    }
    return mergeArr(newMergeArr)
}
const finalMerged = mergeArr(merged)
return finalMerged
}

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

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66

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

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

const divided = []

const divideArr = (arr)=>{
    if(arr.length===1){
        divided.push(arr);
        return arr;
    } 
    const mid = parseInt(arr.length/2)
    const first = arr.slice(0,mid)
    const second = arr.slice(mid)
    divideArr(first)
    divideArr(second)
}
divideArr(A)
let merged = divided.slice(0)
const mergeAB = (a,b)=> {
  
    if(b===undefined) return a;
    let length = a.length+b.length
    let mergeArr = []
    let aCompare = a[0]
    let bCompare = b[0]
    let bIndex = 0;
    let aIndex = 0;
    for(let i =0; i<length; i++){
        if(aCompare>bCompare){
            mergeArr[i]=bCompare
            bIndex +=1
            if(bIndex===b.length){
                return mergeArr = mergeArr.concat(a.slice(aIndex))
            }
            else{
                bCompare=b[bIndex]
            }            
        }
        else{
            mergeArr[i]=aCompare
            aIndex +=1
            if(aIndex===a.length){
                return mergeArr = mergeArr.concat(b.slice(bIndex))
            }
            else{
                aCompare=a[aIndex]
            }   
        }
    }
    return mergeArr
}
const mergeArr = (mergedArr)=> {
    deb
    if(mergedArr.length===1) return mergedArr
    let newMergeArr = []
    for(let i =0; i<mergedArr.length; i+=2){
        newMergeArr.push(mergeAB(mergedArr[i], mergedArr[i+1]))
    }
    return mergeArr(newMergeArr)
}
const finalMerged = mergeArr(merged)
return finalMerged
}

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

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66

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

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

const divided = []

const divideArr = (arr)=>{
    if(arr.length===1){
        divided.push(arr);
        return arr;
    } 
    const mid = parseInt(arr.length/2)
    const first = arr.slice(0,mid)
    const second = arr.slice(mid)
    divideArr(first)
    divideArr(second)
}
divideArr(A)
let merged = divided.slice(0)
const mergeAB = (a,b)=> {
  
    if(b===undefined) return a;
    let length = a.length+b.length
    let mergeArr = []
    let aCompare = a[0]
    let bCompare = b[0]
    let bIndex = 0;
    let aIndex = 0;
    for(let i =0; i<length; i++){
        if(aCompare>bCompare){
            mergeArr[i]=bCompare
            bIndex +=1
            if(bIndex===b.length){
                return mergeArr = mergeArr.concat(a.slice(aIndex))
            }
            else{
                bCompare=b[bIndex]
            }            
        }
        else{
            mergeArr[i]=aCompare
            aIndex +=1
            if(aIndex===a.length){
                return mergeArr = mergeArr.concat(b.slice(bIndex))
            }
            else{
                aCompare=a[aIndex]
            }   
        }
    }
    return mergeArr
}
const mergeArr = (mergedArr)=> {
    
    if(mergedArr.length===1) return mergedArr
    let newMergeArr = []
    for(let i =0; i<mergedArr.length; i+=2){
        newMergeArr.push(mergeAB(mergedArr[i], mergedArr[i+1]))
    }
    return mergeArr(newMergeArr)
}
const finalMerged = mergeArr(merged)
return finalMerged
}

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

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66

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

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

const divided = []

const divideArr = (arr)=>{
    if(arr.length===1){
        divided.push(arr);
        return arr;
    } 
    const mid = parseInt(arr.length/2)
    const first = arr.slice(0,mid)
    const second = arr.slice(mid)
    divideArr(first)
    divideArr(second)
}
divideArr(A)
let merged = divided.slice(0)
const mergeAB = (a,b)=> {
  
    if(b===undefined) return a;
    let length = a.length+b.length
    let mergeArr = []
    let aCompare = a[0]
    let bCompare = b[0]
    let bIndex = 0;
    let aIndex = 0;
    for(let i =0; i<length; i++){
        if(aCompare>bCompare){
            mergeArr[i]=bCompare
            bIndex +=1
            if(bIndex===b.length){
                return mergeArr = mergeArr.concat(a.slice(aIndex))
            }
            else{
                bCompare=b[bIndex]
            }            
        }
        else{
            mergeArr[i]=aCompare
            aIndex +=1
            if(aIndex===a.length){
                return mergeArr = mergeArr.concat(b.slice(bIndex))
            }
            else{
                aCompare=a[aIndex]
            }   
        }
    }
    return mergeArr
}
const mergeArr = (mergedArr)=> {
    
    if(mergedArr.length===1) return mergedArr
    let newMergeArr = []
    for(let i =0; i<mergedArr.length; i+=2){
        newMergeArr.push(mergeAB(mergedArr[i], mergedArr[i+1]))
    }
    return mergeArr(newMergeArr)
}
const finalMerged = mergeArr(merged)
rfinalMerged
}

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

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71

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

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

const divided = []

const divideArr = (arr)=>{
    if(arr.length===1){
        divided.push(arr);
        return arr;
    } 
    const mid = parseInt(arr.length/2)
    const first = arr.slice(0,mid)
    const second = arr.slice(mid)
    divideArr(first)
    divideArr(second)
}
divideArr(A)
let merged = divided.slice(0)
const mergeAB = (a,b)=> {
  
    if(b===undefined) return a;
    let length = a.length+b.length
    let mergeArr = []
    let aCompare = a[0]
    let bCompare = b[0]
    let bIndex = 0;
    let aIndex = 0;
    for(let i =0; i<length; i++){
        if(aCompare>bCompare){
            mergeArr[i]=bCompare
            bIndex +=1
            if(bIndex===b.length){
                return mergeArr = mergeArr.concat(a.slice(aIndex))
            }
            else{
                bCompare=b[bIndex]
            }            
        }
        else{
            mergeArr[i]=aCompare
            aIndex +=1
            if(aIndex===a.length){
                return mergeArr = mergeArr.concat(b.slice(bIndex))
            }
            else{
                aCompare=a[aIndex]
            }   
        }
    }
    return mergeArr
}
const mergeArr = (mergedArr)=> {
    
    if(mergedArr.length===1) return mergedArr
    let newMergeArr = []
    for(let i =0; i<mergedArr.length; i+=2){
        newMergeArr.push(mergeAB(mergedArr[i], mergedArr[i+1]))
    }
    return mergeArr(newMergeArr)
}
const finalMerged = mergeArr(merged)
finalMerged
for(let i=0; i<final)




}

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

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73

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

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

const divided = []

const divideArr = (arr)=>{
    if(arr.length===1){
        divided.push(arr);
        return arr;
    } 
    const mid = parseInt(arr.length/2)
    const first = arr.slice(0,mid)
    const second = arr.slice(mid)
    divideArr(first)
    divideArr(second)
}
divideArr(A)
let merged = divided.slice(0)
const mergeAB = (a,b)=> {
  
    if(b===undefined) return a;
    let length = a.length+b.length
    let mergeArr = []
    let aCompare = a[0]
    let bCompare = b[0]
    let bIndex = 0;
    let aIndex = 0;
    for(let i =0; i<length; i++){
        if(aCompare>bCompare){
            mergeArr[i]=bCompare
            bIndex +=1
            if(bIndex===b.length){
                return mergeArr = mergeArr.concat(a.slice(aIndex))
            }
            else{
                bCompare=b[bIndex]
            }            
        }
        else{
            mergeArr[i]=aCompare
            aIndex +=1
            if(aIndex===a.length){
                return mergeArr = mergeArr.concat(b.slice(bIndex))
            }
            else{
                aCompare=a[aIndex]
            }   
        }
    }
    return mergeArr
}
const mergeArr = (mergedArr)=> {
    
    if(mergedArr.length===1) return mergedArr
    let newMergeArr = []
    for(let i =0; i<mergedArr.length; i+=2){
        newMergeArr.push(mergeAB(mergedArr[i], mergedArr[i+1]))
    }
    return mergeArr(newMergeArr)
}
const finalMerged = mergeArr(merged)
finalMerged
for(let i=0; i<finalMerged.length; i++){
    if(A[i])
}




}

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

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73

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

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

const divided = []

const divideArr = (arr)=>{
    if(arr.length===1){
        divided.push(arr);
        return arr;
    } 
    const mid = parseInt(arr.length/2)
    const first = arr.slice(0,mid)
    const second = arr.slice(mid)
    divideArr(first)
    divideArr(second)
}
divideArr(A)
let merged = divided.slice(0)
const mergeAB = (a,b)=> {
  
    if(b===undefined) return a;
    let length = a.length+b.length
    let mergeArr = []
    let aCompare = a[0]
    let bCompare = b[0]
    let bIndex = 0;
    let aIndex = 0;
    for(let i =0; i<length; i++){
        if(aCompare>bCompare){
            mergeArr[i]=bCompare
            bIndex +=1
            if(bIndex===b.length){
                return mergeArr = mergeArr.concat(a.slice(aIndex))
            }
            else{
                bCompare=b[bIndex]
            }            
        }
        else{
            mergeArr[i]=aCompare
            aIndex +=1
            if(aIndex===a.length){
                return mergeArr = mergeArr.concat(b.slice(bIndex))
            }
            else{
                aCompare=a[aIndex]
            }   
        }
    }
    return mergeArr
}
const mergeArr = (mergedArr)=> {
    
    if(mergedArr.length===1) return mergedArr
    let newMergeArr = []
    for(let i =0; i<mergedArr.length; i+=2){
        newMergeArr.push(mergeAB(mergedArr[i], mergedArr[i+1]))
    }
    return mergeArr(newMergeArr)
}
const finalMerged = mergeArr(merged)
finalMerged
for(let i=0; i<finalMerged.length-2; i++){
    if(A[i]+A[i+1])
}




}

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

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72

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

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

const divided = []

const divideArr = (arr)=>{
    if(arr.length===1){
        divided.push(arr);
        return arr;
    } 
    const mid = parseInt(arr.length/2)
    const first = arr.slice(0,mid)
    const second = arr.slice(mid)
    divideArr(first)
    divideArr(second)
}
divideArr(A)
let merged = divided.slice(0)
const mergeAB = (a,b)=> {
  
    if(b===undefined) return a;
    let length = a.length+b.length
    let mergeArr = []
    let aCompare = a[0]
    let bCompare = b[0]
    let bIndex = 0;
    let aIndex = 0;
    for(let i =0; i<length; i++){
        if(aCompare>bCompare){
            mergeArr[i]=bCompare
            bIndex +=1
            if(bIndex===b.length){
                return mergeArr = mergeArr.concat(a.slice(aIndex))
            }
            else{
                bCompare=b[bIndex]
            }            
        }
        else{
            mergeArr[i]=aCompare
            aIndex +=1
            if(aIndex===a.length){
                return mergeArr = mergeArr.concat(b.slice(bIndex))
            }
            else{
                aCompare=a[aIndex]
            }   
        }
    }
    return mergeArr
}
const mergeArr = (mergedArr)=> {
    
    if(mergedArr.length===1) return mergedArr
    let newMergeArr = []
    for(let i =0; i<mergedArr.length; i+=2){
        newMergeArr.push(mergeAB(mergedArr[i], mergedArr[i+1]))
    }
    return mergeArr(newMergeArr)
}
const finalMerged = mergeArr(merged)
for(let i=0; i<finalMerged.length-2; i++){
    if(A[i]+A[i+1]>A[i+2]) return 1; 
}
return 0;



}

Code: 11:02:44 UTC, js, verify, result: Failed

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72

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

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

const divided = []

const divideArr = (arr)=>{
    if(arr.length===1){
        divided.push(arr);
        return arr;
    } 
    const mid = parseInt(arr.length/2)
    const first = arr.slice(0,mid)
    const second = arr.slice(mid)
    divideArr(first)
    divideArr(second)
}
divideArr(A)
let merged = divided.slice(0)
const mergeAB = (a,b)=> {
  
    if(b===undefined) return a;
    let length = a.length+b.length
    let mergeArr = []
    let aCompare = a[0]
    let bCompare = b[0]
    let bIndex = 0;
    let aIndex = 0;
    for(let i =0; i<length; i++){
        if(aCompare>bCompare){
            mergeArr[i]=bCompare
            bIndex +=1
            if(bIndex===b.length){
                return mergeArr = mergeArr.concat(a.slice(aIndex))
            }
            else{
                bCompare=b[bIndex]
            }            
        }
        else{
            mergeArr[i]=aCompare
            aIndex +=1
            if(aIndex===a.length){
                return mergeArr = mergeArr.concat(b.slice(bIndex))
            }
            else{
                aCompare=a[aIndex]
            }   
        }
    }
    return mergeArr
}
const mergeArr = (mergedArr)=> {
    
    if(mergedArr.length===1) return mergedArr
    let newMergeArr = []
    for(let i =0; i<mergedArr.length; i+=2){
        newMergeArr.push(mergeAB(mergedArr[i], mergedArr[i+1]))
    }
    return mergeArr(newMergeArr)
}
const finalMerged = mergeArr(merged)
for(let i=0; i<finalMerged.length-2; i++){
    if(A[i]+A[i+1]>A[i+2]) return 1; 
}
return 0;



}

Analysis

▶

example
example, positive answer, length=6

✘

WRONG ANSWER
got 0 expected 1

▶

example1
example, answer is zero, length=4

✔

OK

Code: 11:03:13 UTC, js, autosave

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72

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

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

const divided = []

const divideArr = (arr)=>{
    if(arr.length===1){
        divided.push(arr);
        return arr;
    } 
    const mid = parseInt(arr.length/2)
    const first = arr.slice(0,mid)
    const second = arr.slice(mid)
    divideArr(first)
    divideArr(second)
}
divideArr(A)
let merged = divided.slice(0)
const mergeAB = (a,b)=> {
  
    if(b===undefined) return a;
    let length = a.length+b.length
    let mergeArr = []
    let aCompare = a[0]
    let bCompare = b[0]
    let bIndex = 0;
    let aIndex = 0;
    for(let i =0; i<length; i++){
        if(aCompare>bCompare){
            mergeArr[i]=bCompare
            bIndex +=1
            if(bIndex===b.length){
                return mergeArr = mergeArr.concat(a.slice(aIndex))
            }
            else{
                bCompare=b[bIndex]
            }            
        }
        else{
            mergeArr[i]=aCompare
            aIndex +=1
            if(aIndex===a.length){
                return mergeArr = mergeArr.concat(b.slice(bIndex))
            }
            else{
                aCompare=a[aIndex]
            }   
        }
    }
    return mergeArr
}
const mergeArr = (mergedArr)=> {
    
    if(mergedArr.length===1) return mergedArr
    let newMergeArr = []
    for(let i =0; i<mergedArr.length; i+=2){
        newMergeArr.push(mergeAB(mergedArr[i], mergedArr[i+1]))
    }
    return mergeArr(newMergeArr)
}
const finalMerged = mergeArr(merged)
for(let i=0; i<finalMerged.length-2; i++){
    if(finalMerged[i]+finalMerged[i+1]>finalMerged[i+2]) return 1; 
}
return 0;



}

Code: 11:03:14 UTC, js, verify, result: Failed

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72

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

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

const divided = []

const divideArr = (arr)=>{
    if(arr.length===1){
        divided.push(arr);
        return arr;
    } 
    const mid = parseInt(arr.length/2)
    const first = arr.slice(0,mid)
    const second = arr.slice(mid)
    divideArr(first)
    divideArr(second)
}
divideArr(A)
let merged = divided.slice(0)
const mergeAB = (a,b)=> {
  
    if(b===undefined) return a;
    let length = a.length+b.length
    let mergeArr = []
    let aCompare = a[0]
    let bCompare = b[0]
    let bIndex = 0;
    let aIndex = 0;
    for(let i =0; i<length; i++){
        if(aCompare>bCompare){
            mergeArr[i]=bCompare
            bIndex +=1
            if(bIndex===b.length){
                return mergeArr = mergeArr.concat(a.slice(aIndex))
            }
            else{
                bCompare=b[bIndex]
            }            
        }
        else{
            mergeArr[i]=aCompare
            aIndex +=1
            if(aIndex===a.length){
                return mergeArr = mergeArr.concat(b.slice(bIndex))
            }
            else{
                aCompare=a[aIndex]
            }   
        }
    }
    return mergeArr
}
const mergeArr = (mergedArr)=> {
    
    if(mergedArr.length===1) return mergedArr
    let newMergeArr = []
    for(let i =0; i<mergedArr.length; i+=2){
        newMergeArr.push(mergeAB(mergedArr[i], mergedArr[i+1]))
    }
    return mergeArr(newMergeArr)
}
const finalMerged = mergeArr(merged)
for(let i=0; i<finalMerged.length-2; i++){
    if(finalMerged[i]+finalMerged[i+1]>finalMerged[i+2]) return 1; 
}
return 0;



}

Analysis

▶

example
example, positive answer, length=6

✘

WRONG ANSWER
got 0 expected 1

▶

example1
example, answer is zero, length=4

✔

OK

Code: 11:08:13 UTC, js, autosave

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72

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

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

const divided = []

const divideArr = (arr)=>{
    if(arr.length===1){
        divided.push(arr);
        return arr;
    } 
    const mid = parseInt(arr.length/2)
    const first = arr.slice(0,mid)
    const second = arr.slice(mid)
    divideArr(first)
    divideArr(second)
}
divideArr(A)
let merged = divided.slice(0)
const mergeAB = (a,b)=> {
  
    if(b===undefined) return a;
    let length = a.length+b.length
    let mergeArr = []
    let aCompare = a[0]
    let bCompare = b[0]
    let bIndex = 0;
    let aIndex = 0;
    for(let i =0; i<length; i++){
        if(aCompare>bCompare){
            mergeArr[i]=bCompare
            bIndex +=1
            if(bIndex===b.length){
                return mergeArr = mergeArr.concat(a.slice(aIndex))
            }
            else{
                bCompare=b[bIndex]
            }            
        }
        else{
            mergeArr[i]=aCompare
            aIndex +=1
            if(aIndex===a.length){
                return mergeArr = mergeArr.concat(b.slice(bIndex))
            }
            else{
                aCompare=a[aIndex]
            }   
        }
    }
    return mergeArr
}
const mergeArr = (mergedArr)=> {
    
    if(mergedArr.length===1) return mergedArr
    let newMergeArr = []
    for(let i =0; i<mergedArr.length; i+=2){
        newMergeArr.push(mergeAB(mergedArr[i], mergedArr[i+1]))
    }
    return mergeArr(newMergeArr)
}
const finalMerged = mergeArr(merged)[]
for(let i=0; i<finalMerged.length-2; i++){
    if(finalMerged[i]+finalMerged[i+1]>finalMerged[i+2]) return 1; 
}
return 0;



}

Code: 11:08:17 UTC, js, verify, result: Passed

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72

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

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

const divided = []

const divideArr = (arr)=>{
    if(arr.length===1){
        divided.push(arr);
        return arr;
    } 
    const mid = parseInt(arr.length/2)
    const first = arr.slice(0,mid)
    const second = arr.slice(mid)
    divideArr(first)
    divideArr(second)
}
divideArr(A)
let merged = divided.slice(0)
const mergeAB = (a,b)=> {
  
    if(b===undefined) return a;
    let length = a.length+b.length
    let mergeArr = []
    let aCompare = a[0]
    let bCompare = b[0]
    let bIndex = 0;
    let aIndex = 0;
    for(let i =0; i<length; i++){
        if(aCompare>bCompare){
            mergeArr[i]=bCompare
            bIndex +=1
            if(bIndex===b.length){
                return mergeArr = mergeArr.concat(a.slice(aIndex))
            }
            else{
                bCompare=b[bIndex]
            }            
        }
        else{
            mergeArr[i]=aCompare
            aIndex +=1
            if(aIndex===a.length){
                return mergeArr = mergeArr.concat(b.slice(bIndex))
            }
            else{
                aCompare=a[aIndex]
            }   
        }
    }
    return mergeArr
}
const mergeArr = (mergedArr)=> {
    
    if(mergedArr.length===1) return mergedArr
    let newMergeArr = []
    for(let i =0; i<mergedArr.length; i+=2){
        newMergeArr.push(mergeAB(mergedArr[i], mergedArr[i+1]))
    }
    return mergeArr(newMergeArr)
}
const finalMerged = mergeArr(merged)[0]
for(let i=0; i<finalMerged.length-2; i++){
    if(finalMerged[i]+finalMerged[i+1]>finalMerged[i+2]) return 1; 
}
return 0;



}

Analysis

▶

example
example, positive answer, length=6

✔

OK

▶

example1
example, answer is zero, length=4

✔

OK

Code: 11:08:20 UTC, js, verify, result: Passed

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72

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

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

const divided = []

const divideArr = (arr)=>{
    if(arr.length===1){
        divided.push(arr);
        return arr;
    } 
    const mid = parseInt(arr.length/2)
    const first = arr.slice(0,mid)
    const second = arr.slice(mid)
    divideArr(first)
    divideArr(second)
}
divideArr(A)
let merged = divided.slice(0)
const mergeAB = (a,b)=> {
  
    if(b===undefined) return a;
    let length = a.length+b.length
    let mergeArr = []
    let aCompare = a[0]
    let bCompare = b[0]
    let bIndex = 0;
    let aIndex = 0;
    for(let i =0; i<length; i++){
        if(aCompare>bCompare){
            mergeArr[i]=bCompare
            bIndex +=1
            if(bIndex===b.length){
                return mergeArr = mergeArr.concat(a.slice(aIndex))
            }
            else{
                bCompare=b[bIndex]
            }            
        }
        else{
            mergeArr[i]=aCompare
            aIndex +=1
            if(aIndex===a.length){
                return mergeArr = mergeArr.concat(b.slice(bIndex))
            }
            else{
                aCompare=a[aIndex]
            }   
        }
    }
    return mergeArr
}
const mergeArr = (mergedArr)=> {
    
    if(mergedArr.length===1) return mergedArr
    let newMergeArr = []
    for(let i =0; i<mergedArr.length; i+=2){
        newMergeArr.push(mergeAB(mergedArr[i], mergedArr[i+1]))
    }
    return mergeArr(newMergeArr)
}
const finalMerged = mergeArr(merged)[0]
for(let i=0; i<finalMerged.length-2; i++){
    if(finalMerged[i]+finalMerged[i+1]>finalMerged[i+2]) return 1; 
}
return 0;



}

Analysis

▶

example
example, positive answer, length=6

✔

OK

▶

example1
example, answer is zero, length=4

✔

OK

Code: 11:08:22 UTC, js, final, score: 93

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72

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

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

const divided = []

const divideArr = (arr)=>{
    if(arr.length===1){
        divided.push(arr);
        return arr;
    } 
    const mid = parseInt(arr.length/2)
    const first = arr.slice(0,mid)
    const second = arr.slice(mid)
    divideArr(first)
    divideArr(second)
}
divideArr(A)
let merged = divided.slice(0)
const mergeAB = (a,b)=> {
  
    if(b===undefined) return a;
    let length = a.length+b.length
    let mergeArr = []
    let aCompare = a[0]
    let bCompare = b[0]
    let bIndex = 0;
    let aIndex = 0;
    for(let i =0; i<length; i++){
        if(aCompare>bCompare){
            mergeArr[i]=bCompare
            bIndex +=1
            if(bIndex===b.length){
                return mergeArr = mergeArr.concat(a.slice(aIndex))
            }
            else{
                bCompare=b[bIndex]
            }            
        }
        else{
            mergeArr[i]=aCompare
            aIndex +=1
            if(aIndex===a.length){
                return mergeArr = mergeArr.concat(b.slice(bIndex))
            }
            else{
                aCompare=a[aIndex]
            }   
        }
    }
    return mergeArr
}
const mergeArr = (mergedArr)=> {
    
    if(mergedArr.length===1) return mergedArr
    let newMergeArr = []
    for(let i =0; i<mergedArr.length; i+=2){
        newMergeArr.push(mergeAB(mergedArr[i], mergedArr[i+1]))
    }
    return mergeArr(newMergeArr)
}
const finalMerged = mergeArr(merged)[0]
for(let i=0; i<finalMerged.length-2; i++){
    if(finalMerged[i]+finalMerged[i+1]>finalMerged[i+2]) return 1; 
}
return 0;



}

Analysis summary

The following issues have been detected: runtime errors.

For example, for the input [] the solution terminated unexpectedly.

Analysis

Detected time complexity:

O(N*log(N))

▶

example
example, positive answer, length=6

✔

OK

▶

example1
example, answer is zero, length=4

✔

OK

▶

extreme_empty
empty sequence

✘

RUNTIME ERROR
tested program terminated with exit code 1

▶

extreme_single
1-element sequence

✔

OK

▶

extreme_two_elems
2-element sequence

✔

OK

▶

extreme_negative1
three equal negative numbers

✔

OK

▶

extreme_arith_overflow1
overflow test, 3 MAXINTs

✔

OK

▶

extreme_arith_overflow2
overflow test, 10 and 2 MININTs

✔

OK

▶

extreme_arith_overflow3
overflow test, 0 and 2 MAXINTs

✔

OK

▶

medium1
chaotic sequence of values from [0..100K], length=30

✔

OK

▶

medium2
chaotic sequence of values from [0..1K], length=50

✔

OK

▶

medium3
chaotic sequence of values from [0..1K], length=100

✔

OK

▶

large1
chaotic sequence with values from [0..100K], length=10K

✔

OK

1.

0.128 s

OK

2.

0.072 s

OK

3.

0.072 s

OK

4.

0.072 s

OK

5.

0.068 s

OK

6.

0.072 s

OK

▶

large2
1 followed by an ascending sequence of ~50K elements from [0..100K], length=~50K

✔

OK

1.

0.220 s

OK

2.

0.072 s

OK

3.

0.072 s

OK

4.

0.072 s

OK

5.

0.068 s

OK

6.

0.072 s

OK

▶

large_random
chaotic sequence of values from [0..1M], length=100K

✔

OK

1.

0.372 s

OK

2.

0.072 s

OK

3.

0.072 s

OK

4.

0.068 s

OK

5.

0.068 s

OK

6.

0.068 s

OK

▶

large_negative
chaotic sequence of negative values from [-1M..-1], length=100K

✔

OK

1.

0.376 s

OK

2.

0.072 s

OK

3.

0.072 s

OK

4.

0.072 s

OK

5.

0.068 s

OK

6.

0.072 s

OK

▶

large_negative2
chaotic sequence of negative values from [-10..-1], length=100K

✔

OK

1.

0.372 s

OK

2.

0.072 s

OK

3.

0.072 s

OK

4.

0.072 s

OK

5.

0.072 s

OK

6.

0.068 s

OK

▶

large_negative3
sequence of -1 value, length=100K

✔

OK

1.

0.352 s

OK

2.

0.072 s

OK

3.

0.068 s

OK

4.

0.072 s

OK

5.

0.072 s

OK

6.

0.072 s

OK

Task description

Task timeline