Test results - Codility

Tasks Details

medium

1. MinAvgTwoSlice

Find the minimal average of any slice containing at least two elements.

Task Score

100%

Correctness

100%

Performance

100%

Task description

A non-empty array A consisting of N integers is given. A pair of integers (P, Q), such that 0 ≤ P < Q < N, is called a slice of array A (notice that the slice contains at least two elements). The average of a slice (P, Q) is the sum of A[P] + A[P + 1] + ... + A[Q] divided by the length of the slice. To be precise, the average equals (A[P] + A[P + 1] + ... + A[Q]) / (Q − P + 1).

For example, array A such that:

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

contains the following example slices:

slice (1, 2), whose average is (2 + 2) / 2 = 2;

slice (3, 4), whose average is (5 + 1) / 2 = 3;

slice (1, 4), whose average is (2 + 2 + 5 + 1) / 4 = 2.5.

The goal is to find the starting position of a slice whose average is minimal.

Write a function:

def solution(A)

that, given a non-empty array A consisting of N integers, returns the starting position of the slice with the minimal average. If there is more than one slice with a minimal average, you should return the smallest starting position of such a slice.

For example, given array A such that:

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

the function should return 1, as explained above.

Write an efficient algorithm for the following assumptions:

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

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

Solution

Programming language used Python

Time spent on task 17 minutes

Notes

not defined yet

Task timeline

‌

Code: 08:43:15 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[] A) {
        // write your code in Java SE 8
    }
}

Code: 08:43:20 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(A):
    # write your code in Python 3.6
    pass

Code: 08:43:49 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6 7 8

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(A):
    
    for a in A:
        print(a)_
    return 0

Code: 08:44:06 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(A):
    
    for i,a in enumerate(A):
        print(a)
        
        
    return 0

Code: 08:44:22 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(A):
    
    for i in range(len(A)):
        print(A[i])
        
        
    return 0

Code: 08:44:34 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(A):
    
    for i in range(len(A)):
        print(A[i], A[i+1], )
        
        
    return 0

Code: 08:44:44 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(A):
    
    alen = len(A)
    for i in range(len(A)):
        print(A[i], A[i+1], )
        
        
    return 0

Code: 08:44:54 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(A):
    
    alen = len(A)
    for i in range(alen):
        print(A[i], A[i+1], )
        
        
    return 0

Code: 08:44:57 UTC, py, verify, result: Failed

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(A):
    
    alen = len(A)
    for i in range(alen):
        print(A[i], A[i+1],A[i+2] )
        
        
    return 0

Analysis

expand all Example tests

▶

example
example test

✘

RUNTIME ERROR
tested program terminated with exit code 1

0.036 s

RUNTIME ERROR, tested program terminated with exit code 1

stderr:

Traceback (most recent call last):
  File "exec.py", line 129, in <module>
    main()
  File "exec.py", line 91, in main
    result = solution( A )
  File "/tmp/solution.py", line 8, in solution
    print(A[i], A[i+1],A[i+2] )
IndexError: list index out of range

stdout:

Code: 08:45:24 UTC, py, autosave

show code in pop-up

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

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(A):
    
    alen = len(A)
    for i in range(alen):
        print(A[i], A[i+1],A[i+2] )
        if i < alen - 2:
        
        
        
    return 0

Code: 08:45:41 UTC, py, autosave

show code in pop-up

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

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(A):
    
    alen = len(A)
    for i in range(alen):
        
        print(A[i], A[i+1],A[i+2] )
        
        
        
    return 0

Code: 08:45:57 UTC, py, autosave

show code in pop-up

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

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(A):
    
    alen = len(A)
    for i in range(alen):
        if i +3 
        print(A[i], A[i+1],A[i+2] )
        
        
        
    return 0

Code: 08:46:16 UTC, py, autosave

show code in pop-up

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

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(A):
    
    alen = len(A)
    for i in range(alen):
        if i +3 > alen: break
        
        
        print(A[i], A[i+1],A[i+2] )
        
        
        
    return 0

Code: 08:46:26 UTC, py, autosave

show code in pop-up

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

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(A):
    
    alen = len(A)
    for i in range(alen):
        if i +3 > alen: break
        
        if i +3 < alen:
        print(A[i], A[i+1],A[i+2] )
        
        
        
    return 0

