Test results - Codility

Tasks Details

easy

1. TieRopes

Tie adjacent ropes to achieve the maximum number of ropes of length >= K.

Task Score

100%

Correctness

100%

Performance

100%

There are N ropes numbered from 0 to N − 1, whose lengths are given in an array A, lying on the floor in a line. For each I (0 ≤ I < N), the length of rope I on the line is A[I].

We say that two ropes I and I + 1 are adjacent. Two adjacent ropes can be tied together with a knot, and the length of the tied rope is the sum of lengths of both ropes. The resulting new rope can then be tied again.

For a given integer K, the goal is to tie the ropes in such a way that the number of ropes whose length is greater than or equal to K is maximal.

For example, consider K = 4 and array A such that:

A[0] = 1 A[1] = 2 A[2] = 3 A[3] = 4 A[4] = 1 A[5] = 1 A[6] = 3

The ropes are shown in the figure below.

We can tie:

rope 1 with rope 2 to produce a rope of length A[1] + A[2] = 5;

rope 4 with rope 5 with rope 6 to produce a rope of length A[4] + A[5] + A[6] = 5.

After that, there will be three ropes whose lengths are greater than or equal to K = 4. It is not possible to produce four such ropes.

Write a function:

class Solution { public int solution(int K, int[] A); }

that, given an integer K and a non-empty array A of N integers, returns the maximum number of ropes of length greater than or equal to K that can be created.

For example, given K = 4 and array A such that:

A[0] = 1 A[1] = 2 A[2] = 3 A[3] = 4 A[4] = 1 A[5] = 1 A[6] = 3

the function should return 3, as explained above.

Write an efficient algorithm for the following assumptions:

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

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

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

Solution

Programming language used Java 11

Time spent on task 15 minutes

Notes

not defined yet

Code: 13:32:37 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 K, int[] A) {
        // Implement your solution here
    }
}

Code: 13:33:33 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 K, int[] A) {
        // Implement your solution here
    }
}

Code: 13:33:59 UTC, java, autosave

show code in pop-up

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

// 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");
import java.util.*;
class Solution {
    public int solution(int K, int[] A) {
        for(int i=0; i<A.lengthi; i++){
            if(A[i])
        }
    }
}

Code: 13:34:17 UTC, java, autosave

show code in pop-up

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

// 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");
import java.util.*;
class Solution {
    public int solution(int K, int[] A) {
        int count = 0;
        for(int i=0; i<A.length; i++){
            if(A[i]>=K){
                count++;
            }
        }
    }
}

Code: 13:35:55 UTC, java, autosave

show code in pop-up

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

// you can 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");
import java.util.*;
class Solution {
    public int solution(int K, int[] A) {
        int count = 0;
        for(int i=0; i<A.length; i++){
            if(A[i]>=K){
                count++;
            }
            els
        }
    }
}

Code: 13:36:06 UTC, java, autosave

show code in pop-up

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

// you can 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");
import java.util.*;
class Solution {
    public int solution(int K, int[] A) {
        int count = 0;
        for(int i=0; i<A.length; i++){
            if(A[i]>=K){
                count++;
            }
            else{

            }
        }
    }
    return 0;
}

Code: 13:36:17 UTC, java, autosave

show code in pop-up

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

// you can 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");
import java.util.*;
class Solution {
    public int solution(int K, int[] A) {
        int count = 0;
        for(int i=0; i<A.length; i++){
            if(A[i]>=K){
                count++;
            }
            else{

            }
        }
        
    return 0;
    }
}

Code: 13:36:32 UTC, java, autosave

show code in pop-up

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

// you can 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");
import java.util.*;
class Solution {
    public int solution(int K, int[] A) {
        int count = 0;
        for(int i=0; i<A.length; i++){
            if(A[i]>=K){
                count++;
            }
            else{
                while()
            }
        }
        
    return 0;
    }
}

Code: 13:36:47 UTC, java, autosave

show code in pop-up

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

// you can 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");
import java.util.*;
class Solution {
    public int solution(int K, int[] A) {
        int count = 0;
        for(int i=0; i<A.length; i++){
            if(A[i]>=K){
                count++;
            }
            else{
                while(int j=i; )
            }
        }
        
    return 0;
    }
}

Code: 13:36:57 UTC, java, autosave

show code in pop-up

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

// you can 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");
import java.util.*;
class Solution {
    public int solution(int K, int[] A) {
        int count = 0;
        for(int i=0; i<A.length; i++){
            if(A[i]>=K){
                count++;
            }
            else{
                while()
            }
        }
        
    return 0;
    }
}

Code: 13:38:25 UTC, java, 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

// 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");
import java.util.*;
class Solution {
    public int solution(int K, int[] A) {
        int count = 0;
        for(int i=0; i<A.length; i++){
            if(A[i]>=K){
                count++;
            }
            else{
                int
                while()
            }
        }
        
    return 0;
    }
}

Code: 13:38:48 UTC, java, 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

// 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");
import java.util.*;
class Solution {
    public int solution(int K, int[] A) {
        int count = 0;
        for(int i=0; i<A.length; i++){
            if(A[i]>=K){
                count++;
            }
            else{
                int tmp=0;
                while(tmp>=4){
                    tmp = A[i]+A[i+1];
                }
            }
        }
        
    return 0;
    }
}

Code: 13:43:41 UTC, java11, 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 K, int[] A) {
        // Implement your solution here
    }
}

Code: 13:44:11 UTC, java11, autosave

show code in pop-up

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

