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%

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:

class Solution { public int solution(int[] 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 C#

Time spent on task 21 minutes

Notes

not defined yet

Task timeline

Code: 19:02:45 UTC, cs, verify, result: Failed

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34

using System;
// you can also use other imports, for example:
// using System.Collections.Generic;

// you can use Console.WriteLine for debugging purposes, e.g.
// Console.WriteLine("this is a debug message");

class Solution {
    public int solution(int[] A) {
        // write your code in C# 6.0 with .NET 4.5 (Mono)
        int minI=0;
        double minValue = 100001;
        
        for (int i=0; i<A.Length-1; i++)
        {
         if ((A[i] + A[i+1] /2.0 < minValue))    
         {
             minI=i;
             minValue=(A[i] + A[i+1])/ 2.0;
         }
        
         if (i < A.Length-2)
         {
              if ((A[i] +A[i+1]+A[i+2]) / 3.0 < minValue)
              {
                 minI=i;
                 minValue= (A[i] +A[i+1]+A[i+2]) / 3.0;
          
               }
          
        }
        return minI;
    }
}

Analysis

Compile error

Compilation failed: 1 error(s), 0 warnings
Solution.cs(33,246): error CS1525: Unexpected symbol `end-of-file'

Code: 19:03:03 UTC, cs, verify, result: Failed

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35

using System;
// you can also use other imports, for example:
// using System.Collections.Generic;

// you can use Console.WriteLine for debugging purposes, e.g.
// Console.WriteLine("this is a debug message");

class Solution {
    public int solution(int[] A) {
        // write your code in C# 6.0 with .NET 4.5 (Mono)
        int minI=0;
        double minValue = 100001;
        
        for (int i=0; i<A.Length-1; i++)
        {
         if ((A[i] + A[i+1] /2.0 < minValue))    
         {
             minI=i;
             minValue=(A[i] + A[i+1])/ 2.0;
         }
        
         if (i < A.Length-2)
         {
              if ((A[i] +A[i+1]+A[i+2]) / 3.0 < minValue)
              {
                 minI=i;
                 minValue= (A[i] +A[i+1]+A[i+2]) / 3.0;
          
               }
          
        }
        return minI;
    }
}
}

Analysis

Compile error

Compilation failed: 1 error(s), 1 warnings
Solution.cs(9,16): error CS0161: `Solution.solution(int[])': not all code paths return a value
Solution.cs(14,37): warning CS0162: Unreachable code detected

Code: 19:03:34 UTC, cs, verify, result: Failed

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35

using System;
// you can also use other imports, for example:
// using System.Collections.Generic;

// you can use Console.WriteLine for debugging purposes, e.g.
// Console.WriteLine("this is a debug message");

class Solution {
    public int solution(int[] A) {
        // write your code in C# 6.0 with .NET 4.5 (Mono)
        int minI=0;
        double minValue = 100001;
        
        for (int i=0; i<A.Length-1; i++)
        {
         if ((A[i] + A[i+1] /2.0 < minValue))    
         {
             minI=i;
             minValue=(A[i] + A[i+1])/ 2.0;
         }
        
         if (i < A.Length-2)
         {
              if ((A[i] +A[i+1]+A[i+2]) / 3.0 < minValue)
              {
                 minI=i;
                 minValue= (A[i] +A[i+1]+A[i+2]) / 3.0;
          
               }          
          }
        
        }
    return minI;
}
}

Analysis

expand all Example tests

▶

example
example test

✘

WRONG ANSWER
got 0 expected 1

0.062 s

WRONG ANSWER, got 0 expected 1

Code: 19:04:51 UTC, cs, verify, result: Failed

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35

using System;
// you can also use other imports, for example:
// using System.Collections.Generic;

// you can use Console.WriteLine for debugging purposes, e.g.
// Console.WriteLine("this is a debug message");

class Solution {
    public int solution(int[] A) {
        // write your code in C# 6.0 with .NET 4.5 (Mono)
        int minI=0;
        double minValue = 100001;
        
        for (int i=0; i<A.Length-1; i++)
        {
             if (((A[i] + A[i+1] /2.0) < minValue))    
             {
                 minI=i;
                 minValue=(A[i] + A[i+1])/ 2.0;
             }
            
             if (i < A.Length-2)
             {
                  if (((A[i] +A[i+1]+A[i+2]) / 3.0) < minValue)
                  {
                     minI=i;
                     minValue= (A[i] +A[i+1]+A[i+2]) / 3.0;
              
                   }          
             }
        
        }
    return minI;
}
}

Analysis

expand all Example tests

▶

example
example test

✘

WRONG ANSWER
got 0 expected 1

0.056 s

WRONG ANSWER, got 0 expected 1

Code: 19:07:22 UTC, cs, verify, result: Failed

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35

using System;
// you can also use other imports, for example:
// using System.Collections.Generic;

// you can use Console.WriteLine for debugging purposes, e.g.
// Console.WriteLine("this is a debug message");

class Solution {
    public int solution(int[] A) {
        // write your code in C# 6.0 with .NET 4.5 (Mono)
        int minI=0;
        double minValue = 100001;
        
        for (int i=0; i<A.Length-1; i++)
        {
             if (((A[i] + A[i+1] /2.0) < minValue))    
             {
                 minI=i;
                 minValue=(A[i] + A[i+1])/ 2.0;
             }
            
             if (i < A.Length-2)
             {
                  if (((A[i] +A[i+1]+A[i+2]) / 3.0) < minValue)
                  {
                     minI=i;
                     minValue= (A[i] +A[i+1]+A[i+2]) / 3.0;
              
                   }          
             }
        
        }
    return minI;
}
}

Analysis

expand all Example tests

▶

example
example test

✘

WRONG ANSWER
got 0 expected 1

0.060 s

WRONG ANSWER, got 0 expected 1

Code: 19:08:47 UTC, cs, verify, result: Failed

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36

using System;
// you can also use other imports, for example:
// using System.Collections.Generic;

// you can use Console.WriteLine for debugging purposes, e.g.
// Console.WriteLine("this is a debug message");

class Solution {
    public int solution(int[] A) {
        // write your code in C# 6.0 with .NET 4.5 (Mono)
        int minI=0;
        double minValue = 100001;
        
        for (int i=0; i<A.Length-1; i++)
        {
             if (((A[i] + A[i+1] /2.0) < minValue))    
             {
                 Console.WriteLine(minI);
                 minI=i;
                 minValue=(A[i] + A[i+1])/ 2.0;
             }
            
             if (i < A.Length-2)
             {
                  if (((A[i] +A[i+1]+A[i+2]) / 3.0) < minValue)
                  {
                     minI=i;
                     minValue= (A[i] +A[i+1]+A[i+2]) / 3.0;
              
                   }          
             }
        
        }
        return minI;
}
}

Analysis

expand all Example tests

▶

example
example test

✘

WRONG ANSWER
got 0 expected 1

0.064 s

WRONG ANSWER, got 0 expected 1

stderr:

WARNING: producing output may seriously slow down your code!

stdout:

Code: 19:10:26 UTC, cs, verify, result: Failed

show code in pop-up

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

using System;
// you can also use other imports, for example:
// using System.Collections.Generic;

// you can use Console.WriteLine for debugging purposes, e.g.
// Console.WriteLine("this is a debug message");

class Solution {
    public int solution(int[] A) {
        // write your code in C# 6.0 with .NET 4.5 (Mono)
        int minI=0;
        double minValue = 100001.0;
        
        for (int i=0; i<A.Length-1; i++)
        {
             if (((A[i] + A[i+1] /2.0) < minValue))    
             {
                 minI=i;
                 minValue=((A[i] + A[i+1])/ 2.0);
             }           
             if (i < A.Length-2)
             {
                  if (((A[i] +A[i+1]+A[i+2]) / 3.0) < minValue)
                  {
                     minI=i;
                     minValue= (A[i] +A[i+1]+A[i+2]) / 3.0;              
                   }          
             }      
        }
        return minI;
}
}

Analysis

expand all Example tests

▶

example
example test

✘

WRONG ANSWER
got 0 expected 1

0.061 s

WRONG ANSWER, got 0 expected 1

Code: 19:11:49 UTC, cs, verify, result: Failed

show code in pop-up

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

using System;
// you can also use other imports, for example:
// using System.Collections.Generic;

// you can use Console.WriteLine for debugging purposes, e.g.
// Console.WriteLine("this is a debug message");

class Solution {
    public int solution(int[] A) {
        // write your code in C# 6.0 with .NET 4.5 (Mono)
        int minI=0;
        double minValue = 100001.0;
        
        for (int i=0; i<A.Length-1; i++)
        {
             if (((A[i] + A[i+1] /2.0) < minValue))    
             {
                 minI=i;
                 minValue=((A[i] + A[i+1])/ 2.0);
             }           
             if (i < A.Length-2)
             {
                  if (((A[i] +A[i+1]+A[i+2]) / 3.0) < minValue)
                  {
                     minI=i;
                     minValue= (A[i] +A[i+1]+A[i+2]) / 3.0;              
                   }          
             }      
        }
        return minI;
}
}

Analysis

expand all Example tests

▶

example
example test

✘

WRONG ANSWER
got 0 expected 1

0.066 s

WRONG ANSWER, got 0 expected 1

Code: 19:12:17 UTC, cs, verify, result: Failed

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33

using System;
// you can also use other imports, for example:
// using System.Collections.Generic;

// you can use Console.WriteLine for debugging purposes, e.g.
// Console.WriteLine("this is a debug message");

class Solution {
    public int solution(int[] A) {
        // write your code in C# 6.0 with .NET 4.5 (Mono)
        int minI=0;
        double minValue = 100001.0;
        
        for (int i=0; i<A.Length-1; i++)
        {
             if (((A[i] + A[i+1] /2.0) < minValue))    
             {
                 minI=i;
                 minValue=((A[i] + A[i+1])/ 2.0);
             }           
             if (i < A.Length-2)
             {
                  if (((A[i] +A[i+1]+A[i+2]) / 3.0) < minValue)
                  {
                     minI=i;
                     minValue= (A[i] +A[i+1]+A[i+2]) / 3.0;              
                   }          
             }      
        }
        Console.WriteLine(minValue);
        return minI;
}
}

Analysis

expand all Example tests

▶

example
example test

✘

WRONG ANSWER
got 0 expected 1

0.065 s

WRONG ANSWER, got 0 expected 1

stderr:

WARNING: producing output may seriously slow down your code!

stdout:

2.66666666666667

Code: 19:12:47 UTC, cs, verify, result: Failed

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33

using System;
// you can also use other imports, for example:
// using System.Collections.Generic;

// you can use Console.WriteLine for debugging purposes, e.g.
// Console.WriteLine("this is a debug message");

class Solution {
    public int solution(int[] A) {
        // write your code in C# 6.0 with .NET 4.5 (Mono)
        int minI=0;
        double minValue = 100001.0;
        
        for (int i=0; i<A.Length-1; i++)
        {
             if (((A[i] + A[i+1] /2.0) < minValue))    
             {
                 minI=i;
                 minValue=((A[i] + A[i+1])/ 2.0);
             }           
             if (i < A.Length-2)
             {
                  if (((A[i] +A[i+1]+A[i+2]) / 3.0) < minValue)
                  {
                     minI=i;
                     minValue= (A[i] +A[i+1]+A[i+2]) / 3.0;              
                   }          
             }      
        }
        
        return minI;
}
}

Analysis

expand all Example tests

▶

example
example test

✘

WRONG ANSWER
got 0 expected 1

0.060 s

WRONG ANSWER, got 0 expected 1

Code: 19:15:20 UTC, cs, verify, result: Failed

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33

using System;
// you can also use other imports, for example:
using System.Collections.Generic;

// you can use Console.WriteLine for debugging purposes, e.g.
// Console.WriteLine("this is a debug message");

class Solution {
    public int solution(int[] A) {
        // write your code in C# 6.0 with .NET 4.5 (Mono)
        int minI=0;
        double minValue = 100001.0;
        
        for (int i=0; i<A.Length-1; i++)
        {
             if (((A[i] + A[i+1] /2.0) < minValue))    
             {
                 minI=i;
                 minValue=((A[i] + A[i+1])/ 2.0);
             }           
             if (i < A.Length-2)
             {
                  if (((A[i] +A[i+1]+A[i+2]) / 3.0) < minValue)
                  {
                     minI=i;
                     minValue= (A[i] +A[i+1]+A[i+2]) / 3.0;              
                   }          
             }      
        }
        
        return minI;
}
}

Analysis

expand all Example tests

▶

example
example test

✘

WRONG ANSWER
got 0 expected 1

0.062 s

WRONG ANSWER, got 0 expected 1

Code: 19:16:42 UTC, cs, verify, result: Failed

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33

using System;
// you can also use other imports, for example:
using System.Collections.Generic;

// you can use Console.WriteLine for debugging purposes, e.g.
// Console.WriteLine("this is a debug message");

class Solution {
    public int solution(int[] A) {
        // write your code in C# 6.0 with .NET 4.5 (Mono)
        int minI=0;
        double minValue = 100001.0;
        
        for (int i=0; i<A.Length-1; i++)
        {
             if (((A[i]+A[i+1]/2.0) < minValue))    
             {
                 minI=i;
                 minValue=((A[i]+A[i+1])/2.0);
             }           
             if (i < A.Length-2)
             {
                  if (((A[i] +A[i+1]+A[i+2])/3.0) < minValue)
                  {
                     minI=i;
                     minValue= (A[i] +A[i+1]+A[i+2]) / 3.0;              
                   }          
             }      
        }
        
        return minI;
}
}

Analysis

expand all Example tests

▶

example
example test

✘

WRONG ANSWER
got 0 expected 1

0.061 s

WRONG ANSWER, got 0 expected 1

Code: 19:17:13 UTC, cs, verify, result: Failed

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33

using System;
// you can also use other imports, for example:
using System.Collections.Generic;

// you can use Console.WriteLine for debugging purposes, e.g.
// Console.WriteLine("this is a debug message");

class Solution {
    public int solution(int[] A) {
        // write your code in C# 6.0 with .NET 4.5 (Mono)
        int minI=0;
        double minValue = 100001.0;
        
        for (int i=0; i<A.Length-1; i++)
        {
             if (((A[i]+A[i+1]/2.0) < minValue))    
             {
                 minI=i;
                 minValue=((A[i]+A[i+1])/2.0);
             }           
             if (i < A.Length-2)
             {
                  if (((A[i] +A[i+1]+A[i+2])/3.0)< minValue)
                  {
                     minI=i;
                     minValue= (A[i] +A[i+1]+A[i+2]) / 3.0;              
                   }          
             }      
        }
        
        return minI;
}
}

Analysis

expand all Example tests

▶

example
example test

✘

WRONG ANSWER
got 0 expected 1

0.060 s

WRONG ANSWER, got 0 expected 1

Code: 19:17:46 UTC, cs, verify, result: Failed

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34

using System;
// you can also use other imports, for example:
using System.Collections.Generic;

// you can use Console.WriteLine for debugging purposes, e.g.
// Console.WriteLine("this is a debug message");

class Solution {
    public int solution(int[] A) {
        // write your code in C# 6.0 with .NET 4.5 (Mono)
        int minI=0;
        double minValue = 100001.0;
        
        for (int i=0; i<A.Length-1; i++)
        {
            Console.Write(i);
             if (((A[i]+A[i+1]/2.0) < minValue))    
             {
                 minI=i;
                 minValue=((A[i]+A[i+1])/2.0);
             }           
             if (i < A.Length-2)
             {
                  if (((A[i] +A[i+1]+A[i+2])/3.0)< minValue)
                  {
                     minI=i;
                     minValue= (A[i] +A[i+1]+A[i+2]) / 3.0;              
                   }          
             }      
        }
        
        return minI;
}
}

Analysis

expand all Example tests

▶

example
example test

✘

WRONG ANSWER
got 0 expected 1

0.064 s

WRONG ANSWER, got 0 expected 1

stderr:

WARNING: producing output may seriously slow down your code!

stdout:

Code: 19:18:52 UTC, cs, verify, result: Failed

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34

using System;
// you can also use other imports, for example:
using System.Collections.Generic;

// you can use Console.WriteLine for debugging purposes, e.g.
// Console.WriteLine("this is a debug message");

class Solution {
    public int solution(int[] A) {
        // write your code in C# 6.0 with .NET 4.5 (Mono)
        int minI=0;
        double minValue = 100001.0;
        
        for (int i=0; i<A.Length-1; i++)
        {
            
             if (((A[i]+A[i+1]/2.0) < minValue))    
             {
                 minI=i;
                 minValue=((A[i]+A[i+1])/2.0);
             }           
             if (i < A.Length-2)
             {
                  if (((A[i] +A[i+1]+A[i+2])/3.0)< minValue)
                  {
                     minI=i;
                     minValue= (A[i] +A[i+1]+A[i+2]) / 3.0;              
                   }          
             }      
        }
        
        return minI;
}
}

Analysis

expand all Example tests

▶

example
example test

✘

WRONG ANSWER
got 0 expected 1

0.061 s

WRONG ANSWER, got 0 expected 1

Code: 19:19:40 UTC, cs, verify, result: Failed

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34

using System;
// you can also use other imports, for example:
using System.Collections.Generic;

// you can use Console.WriteLine for debugging purposes, e.g.
// Console.WriteLine("this is a debug message");

class Solution {
    public int solution(int[] A) {
        // write your code in C# 6.0 with .NET 4.5 (Mono)
        int minI=0;
        double minValue = 100001.0;
        
        for (int i=0; i<A.Length-1; i++)
        {
            
             if (((A[i]+A[i+1]/2.0) < minValue))    
             {
                 minI=i;
                 minValue=(A[i]+A[i+1])/2.00;
             }           
             if (i < A.Length-2)
             {
                  if (((A[i] +A[i+1]+A[i+2])/3.0)< minValue)
                  {
                     minI=i;
                     minValue= (A[i] +A[i+1]+A[i+2]) / 3.0;              
                   }          
             }      
        }
        
        return minI;
}
}

Analysis

expand all Example tests

▶

example
example test

✘

WRONG ANSWER
got 0 expected 1

0.060 s

WRONG ANSWER, got 0 expected 1

Code: 19:20:15 UTC, cs, verify, result: Failed

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35

using System;
// you can also use other imports, for example:
using System.Collections.Generic;

// you can use Console.WriteLine for debugging purposes, e.g.
// Console.WriteLine("this is a debug message");

class Solution {
    public int solution(int[] A) {
        // write your code in C# 6.0 with .NET 4.5 (Mono)
        int minI=0;
        double minValue = 100001.0;
        
        for (int i=0; i<A.Length-1; i++)
        {
            
             if (((A[i]+A[i+1]/2.0) < minValue))    
             {
                 minI=i;
                 minValue=(A[i]+A[i+1])/2.0;
                 Console.Write(minValue);
             }           
             if (i < A.Length-2)
             {
                  if (((A[i] +A[i+1]+A[i+2])/3.0)< minValue)
                  {
                     minI=i;
                     minValue= (A[i] +A[i+1]+A[i+2]) / 3.0;              
                   }          
             }      
        }
        
        return minI;
}
}

Analysis

expand all Example tests

▶

example
example test

✘

WRONG ANSWER
got 0 expected 1

0.066 s

WRONG ANSWER, got 0 expected 1

stderr:

WARNING: producing output may seriously slow down your code!

stdout:

Code: 19:21:30 UTC, cs, verify, result: Failed

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35

using System;
// you can also use other imports, for example:
using System.Collections.Generic;

// you can use Console.WriteLine for debugging purposes, e.g.
// Console.WriteLine("this is a debug message");

class Solution {
    public int solution(int[] A) {
        // write your code in C# 6.0 with .NET 4.5 (Mono)
        int minI=0;
        double minValue = 100001.0;
        
        for (int i=0; i<A.Length-1; i++)
        {
            
             if (((A[i]+A[i+1])/2.0) < minValue))    
             {
                 minI=i;
                 minValue=(A[i]+A[i+1])/2.0;
    
             }           
             if (i < A.Length-2)
             {
                  if (((A[i] +A[i+1]+A[i+2])/3.0)< minValue)
                  {
                     minI=i;
                     minValue= (A[i] +A[i+1]+A[i+2]) / 3.0;              
                   }          
             }      
        }
        
        return minI;
}
}

Analysis

Compile error

Compilation failed: 1 error(s), 1 warnings
Solution.cs(17,48): error CS1525: Unexpected symbol `)'
Solution.cs(18,14): warning CS0642: Possible mistaken empty statement

Code: 19:21:42 UTC, cs, verify, result: Passed

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35

using System;
// you can also use other imports, for example:
using System.Collections.Generic;

// you can use Console.WriteLine for debugging purposes, e.g.
// Console.WriteLine("this is a debug message");

class Solution {
    public int solution(int[] A) {
        // write your code in C# 6.0 with .NET 4.5 (Mono)
        int minI=0;
        double minValue = 100001.0;
        
        for (int i=0; i<A.Length-1; i++)
        {
            
             if (((A[i]+A[i+1])/2.0) < minValue)    
             {
                 minI=i;
                 minValue=(A[i]+A[i+1])/2.0;
    
             }           
             if (i < A.Length-2)
             {
                  if (((A[i] +A[i+1]+A[i+2])/3.0)< minValue)
                  {
                     minI=i;
                     minValue= (A[i] +A[i+1]+A[i+2]) / 3.0;              
                   }          
             }      
        }
        
        return minI;
}
}

Analysis

expand all Example tests

▶

example
example test

✔

0.060 s

Code: 19:21:46 UTC, cs, verify, result: Passed

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35

using System;
// you can also use other imports, for example:
using System.Collections.Generic;

// you can use Console.WriteLine for debugging purposes, e.g.
// Console.WriteLine("this is a debug message");

class Solution {
    public int solution(int[] A) {
        // write your code in C# 6.0 with .NET 4.5 (Mono)
        int minI=0;
        double minValue = 100001.0;
        
        for (int i=0; i<A.Length-1; i++)
        {
            
             if (((A[i]+A[i+1])/2.0) < minValue)    
             {
                 minI=i;
                 minValue=(A[i]+A[i+1])/2.0;
    
             }           
             if (i < A.Length-2)
             {
                  if (((A[i] +A[i+1]+A[i+2])/3.0)< minValue)
                  {
                     minI=i;
                     minValue= (A[i] +A[i+1]+A[i+2]) / 3.0;              
                   }          
             }      
        }
        
        return minI;
}
}

Analysis

expand all Example tests

▶

example
example test

✔

0.061 s

Code: 19:21:49 UTC, cs, final, score: 100

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35

using System;
// you can also use other imports, for example:
using System.Collections.Generic;

// you can use Console.WriteLine for debugging purposes, e.g.
// Console.WriteLine("this is a debug message");

class Solution {
    public int solution(int[] A) {
        // write your code in C# 6.0 with .NET 4.5 (Mono)
        int minI=0;
        double minValue = 100001.0;
        
        for (int i=0; i<A.Length-1; i++)
        {
            
             if (((A[i]+A[i+1])/2.0) < minValue)    
             {
                 minI=i;
                 minValue=(A[i]+A[i+1])/2.0;
    
             }           
             if (i < A.Length-2)
             {
                  if (((A[i] +A[i+1]+A[i+2])/3.0)< minValue)
                  {
                     minI=i;
                     minValue= (A[i] +A[i+1]+A[i+2]) / 3.0;              
                   }          
             }      
        }
        
        return minI;
}
}

Analysis summary

The solution obtained perfect score.

Analysis

Detected time complexity:

O(N)

expand all Example tests

▶

example
example test

✔

0.060 s

expand all Correctness tests

▶

double_quadruple
two or four elements

✔

0.060 s

0.059 s

0.060 s

▶

simple1
simple test, the best slice has length 3

✔

0.060 s

0.063 s

▶

simple2
simple test, the best slice has length 3

✔

0.062 s

▶

small_random
random, length = 100

✔

0.059 s

▶

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

✔

0.062 s

expand all Performance tests

▶

medium_random
random, N = ~700

✔

0.062 s

▶

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

✔

0.098 s

0.079 s

▶

large_random
random, N = ~100,000

✔

0.096 s

▶

extreme_values
all maximal values, N = ~100,000

✔

0.097 s

0.102 s

0.099 s

▶

large_sequence
many seqeneces, N = ~100,000

✔

0.084 s

0.082 s