Code: 08:46:46 UTC, py, autosave

show code in pop-up

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

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(A):
    
    alen = len(A)
    for i in range(alen):
        if i +3 > alen: break
        
        print(A[i], A[i+1])
        
        if i +3 <= alen:
            print(A[i], A[i+1],A[i+2] )
        
        
        
    return 0

Code: 08:47:17 UTC, py, autosave

show code in pop-up

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

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(A):
    
    alen = len(A)
    for i in range(alen):
        if i + 3 > alen: break
        
        print(A[i], A[i+1])
        
        if i +3 <= alen:
            print(A[i], A[i+1],A[i+2] )
        
        
        
    return 0

Code: 08:47:20 UTC, py, 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

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(A):
    
    alen = len(A)
    for i in range(alen):
        if i + 3 > alen: break
        
        print(A[i], A[i+1])
        
        if i +3 <= alen:
            print(A[i], A[i+1],A[i+2] )
        
        
        
    return 0

Analysis

expand all Example tests

▶

example
example test

✘

WRONG ANSWER
got 0 expected 1

0.036 s

WRONG ANSWER, got 0 expected 1

stdout:

Code: 08:47:45 UTC, py, autosave

show code in pop-up

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

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(A):
    
    alen = len(A)
    for i in range(alen):
        if i + 2 > alen: break
        
        print(A[i], A[i+1])
        
        if i +3 <= alen:
            print(A[i], A[i+1],A[i+2] )
        
        
        
    return 0

Code: 08:47:47 UTC, py, 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

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(A):
    
    alen = len(A)
    for i in range(alen):
        if i + 2 > alen: break
        
        print(A[i], A[i+1])
        
        if i +3 <= alen:
            print(A[i], A[i+1],A[i+2] )
        
        
        
    return 0

Analysis

expand all Example tests

▶

example
example test

✘

WRONG ANSWER
got 0 expected 1

0.036 s

WRONG ANSWER, got 0 expected 1

stdout:

Code: 08:48:16 UTC, py, autosave

show code in pop-up

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

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(A):
    
    alen = len(A)
    for i in range(alen):
        if i + 2 > alen: break
        
        
        print(A[i], A[i+1])
        
        if i +3 <= alen:
            print(A[i], A[i+1],A[i+2] )
        
        
        
    return 0

Code: 08:48:46 UTC, py, autosave

show code in pop-up

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

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(A):
    
    alen = len(A)
    for i in range(alen):
        if i + 2 > alen: break
        
        
        avg2 = (A[i], A[i+1])/2
        
        if i +3 <= alen:
            print(A[i], A[i+1],A[i+2] )
        
        
        
    return 0

Code: 08:49:12 UTC, py, autosave

show code in pop-up

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

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(A):
    
    alen = len(A)
    avgmin = 0
    avgstart = 0
    for i in range(alen):
        if i + 2 > alen: break
        
        
        avg2 = (A[i], A[i+1])/2
        
        if i +3 <= alen:
            print(A[i], A[i+1],A[i+2] )
        
        
        
    return 0

Code: 08:49:32 UTC, py, autosave

show code in pop-up

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

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(A):
    
    alen = len(A)
    avgmin = 
    avgstart = 0
    for i in range(alen):
        if i + 2 > alen: break
        
        
        avg2 = (A[i], A[i+1])/2
        if agg
        
        if i +3 <= alen:
            print(A[i], A[i+1],A[i+2] )
        
        
        
    return 0

Code: 08:49:36 UTC, py, autosave

show code in pop-up

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

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(A):
    
    alen = len(A)
    avgmin = 999999999
    avgstart = 0
    for i in range(alen):
        if i + 2 > alen: break
        
        
        avg2 = (A[i], A[i+1])/2
        if agg
        
        if i +3 <= alen:
            print(A[i], A[i+1],A[i+2] )
        
        
        
    return 0

Code: 08:50:02 UTC, py, autosave