// 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");
import java.util.*;
class Solution {
    public int solution(int K, int[] A) {

    int count =  0;

    for(int i=0; i<A.length ; 
    return count;   
    }
}

Code: 13:44:28 UTC, java11, autosave

show code in pop-up

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

// you can 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");
import java.util.*;
class Solution {
    public int solution(int K, int[] A) {

    int count =  0;

    for(int i=0; i<A.length; i++){
        if(A[i]>=K){
            count ++;
        }
        
    }
    return count;   
    }
}

Code: 13:44:42 UTC, java11, 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

// 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");
import java.util.*;
class Solution {
    public int solution(int K, int[] A) {

    int count =  0;
    int tmp = 0;
    for(int i=0; i<A.length; i++){
        if(A[i]>=K){
            count ++;
        }
        else{

        }
    }
    return count;   
    }
}

Code: 13:44:53 UTC, java11, 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

// 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");
import java.util.*;
class Solution {
    public int solution(int K, int[] A) {

    int count =  0;
    int tmp = 0;
    for(int i=0; i<A.length; i++){
        if(A[i]>=K){
            count ++;
        }
        else{
            tmp = tmp +A[i];
        }
    }
    return count;   
    }
}

Code: 13:45:42 UTC, java11, 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

// 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");
import java.util.*;
class Solution {
    public int solution(int K, int[] A) {

    int count =  0;
    int tmp = 0;
    for(int i=0; i<A.length; i++){
        if(A[i]>=K ){
            count ++;
        }
        else{
            tmp = tmp +A[i];
        }
    }
    return count;   
    }
}

Code: 13:45:55 UTC, java11, autosave

show code in pop-up

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

// you can 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");
import java.util.*;
class Solution {
    public int solution(int K, int[] A) {

    int count =  0;
    int tmp = 0;
    for(int i=0; i<A.length; i++){
        if(A[i]>=K || tmp>=K){
            count ++;
            tmp = 0;
        }
        else{
            tmp = tmp +A[i];
        }
    }
    return count;   
    }
}

Code: 13:46:22 UTC, java11, 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

// 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");
import java.util.*;
class Solution {
    public int solution(int K, int[] A) {

    int count =  0;
    int tmp = 0;
    for(int i=0; i<A.length; i++){
        if(A[i]>=K || tmp>=K){
            count ++;
            tmp = 0;
        }
        else{
            tmp = tmp +A[i];
        }
    }
    return count;   
    }
}

Analysis

expand all Example tests

▶

example
example test

✘

WRONG ANSWER
got 1 expected 3

0.008 s

WRONG ANSWER, got 1 expected 3

Code: 13:46:41 UTC, java11, 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

// 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");
import java.util.*;
class Solution {
    public int solution(int K, int[] A) {

    int count =  0;
    int tmp = 0;
    for(int i=0; i<A.length; i++){
        if(A[i]>=K || tmp>=K){
            count ++;
            tmp = 0;
        }
        else{
            tmp = tmp +A[i];
            if(A[i]>=K || tmp>=K){
        }
    }
    return count;   
    }
}

Code: 13:46:52 UTC, java11, 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

// 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");
import java.util.*;
class Solution {
    public int solution(int K, int[] A) {

    int count =  0;
    int tmp = 0;
    for(int i=0; i<A.length; i++){
        if(A[i]>=K || tmp>=K){
            count ++;
            tmp = 0;
        }
        else{
            tmp = tmp +A[i];
            if(A[i]>=K || tmp>=K){
            count ++;
            tmp = 0;
            }
        }
    }
    return count;   
    }
}

Analysis

expand all Example tests

▶

example
example test

✔

0.012 s

Code: 13:47:12 UTC, java11, 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

// 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");
import java.util.*;
class Solution {
    public int solution(int K, int[] A) {

    int count =  0;
    int tmp = 0;
    for(int i=0; i<A.length; i++){
        if(A[i]>=K || tmp>=K){
            count ++;
            tmp = 0;
        }
        else{
            tmp = tmp +A[i];
            if(A[i]>=K || tmp>=K){
            count ++;
            tmp = 0;
            }
        }
    }
    return count;   
    }
}

Analysis

expand all Example tests

▶

example
example test

✔

0.012 s

Code: 13:47:18 UTC, java11, 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

// 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");
import java.util.*;
class Solution {
    public int solution(int K, int[] A) {

    int count =  0;
    int tmp = 0;
    for(int i=0; i<A.length; i++){
        if(A[i]>=K || tmp>=K){
            count ++;
            tmp = 0;
        }
        else{
            tmp = tmp +A[i];
            if(A[i]>=K || tmp>=K){
            count ++;
            tmp = 0;
            }
        }
    }
    return count;   
    }
}

Analysis summary

The solution obtained perfect score.

Analysis

Detected time complexity:

O(N)

expand all Example tests

▶

example
example test

✔

0.012 s

expand all Correctness tests

▶

single
single element

✔

0.008 s

0.012 s

0.008 s

▶

double
two elements

✔

0.012 s

0.008 s

0.012 s

▶

small_functional
small functional tests

✔

0.012 s

0.008 s

▶

small_random
small random sequences length = ~100

✔

0.008 s

expand all Performance tests

▶

medium_random
chaotic medium sequences length = ~5,000

✔

0.032 s

0.020 s

▶

large_range
large range test, length = ~100,000

✔

0.188 s

0.184 s

0.308 s

▶

large_answer
test with large answer, length = ~100,000

✔

0.472 s

0.464 s

0.268 s

0.436 s

▶

small_answer
test with large answer, length = ~100,000

✔

0.188 s

0.088 s

0.192 s