show code in pop-up

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

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(A):
    
    alen = len(A)
    avgmin = (A[i], A[i+1])/2
    avgstart = 0
    for i in range(alen):
        if i + 2 > alen: break
        
        
        avg2 = (A[i], A[i+1])/2
        if agg
        
        if i +3 <= alen:
            print(A[i], A[i+1],A[i+2] )
        
        
        
    return 0

Code: 08:50:10 UTC, py, autosave

show code in pop-up

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

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(A):
    
    alen = len(A)
    avgmin = (A[0], A[1])/2
    avgstart = 0
    for i in range(alen):
        if i + 2 > alen: break
        
        
        avg2 = (A[i], A[i+1])/2
        if agg
        
        if i +3 <= alen:
            print(A[i], A[i+1],A[i+2] )
        
        
        
    return 0

Code: 08:50:21 UTC, py, autosave

show code in pop-up

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

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(A):
    
    alen = len(A)
    avgmin = (A[0], A[1])/2
    avgstart = 0
    for i in range(alen):
        if i + 2 > alen: break
        
        
        avg2 = (A[i], A[i+1])/2
        if avg2 < 
        
        if i +3 <= alen:
            print(A[i], A[i+1],A[i+2] )
        
        
        
    return 0

Code: 08:50:39 UTC, py, autosave

show code in pop-up

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

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(A):
    
    alen = len(A)
    avgmin = (A[0], A[1])/2
    avgstart = 0
    for i in range(alen):
        if i + 2 > alen: break
        
        
        avg = (A[i], A[i+1])/2
        if avg2 < avgmin:
            avgmin = avg
            avgstart = 
        
        if i +3 <= alen:
            print(A[i], A[i+1],A[i+2] )
        
        
        
    return 0

Code: 08:50:51 UTC, py, autosave

show code in pop-up

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

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(A):
    
    alen = len(A)
    avgmin = (A[0], A[1])/2
    avgstart = 0
    for i in range(alen):
        if i + 2 > alen: break
        
        
        avg = (A[i], A[i+1])/2
        if avg2 < avgmin:
            avgmin = avg
            avgstart = A[i]
        
        if i +3 <= alen:
            avg = (A[i], A[i+1])/2
        if avg2 < avgmin:
            avgmin = avg
            avgstart = A[i]
        
        
        
    return 0

Code: 08:51:12 UTC, py, 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

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(A):
    
    alen = len(A)
    avgmin = (A[0], A[1])/2
    avgstart = 0
    for i in range(alen):
        if i + 2 > alen: break
        
        
        avg = (A[i], A[i+1])/2
        if avg < avgmin:
            avgmin = avg
            avgstart = A[i]
        
        if i +3 <= alen:
            avg = (A[i], A[i+1]+A[i+2])/3
            if avg < avgmin:
                avgmin = avg
                avgstart = A[i]
        
        
        
    return 0

Analysis

expand all Example tests

▶

example
example test

✘

RUNTIME ERROR
tested program terminated with exit code 1

0.036 s

RUNTIME ERROR, tested program terminated with exit code 1

stderr:

Traceback (most recent call last):
  File "exec.py", line 129, in <module>
    main()
  File "exec.py", line 91, in main
    result = solution( A )
  File "/tmp/solution.py", line 7, in solution
    avgmin = (A[0], A[1])/2
TypeError: unsupported operand type(s) for /: 'tuple' and 'int'

Code: 08:51:41 UTC, py, autosave

show code in pop-up

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

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(A):
    
    alen = len(A)
    avgmin = (A[0], A[1])/2
    avgstart = 0
    for i in range(alen):
        if i + 2 > alen: break
        
        
        avg = (A[i] A[i+1])/2
        if avg < avgmin:
            avgmin = avg
            avgstart = A[i]
        
        if i +3 <= alen:
            avg = (A[i], A[i+1]+A[i+2])/3
            if avg < avgmin:
                avgmin = avg
                avgstart = A[i]
        
        
        
    return 0

Code: 08:51:49 UTC, py, 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

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(A):
    
    alen = len(A)
    avgmin = (A[0], A[1])/2
    avgstart = 0
    for i in range(alen):
        if i + 2 > alen: break
        
        
        avg = (A[i] + A[i+1])/2
        if avg < avgmin:
            avgmin = avg
            avgstart = A[i]
        
        if i +3 <= alen:
            avg = (A[i] + A[i+1] + A[i+2])/3
            if avg < avgmin:
                avgmin = avg
                avgstart = A[i]
        
        
        
    return 0

Analysis

expand all Example tests

▶

example
example test

✘

RUNTIME ERROR
tested program terminated with exit code 1

0.036 s

RUNTIME ERROR, tested program terminated with exit code 1

stderr:

Traceback (most recent call last):
  File "exec.py", line 129, in <module>
    main()
  File "exec.py", line 91, in main
    result = solution( A )
  File "/tmp/solution.py", line 7, in solution
    avgmin = (A[0], A[1])/2
TypeError: unsupported operand type(s) for /: 'tuple' and 'int'

Code: 08:52:02 UTC, py, 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

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(A):
    
    alen = len(A)
    avgmin = (A[0] + A[1])/2
    avgstart = 0
    for i in range(alen):
        if i + 2 > alen: break
        
        
        avg = (A[i] + A[i+1])/2
        if avg < avgmin:
            avgmin = avg
            avgstart = A[i]
        
        if i +3 <= alen:
            avg = (A[i] + A[i+1] + A[i+2])/3
            if avg < avgmin:
                avgmin = avg
                avgstart = A[i]
        
        
        
    return 0

Analysis

expand all Example tests

▶

example
example test

✘

WRONG ANSWER
got 0 expected 1

0.036 s

WRONG ANSWER, got 0 expected 1

Code: 08:52:10 UTC, py, 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

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(A):
    
    alen = len(A)
    avgmin = (A[0] + A[1])/2
    avgstart = 0
    for i in range(alen):
        if i + 2 > alen: break
        
        
        avg = (A[i] + A[i+1])/2
        if avg < avgmin:
            avgmin = avg
            avgstart = A[i]
        
        if i +3 <= alen:
            avg = (A[i] + A[i+1] + A[i+2])/3
            if avg < avgmin:
                avgmin = avg
                avgstart = A[i]
        
        
        
    return avgstart

Analysis

expand all Example tests

▶

example
example test

✘

WRONG ANSWER
got 2 expected 1

0.036 s

WRONG ANSWER, got 2 expected 1

Code: 08:55:51 UTC, py, autosave

show code in pop-up

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

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(A):
    
    alen = len(A)
    avgmin = (A[0] + A[1])/2
    avgstart = 0
    for i in range(alen):
        if i + 2 > alen: break
        
        
        avg = (A[i] + A[i+1])/2
        if avg < avgmin:
            avgmin = avg
            avgstart = i
        
        if i +3 <= alen:
            avg = (A[i] + A[i+1] + A[i+2])/3
            if avg < avgmin:
                avgmin = avg
                avgstart = A[i]
        
        
        
    return avgstart

Code: 08:55:55 UTC, py, 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

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(A):
    
    alen = len(A)
    avgmin = (A[0] + A[1])/2
    avgstart = 0
    for i in range(alen):
        if i + 2 > alen: break
        
        
        avg = (A[i] + A[i+1])/2
        if avg < avgmin:
            avgmin = avg
            avgstart = i
        
        if i +3 <= alen:
            avg = (A[i] + A[i+1] + A[i+2])/3
            if avg < avgmin:
                avgmin = avg
                avgstart = i
        
        
        
    return avgstart

Analysis

expand all Example tests

▶

example
example test

✔

0.036 s

Code: 08:56:21 UTC, py, autosave

show code in pop-up

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

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(A):
    
    alen = len(A)
    avgmin = (A[0] + A[1])/2
    avgstart = 0
    for i in range(alen):
        if i + 2 > alen: break
        
        
        avg = (A[i] + A[i+1])/2
        if avg < avgmin:
            avgmin = avg
            avgstart = i
        
        if i +3 > alen: continue
            avg = (A[i] + A[i+1] + A[i+2])/3
            if avg < avgmin:
                avgmin = avg
                avgstart = i
        
        
        
    return avgstart

Code: 08:56:57 UTC, py, autosave

show code in pop-up

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

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(A):
    
    alen = len(A)
    avgmin = (A[0] + A[1])/2
    avgstart = 0
    for i in range(alen):
        if i + 2 > alen: break
        
        
        avg = (A[i] + A[i+1])/2
        if avg < avgmin:
            avgmin = avg
            avgstart = i
        
        if i +3 > alen: continue
        avg = (A[i] + A[i+1] + A[i+2])/3
            if avg < avgmin:
                avgmin = avg
                avgstart = i
        
        
        
    return avgstart

Code: 08:57:08 UTC, py, 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

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(A):
    
    alen = len(A)
    avgmin = (A[0] + A[1])/2
    avgstart = 0
    for i in range(alen):
        if i + 2 > alen: break
        
        avg = (A[i] + A[i+1])/2
        if avg < avgmin:
            avgmin = avg
            avgstart = i
        
        if i +3 > alen: continue
        
        avg = (A[i] + A[i+1] + A[i+2])/3
        if avg < avgmin:
            avgmin = avg
            avgstart = i
        
        
        
    return avgstart

Analysis

expand all Example tests

▶

example
example test

✔

0.040 s

Code: 08:57:41 UTC, py, 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

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(A):
    
    alen = len(A)
    avgmin = (A[0] + A[1])/2
    avgstart = 0
    for i in range(alen):
        if i + 2 > alen: break
        
        avg = (A[i] + A[i+1])/2
        if avg < avgmin:
            avgmin = avg
            avgstart = i
        
        if i +3 > alen: continue
        
        avg = (A[i] + A[i+1] + A[i+2])/3
        if avg < avgmin:
            avgmin = avg
            avgstart = i
        
        
        
    return avgstart

User test case 1:

[4, 2, 4, 5, 1, 5, 8, 2, 2]

Analysis

expand all Example tests

▶

example
example test

✔

0.036 s

expand all User tests

▶

test_data1

✔

0.036 s

OK
function result: 7

Code: 08:57:52 UTC, py, 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

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(A):
    
    alen = len(A)
    avgmin = (A[0] + A[1])/2
    avgstart = 0
    for i in range(alen):
        if i + 2 > alen: break
        
        avg = (A[i] + A[i+1])/2
        if avg < avgmin:
            avgmin = avg
            avgstart = i
        
        if i +3 > alen: continue
        
        avg = (A[i] + A[i+1] + A[i+2])/3
        if avg < avgmin:
            avgmin = avg
            avgstart = i
        
        
        
    return avgstart

User test case 1:

[4, 2, 2, 4, 5, 1, 5, 8, 2, 2]

Analysis

expand all Example tests

▶

example
example test

✔

0.036 s

expand all User tests

▶

test_data1

✔

0.036 s

OK
function result: 1

Code: 08:58:05 UTC, py, 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

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(A):
    
    alen = len(A)
    avgmin = (A[0] + A[1])/2
    avgstart = 0
    for i in range(alen):
        if i + 2 > alen: break
        
        avg = (A[i] + A[i+1])/2
        if avg < avgmin:
            avgmin = avg
            avgstart = i
        
        if i +3 > alen: continue
        
        avg = (A[i] + A[i+1] + A[i+2])/3
        if avg < avgmin:
            avgmin = avg
            avgstart = i
        
        
    return avgstart

Code: 08:58:34 UTC, py, 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

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(A):
    
    alen = len(A)
    avgmin = (A[0] + A[1])/2
    avgstart = 0
    for i in range(alen):
        if i + 2 > alen: break
        
        avg = (A[i] + A[i+1])/2
        if avg < avgmin:
            avgmin = avg
            avgstart = i
        
        if i + 3 > alen: continue
        
        avg = (A[i] + A[i+1] + A[i+2])/3
        if avg < avgmin:
            avgmin = avg
            avgstart = i
        
        
    return avgstart

Code: 08:58:38 UTC, py, 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

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(A):
    
    alen = len(A)
    avgmin = (A[0] + A[1])/2
    avgstart = 0
    for i in range(alen):
        if i + 2 > alen: break
        
        avg = (A[i] + A[i+1]) / 2
        if avg < avgmin:
            avgmin = avg
            avgstart = i
        
        if i + 3 > alen: continue
        
        avg = (A[i] + A[i+1] + A[i+2]) / 3
        if avg < avgmin:
            avgmin = avg
            avgstart = i
        
        
    return avgstart

User test case 1:

[4, 2, 2, 4, 5, 1, 5, 8, 2, 2]

Analysis

expand all Example tests

▶

example
example test

✔

0.036 s

expand all User tests

▶

test_data1

✔

0.036 s

OK
function result: 1

Code: 08:58:48 UTC, py, 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

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(A):
    
    alen = len(A)
    avgmin = (A[0] + A[1])/2
    avgstart = 0
    for i in range(alen):
        if i + 2 > alen: break
        
        avg = (A[i] + A[i+1]) / 2
        if avg < avgmin:
            avgmin = avg
            avgstart = i
        
        if i + 3 > alen: continue
        
        avg = (A[i] + A[i+1] + A[i+2]) / 3
        if avg < avgmin:
            avgmin = avg
            avgstart = i
        
        
    return avgstart

User test case 1:

[4, 2, 2, 4, 5, 1, 5, 8, 2, 2]

User test case 2:

[4, 2, 4, 5, 1, 5, 8, 2, 2]

Analysis

expand all Example tests

▶

example
example test

✔

0.048 s

expand all User tests

▶

test_data1

✔

0.048 s

OK
function result: 1

▶

test_data2

✔

0.048 s

OK
function result: 7

Code: 08:58:58 UTC, py, 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

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(A):
    
    alen = len(A)
    avgmin = (A[0] + A[1])/2
    avgstart = 0
    for i in range(alen):
        if i + 2 > alen: break
        
        avg = (A[i] + A[i+1]) / 2
        if avg < avgmin:
            avgmin = avg
            avgstart = i
        
        if i + 3 > alen: continue
        
        avg = (A[i] + A[i+1] + A[i+2]) / 3
        if avg < avgmin:
            avgmin = avg
            avgstart = i
        
        
    return avgstart

User test case 1:

[4, 2, 2, 4, 5, 1, 5, 8, 2, 2]

User test case 2:

[4, 2, 4, 5, 1, 5, 8, 2, 2]

User test case 3:

[1, 1]

Analysis

expand all Example tests

▶

example
example test

✔

0.036 s

expand all User tests

▶

test_data1

✔

0.036 s

OK
function result: 1

▶

test_data2

✔

0.036 s

OK
function result: 7

▶

test_data3

✔

0.036 s

OK
function result: 0

Code: 08:59:32 UTC, py, 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

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(A):
    
    alen = len(A)
    avgmin = (A[0] + A[1])/2
    avgstart = 0
    for i in range(1,alen):
        if i + 2 > alen: break
        
        avg = (A[i] + A[i+1]) / 2
        if avg < avgmin:
            avgmin = avg
            avgstart = i
        
        if i + 3 > alen: continue
        
        avg = (A[i] + A[i+1] + A[i+2]) / 3
        if avg < avgmin:
            avgmin = avg
            avgstart = i
        
        
    return avgstart

Code: 08:59:33 UTC, py, 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

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(A):
    
    alen = len(A)
    avgmin = (A[0] + A[1])/2
    avgstart = 0
    for i in range(1,alen):
        if i + 2 > alen: break
        
        avg = (A[i] + A[i+1]) / 2
        if avg < avgmin:
            avgmin = avg
            avgstart = i
        
        if i + 3 > alen: continue
        
        avg = (A[i] + A[i+1] + A[i+2]) / 3
        if avg < avgmin:
            avgmin = avg
            avgstart = i
        
        
    return avgstart

User test case 1:

[4, 2, 2, 4, 5, 1, 5, 8, 2, 2]

User test case 2:

[4, 2, 4, 5, 1, 5, 8, 2, 2]

User test case 3:

[1, 1]

Analysis

expand all Example tests

▶

example
example test

✔

0.036 s

expand all User tests

▶

test_data1

✔

0.036 s

OK
function result: 1

▶

test_data2

✔

0.036 s

OK
function result: 7

▶

test_data3

✔

0.036 s

OK
function result: 0

Code: 08:59:43 UTC, py, autosave

show code in pop-up

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

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(A):
    
    alen = len(A)
    avgmin = (A[0] + A[1])/2
    avgstart = 0
    
    for i in range(1,alen):
        if i + 2 > alen: break
        
        avg = (A[i] + A[i+1]) / 2
        if avg < avgmin:
            avgmin = avg
            avgstart = i
        
        if i + 3 > alen: continue
        
        avg = (A[i] + A[i+1] + A[i+2]) / 3
        if avg < avgmin:
            avgmin = avg
            avgstart = i
        
        
    return avgstart

Code: 08:59:59 UTC, py, 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

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(A):
    
    alen = len(A)
    avgmin = (A[0] + A[1])/2
    avgstart = 0
    
    for i in range(1,alen):
        if i + 2 > alen: break
        
        avg = (A[i] + A[i+1]) / 2
        if avg < avgmin:
            avgmin = avg
            avgstart = i
        
        if i + 3 > alen: continue
        
        avg = (A[i] + A[i+1] + A[i+2]) / 3
        if avg < avgmin:
            avgmin = avg
            avgstart = i
        
        
    return avgstart

User test case 1:

[4, 2, 2, 4, 5, 1, 5, 8, 2, 2]

User test case 2:

[4, 2, 4, 5, 1, 5, 8, 2, 2]

User test case 3:

[1, 1]

Analysis

expand all Example tests

▶

example
example test

✔

0.036 s

expand all User tests

▶

test_data1

✔

0.036 s

OK
function result: 1

▶

test_data2

✔

0.036 s

OK
function result: 7

▶

test_data3

✔

0.036 s

OK
function result: 0

Code: 09:00:06 UTC, py, 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

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(A):
    
    alen = len(A)
    avgmin = (A[0] + A[1])/2
    avgstart = 0
    
    for i in range(1,alen):
        if i + 2 > alen: break
        
        avg = (A[i] + A[i+1]) / 2
        if avg < avgmin:
            avgmin = avg
            avgstart = i
        
        if i + 3 > alen: continue
        
        avg = (A[i] + A[i+1] + A[i+2]) / 3
        if avg < avgmin:
            avgmin = avg
            avgstart = i
        
        
    return avgstart

User test case 1:

[4, 2, 2, 4, 5, 1, 5, 8, 2, 2]

User test case 2:

[4, 2, 4, 5, 1, 5, 8, 2, 2]

User test case 3:

[1, 1]

Analysis

expand all Example tests

▶

example
example test

✔

0.036 s

expand all User tests

▶

test_data1

✔

0.036 s

OK
function result: 1

▶

test_data2

✔

0.036 s

OK
function result: 7

▶

test_data3

✔

0.036 s

OK
function result: 0

Code: 09:00:09 UTC, py, 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

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(A):
    
    alen = len(A)
    avgmin = (A[0] + A[1])/2
    avgstart = 0
    
    for i in range(1,alen):
        if i + 2 > alen: break
        
        avg = (A[i] + A[i+1]) / 2
        if avg < avgmin:
            avgmin = avg
            avgstart = i
        
        if i + 3 > alen: continue
        
        avg = (A[i] + A[i+1] + A[i+2]) / 3
        if avg < avgmin:
            avgmin = avg
            avgstart = i
        
        
    return avgstart

Analysis summary

The solution obtained perfect score.

Analysis

Detected time complexity:

O(N)

expand all Example tests

▶

example
example test

✔

0.036 s

expand all Correctness tests

▶

double_quadruple
two or four elements

✔

0.036 s

▶

simple1
simple test, the best slice has length 3

✔

0.036 s

▶

simple2
simple test, the best slice has length 3

✔

0.036 s

▶

small_random
random, length = 100

✔

0.036 s

▶

medium_range
increasing, decreasing (legth = ~100) and small functional

✔

0.036 s

expand all Performance tests

▶

medium_random
random, N = ~700

✔

0.036 s

▶

large_ones
numbers from -1 to 1, N = ~100,000

✔

0.184 s

0.148 s

▶

large_random
random, N = ~100,000

✔

0.192 s

▶

extreme_values
all maximal values, N = ~100,000

✔

0.184 s

0.188 s

0.196 s

▶

large_sequence
many seqeneces, N = ~100,000

✔

0.180 s

0.144 s