Test results - Codility

Tasks Details

medium

1. BeautifulPassword

Given a string, find the length of the longest substring in which every character appears an even number of times.

Task Score

62%

Correctness

100%

Performance

40%

John takes computer security very seriously, so he has picked a very long password to secure his files. However, although the password is very strong, it is also hard to memorize.

John decides to create a new password which is easier to remember. Therefore, it must fulfill certain requirements: he wants each character (digit or letter) to appear in the new password an even number of times (possibly zero). Also, since he is so proud of his original password, he wants the new password to be a contiguous substring of the original password.

John has trouble finding such a substring. Help him by finding, for a given string, the length of the longest substring that fulfills the requirements set out above.

Write a function:

int solution(char *S);

that, given a non-empty string S consisting of N characters, returns the length of the longest contiguous substring (possibly empty) of string S in which every character occurs an even number of times.

For example, given S = "6daa6ccaaa6d", the function should return 8. The longest valid password taken from S is "a6ccaaa6"; it contains four letters a, and two each of the digit 6 and letter c. Any longer substring must contain either five letters a or one letter d. Given S = "abca", the function should return 0 (note that aa is not a contiguous substring of S).

Write an efficient algorithm for the following assumptions:

the length of string S is within the range [1..100,000];

S consists only of lowercase letters and digits.

Solution

Programming language used C

Time spent on task 79 minutes

Notes

not defined yet

Code: 12:41:29 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(String S) {
        // write your code in Java SE 8
    }
}

Code: 12:41:48 UTC, c, autosave

show code in pop-up

1 2 3 4 5 6

// you can write to stdout for debugging purposes, e.g.
// printf("this is a debug message\n");

int solution(char *S) {
    // write your code in C99 (gcc 6.2.0)
}

Code: 12:50:03 UTC, c, autosave

show code in pop-up

1 2 3 4 5 6 7

// you can write to stdout for debugging purposes, e.g.
// printf("this is a debug message\n");

int solution(char *S) {
    
    // write your code in C99 (gcc 6.2.0)
}

Code: 12:50:21 UTC, c, autosave

show code in pop-up

1 2 3 4 5 6 7 8

// you can write to stdout for debugging purposes, e.g.
// printf("this is a debug message\n");

int solution(char *S) {
    int c=0;
    
    // write your code in C99 (gcc 6.2.0)
}

Code: 12:51:42 UTC, c, autosave

show code in pop-up

1 2 3 4 5 6 7 8

// you can write to stdout for debugging purposes, e.g.
// printf("this is a debug message\n");

int solution(char *S) {
    int c=0,i=;
    
    // write your code in C99 (gcc 6.2.0)
}

Code: 12:51:58 UTC, c, autosave

show code in pop-up

1 2 3 4 5 6 7 8

// you can write to stdout for debugging purposes, e.g.
// printf("this is a debug message\n");

int solution(char *S) {
    int c=0,i=0,j=0;
    for(I=0;I<)
    // write your code in C99 (gcc 6.2.0)
}

Code: 12:52:28 UTC, c, autosave

show code in pop-up

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

// you can write to stdout for debugging purposes, e.g.
// printf("this is a debug message\n");

int solution(char *S) {
    int c=0,i=0,j=0;
    int n=len(S)
    for(i=0;i<n;i++)
    {
        
    }
    // write your code in C99 (gcc 6.2.0)
}

Code: 12:52:39 UTC, c, autosave

show code in pop-up

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

// you can write to stdout for debugging purposes, e.g.
// printf("this is a debug message\n");

int solution(char *S) {
    int c=0,i=0,j=0;
    int n=len(S);
    for(i=0;i<n;i++)
    {
           
    }
    // write your code in C99 (gcc 6.2.0)
}

Code: 12:52:53 UTC, c, 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.
// printf("this is a debug message\n");

int solution(char *S) {
    int c=0,i=0,j=0;
    int n=len(S);
    for(i=0;i<n;i++)
    {
        for(j=0;j<n;j++)
        {
            
        }
    }
    // write your code in C99 (gcc 6.2.0)
}

Code: 12:53:14 UTC, c, 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.
// printf("this is a debug message\n");

int solution(char *S) {
    int c=0,i=0,j=0;
    int n=len(S);
    for(i=0;i<n;i++)
    {
        for(j=0;j<n;j++)
        {
            if(S[i])
        }
    }
    // write your code in C99 (gcc 6.2.0)
}

Code: 12:53:24 UTC, c, 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.
// printf("this is a debug message\n");

int solution(char *S) {
    int c=0,i=0,j=0;
    int n=len(S);
    for(i=0;i<n;i++)
    {
        for(j=0;j<n;j++)
        {
            if(S[i]==)
        }
    }
    // write your code in C99 (gcc 6.2.0)
}

Code: 13:19:53 UTC, c, autosave

show code in pop-up

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

// you can write to stdout for debugging purposes, e.g.
int is(char s[],int i,int j)
{
    int h[150]={0},t,c;
    for(t=i;t<=j;t++)
    {
        c=(s[t]);
    h[c]++;
    }
    for(t=i;t<=j;t++)
    {
        c=s[t];
        if(h[c]%2!=0)
        return 0;
    }
    return 1;
}
int solution(char *s) {
    // write your code in C99 (gcc 6.2.0)
    int n,i,j,m=0,k=0;
    n=strlen(s);
    for(i=0;i<n-1;i++)
    {
        for(j=i+1;j<n;j++)
        {
            if(is(s,i,j))
            m=j-i+1;
            if(m>k)
            k=m;
        }
    }
    return k;
}

Code: 13:20:39 UTC, c, 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

// you can write to stdout for debugging purposes, e.g.
int is(char s[],int i,int j)
{
    int h[150]={0},t,c;
    for(t=i;t<=j;t++)
    {
        c=(s[t]);
    h[c]++;
    }
    for(t=i;t<=j;t++)
    {
        c=s[t];
        if(h[c]%2!=0)
        return 0;
    }
    return 1;
}
int solution(char *s) {
    // write your code in C99 (gcc 6.2.0)
    int n,i,j,m=0,k=0;
    n=strlen(s);
    for(i=0;i<n-1;i++)
    {
        for(j=i+1;j<n;j++)
        {
            if(is(s,i,j))
            m=j-i+1;
            if(m>k)
            k=m;
        }
    }
    return k;
}

Analysis

expand all Example tests

▶

example1
example test 1

✔

0.001 s

▶

example2
example test 2

✔

0.001 s

Code: 13:21:04 UTC, c, 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

// you can write to stdout for debugging purposes, e.g.
int is(char s[],int i,int j)
{
    int h[150]={0},t,c;
    for(t=i;t<=j;t++)
    {
        c=(s[t]);
    h[c]++;
    }
    for(t=i;t<=j;t++)
    {
        c=s[t];
        if(h[c]%2!=0)
        return 0;
    }
    return 1;
}
int solution(char *s) {
    // write your code in C99 (gcc 6.2.0)
    int n,i,j,m=0,k=0;
    n=strlen(s);
    for(i=0;i<n-1;i++)
    {
        for(j=i+1;j<n;j++)
        {
            if(is(s,i,j))
            m=j-i+1;
            if(m>k)
            k=m;
        }
    }
    return k;
}

Analysis

expand all Example tests

▶

example1
example test 1

✔

0.001 s

▶

example2
example test 2

✔

0.001 s

expand all User tests

▶

test_data1

✘

RUNTIME ERROR
invalid input, unexpected 'kkkkkkk', expecting string

0.001 s

RUNTIME ERROR, invalid input, unexpected 'kkkkkkk', expecting string

User test case 1:

kkkkkkk

Code: 13:21:14 UTC, c, 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

// you can write to stdout for debugging purposes, e.g.
int is(char s[],int i,int j)
{
    int h[150]={0},t,c;
    for(t=i;t<=j;t++)
    {
        c=(s[t]);
    h[c]++;
    }
    for(t=i;t<=j;t++)
    {
        c=s[t];
        if(h[c]%2!=0)
        return 0;
    }
    return 1;
}
int solution(char *s) {
    // write your code in C99 (gcc 6.2.0)
    int n,i,j,m=0,k=0;
    n=strlen(s);
    for(i=0;i<n-1;i++)
    {
        for(j=i+1;j<n;j++)
        {
            if(is(s,i,j))
            m=j-i+1;
            if(m>k)
            k=m;
        }
    }
    return k;
}

Analysis

expand all Example tests

▶

example1
example test 1

✔

0.001 s

▶

example2
example test 2

✔

0.001 s

Code: 13:24:06 UTC, c, autosave

show code in pop-up

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

// you can write to stdout for debugging purposes, e.g.
int is(char s[],int i,int j)
{
    int h[150]={0},t,c;
    for(t=i;t<=j;t++)
    {
        c=(s[t]);
        h[c]++;
    }
    for(t=i;t<=j;t++)
    {
        c=s[t];
        if(h[c]%2!=0)
        return 0;
    }
    return 1;
}
int solution(char *s) {
    // write your code in C99 (gcc 6.2.0)
    int n,i,j,m=0,k=0;
    n=strlen(s);
    for(i=0;i<n-1;i++)
    {
        for(j=i+1;j<n;j++)
        {
            if(is(s,i,j))
            m=j-i+1;
            if(m>k)
            k=m;
        }
    }
    return k;
}

Code: 13:25:08 UTC, c, autosave

show code in pop-up

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

// you can write to stdout for debugging purposes, e.g.
int is(char s[],int i,int j)
{
    int a[150]={0},t,c;
    for(t=i;t<=j;t++)
    {
        c=(s[t]);
        h[c]++;
    }
    for(t=i;t<=j;t++)
    {
        c=s[t];
        if(h[c]%2!=0)
        return 0;
    }
    return 1;
}
int solution(char *s) {
    // write your code in C99 (gcc 6.2.0)
    int n,i,j,m=0,k=0;
    n=strlen(s);
    for(i=0;i<n-1;i++)
    {
        for(j=i+1;j<n;j++)
        {
            if(is(s,i,j))
            m=j-i+1;
            if(m>k)
            k=m;
        }
    }
    return k;
}

Code: 13:26:23 UTC, c, autosave

show code in pop-up

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

// you can write to stdout for debugging purposes, e.g.
int is(char s[],int i,int j)
{
    int a[150]={0},k,c;
    for(k=i;k<=j;k++)
    {
        c=(s[k]);
        a[c]++;
    }
    for(k=i;k<=j;k++)
    {
        c=s[k];
        if(a[c]%2!=0)
        return 0;
    }
    return 1;
}
int solution(char *s) {
    // write your code in C99 (gcc 6.2.0)
    int n,i,j,m=0,k=0;
    n=strlen(s);
    for(i=0;i<n-1;i++)
    {
        for(j=i+1;j<n;j++)
        {
            if(is(s,i,j))
            m=j-i+1;
            if(m>k)
            k=m;
        }
    }
    return k;
}

Code: 13:26:24 UTC, c, 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

// you can write to stdout for debugging purposes, e.g.
int is(char s[],int i,int j)
{
    int a[150]={0},k,c;
    for(k=i;k<=j;k++)
    {
        c=(s[k]);
        a[c]++;
    }
    for(k=i;k<=j;k++)
    {
        c=s[k];
        if(a[c]%2!=0)
        return 0;
    }
    return 1;
}
int solution(char *s) {
    // write your code in C99 (gcc 6.2.0)
    int n,i,j,m=0,k=0;
    n=strlen(s);
    for(i=0;i<n-1;i++)
    {
        for(j=i+1;j<n;j++)
        {
            if(is(s,i,j))
            m=j-i+1;
            if(m>k)
            k=m;
        }
    }
    return k;
}

Analysis

expand all Example tests

▶

example1
example test 1

✔

0.001 s

▶

example2
example test 2

✔

0.001 s

Code: 13:31:30 UTC, c, autosave

show code in pop-up

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

// you can write to stdout for debugging purposes, e.g.
int is(char s[],int i,int j)
{
    int a[150]={0},k,c;
    for(k=i;k<=j;k++)
    {
        c=(s[k]);
        a[c]++;
    }
    for(k=i;k<=j;k++)
    {
        c=s[k];
        if(a[c]%2!=0)
        return 0;
    }
    return 1;
}
int solution(char *s) {
    // write your code in C99 (gcc 6.2.0)
    int n,i,j,m=0,k=0;
    n=strlen(s);
    for(i=0;i<n-1;i++)
    {
        for(j=i+1;j<n;j++)
        {
            if(c(s,i,j))
            m=j-i+1;
            if(m>k)
            k=m;
        }
    }
    return k;
}

Code: 13:31:42 UTC, c, 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

// you can write to stdout for debugging purposes, e.g.
int check(char s[],int i,int j)
{
    int a[150]={0},k,c;
    for(k=i;k<=j;k++)
    {
        c=(s[k]);
        a[c]++;
    }
    for(k=i;k<=j;k++)
    {
        c=s[k];
        if(a[c]%2!=0)
        return 0;
    }
    return 1;
}
int solution(char *s) {
    // write your code in C99 (gcc 6.2.0)
    int n,i,j,m=0,k=0;
    n=strlen(s);
    for(i=0;i<n-1;i++)
    {
        for(j=i+1;j<n;j++)
        {
            if(check(s,i,j))
            m=j-i+1;
            if(m>k)
            k=m;
        }
    }
    return k;
}

Analysis

expand all Example tests

▶

example1
example test 1

✔

0.001 s

▶

example2
example test 2

✔

0.001 s

Code: 13:45:44 UTC, c, autosave

show code in pop-up

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

// you can write to stdout for debugging purposes, e.g.
int check(char s[],int i,int j)
{
    int a[150]={0},k,c;
    for(k=i;k<=j;k++)
    {
        c=(s[k]);
        a[c]++;
    }
    for(k=i;k<=j;k++)
    {
        c=s[k];
        if(a[c]%2!=0)
        return 0;
    }
    return 1;
}
int solution(char *s) { int n,i;
//scanf("%d",&n);
//char a[200];



n=strlen(S);
int check(int b[])
{
	int i;
	for(i=0;i<200;i++)
	{
		if(b[i]%2!=0)
		return 0;
	}
	return 1;
}
int max=0,j,count,h;
for(i=0;i<n;i++)

{
	count=0;
int b[200]={0};
	for(j=i;j<n;j++)
	{
		
		count++;
		b[S[j]-'0']++;

		if(check(b)==1)
		{
			if(count>max)
			max=count;
			
		}
	}
	
}



return max; 

}

Code: 13:46:09 UTC, c, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52

// you can write to stdout for debugging purposes, e.g.
int check(char s[],int i,int j)
{
    int a[150]={0},k,c;
    for(k=i;k<=j;k++)
    {
        c=(s[k]);
        a[c]++;
    }
    for(k=i;k<=j;k++)
    {
        c=s[k];
        if(a[c]%2!=0)
        return 0;
    }
    return 1;
}
int solution(char *s) { int n,i;
//scanf("%d",&n);
//char a[200];



n=strlen(S);
int check(int b[])
{
	int i;
	for(i=0;i<200;i++)
	{
		if(b[i]%2!=0)
		return 0;
	}
	return 1;
}
int max=0,j,count,h;
for(i=0;i<n;i++)
{
	count=0;
int b[200]={0};
	for(j=i;j<n;j++)
	{
		count++;
		b[S[j]-'0']++;
		if(check(b)==1)
		{
			if(count>max)
			max=count;
		}
	}
}
return max;
}

Code: 13:46:39 UTC, c, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48

// you can write to stdout for debugging purposes, e.g.
int check(char s[],int i,int j)
{
    int a[150]={0},k,c;
    for(k=i;k<=j;k++)
    {
        c=(s[k]);
        a[c]++;
    }
    for(k=i;k<=j;k++)
    {
        c=s[k];
        if(a[c]%2!=0)
        return 0;
    }
    return 1;
}
int solution(char *s){
int n,i;
n=strlen(S);
int check(int b[])
{
	int i;
	for(i=0;i<200;i++)
	{
		if(b[i]%2!=0)
		return 0;
	}
	return 1;
}
int max=0,j,count,h;
for(i=0;i<n;i++)
{
	count=0;
int b[200]={0};
	for(j=i;j<n;j++)
	{
		count++;
		b[S[j]-'0']++;
		if(check(b)==1)
		{
			if(count>max)
			max=count;
		}
	}
}
return max;
}

Code: 13:46:49 UTC, c, autosave

show code in pop-up

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

int solution(char *s){
int n,i;
n=strlen(S);
int check(int b[])
{
	int i;
	for(i=0;i<200;i++)
	{
		if(b[i]%2!=0)
		return 0;
	}
	return 1;
}
int max=0,j,count,h;
for(i=0;i<n;i++)
{
	count=0;
int b[200]={0};
	for(j=i;j<n;j++)
	{
		count++;
		b[S[j]-'0']++;
		if(check(b)==1)
		{
			if(count>max)
			max=count;
		}
	}
}
return max;
}

Code: 13:46:59 UTC, c, autosave

show code in pop-up

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

int solution(char *s){
int m,i;
m=strlen(S);
int check(int b[])
{
	int i;
	for(i=0;i<200;i++)
	{
		if(b[i]%2!=0)
		return 0;
	}
	return 1;
}
int max=0,j,count,h;
for(i=0;i<n;i++)
{
	count=0;
int b[200]={0};
	for(j=i;j<n;j++)
	{
		count++;
		b[S[j]-'0']++;
		if(check(b)==1)
		{
			if(count>max)
			max=count;
		}
	}
}
return max;
}

Code: 13:48:01 UTC, c, autosave

show code in pop-up

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

int solution(char *s){
int m,i;
m=strlen(S);
int check(int b[])
{
	int i;
	for(i=0;i<200;i++)
	{
		if(b[i]%2!=0)
		return 0;
	}
	return 1;
}
int max=0,j,count,h;
for(i=0;i<;i++)
{
	count=0;
int b[200]={0};
	for(j=i;j<n;j++)
	{
		count++;
		b[S[j]-'0']++;
		if(check(b)==1)
		{
			if(count>max)
			max=count;
		}
	}
}
return max;
}

Code: 13:48:12 UTC, c, autosave

show code in pop-up

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

int solution(char *s){
int m,i;
m=strlen(S);
int check(int b[])
{
	int i;
	for(i=0;i<200;i++)
	{
		if(b[i]%2!=0)
		return 0;
	}
	return 1;
}
int max=0,j,count,h;
for(i=0;i<m;i++)
{
	count=0;
int b[200]={0};
	for(j=i;j<m;j++)
	{
		count++;
		b[S[j]-'0']++;
		if(check(b)==1)
		{
			if(count>max)
			max=count;
		}
	}
}
return max;
}

Code: 13:48:24 UTC, c, autosave

show code in pop-up

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

int solution(char *s){
int m,i;
m=strlen(S);
int check(int b[])
{
	int i;
	for(i=0;i<200;i++)
	{
		if(b[i]%2!=0)
		return 0;
	}
	return 1;
}
int max=0,j,c,h;
for(i=0;i<m;i++)
{
	c=0;
int b[200]={0};
	for(j=i;j<m;j++)
	{
		count++;
		b[S[j]-'0']++;
		if(check(b)==1)
		{
			if(count>max)
			max=count;
		}
	}
}
return max;
}

Code: 13:48:36 UTC, c, autosave

show code in pop-up

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

int solution(char *s){
int m,i;
m=strlen(S);
int check(int b[])
{
	int i;
	for(i=0;i<200;i++)
	{
		if(b[i]%2!=0)
		return 0;
	}
	return 1;
}
int ma=0,j,c,h;
for(i=0;i<m;i++)
{
	c=0;
int b[200]={0};
	for(j=i;j<m;j++)
	{
		c++;
		b[S[j]-'0']++;
		if(check(b)==1)
		{
			if(count>max)
			max=count;
		}
	}
}
return max;
}

Code: 13:48:49 UTC, c, autosave

show code in pop-up

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

int solution(char *s){
int m,i;
m=strlen(S);
int check(int b[])
{
	int i;
	for(i=0;i<200;i++)
	{
		if(b[i]%2!=0)
		return 0;
	}
	return 1;
}
int ma=0,j,c,h;
for(i=0;i<m;i++)
{
	c=0;
int b[200]={0};
	for(j=i;j<m;j++)
	{
		c++;
		b[S[j]-'0']++;
		if(check(b)==1)
		{
			if(c>ma)
			max=count;
		}
	}
}
return max;
}

Code: 13:49:00 UTC, c, autosave

show code in pop-up

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

int solution(char *s){
int m,i;
m=strlen(S);
int check(int b[])
{
	int i;
	for(i=0;i<200;i++)
	{
		if(b[i]%2!=0)
		return 0;
	}
	return 1;
}
int ma=0,j,c,h;
for(i=0;i<m;i++)
{
	c=0;
int b[200]={0};
	for(j=i;j<m;j++)
	{
		c++;
		b[S[j]-'0']++;
		if(check(b)==1)
		{
			if(c>ma)
			ma=c;
		}
	}
}
return ma;
}

Code: 13:49:18 UTC, c, autosave

show code in pop-up

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

int solution(char *s){
int m,i;
m=strlen(S);
int check(int b[])
{
	int i;
	for(i=0;i<200;i++)
	{
		if(b[i]%2!=0)
		return 0;
	}
	return 1;
}
int ma=0,j,c,h;
for(i=0;i<m;i++)
{
	c=0;
int d[200]={0};
	for(j=i;j<m;j++)
	{
		c++;
		b[S[j]-'0']++;
		if(check(b)==1)
		{
			if(c>ma)
			ma=c;
		}
	}
}
return ma;
}

Code: 13:49:30 UTC, c, autosave

show code in pop-up

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

int solution(char *s){
int m,i;
m=strlen(S);
int check(int d[])
{
	int i;
	for(i=0;i<200;i++)
	{
		if(b[i]%2!=0)
		return 0;
	}
	return 1;
}
int ma=0,j,c,h;
for(i=0;i<m;i++)
{
	c=0;
int d[200]={0};
	for(j=i;j<m;j++)
	{
		c++;
		d[S[j]-'0']++;
		if(check(d)==1)
		{
			if(c>ma)
			ma=c;
		}
	}
}
return ma;
}

Code: 13:53:33 UTC, c, autosave

show code in pop-up

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

int solution(char *s){
int m,i;
m=strlen(S);
int check(int d[])
{
	int i;
	for(i=0;i<200;i++)
	{
		if([i]%2!=0)
		return 0;
	}
	return 1;
}
int ma=0,j,c,h;
for(i=0;i<m;i++)
{
	c=0;
int d[200]={0};
	for(j=i;j<m;j++)
	{
		c++;
		d[S[j]-'0']++;
		if(check(d)==1)
		{
			if(c>ma)
			ma=c;
		}
	}
}
return ma;
}

Code: 13:53:46 UTC, c, autosave

show code in pop-up

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

int solution(char *s){
int m,i;
m=strlen(S);
int check(int d[])
{
	int i;
	for(i=0;i<200;i++)
	{
		if(d[i]%2!=0)
		return 0;
	}
	return 1;
}
int ma=0,j,c,h;
for(i=0;i<m;i++)
{
	c=0;
int d[200]={0};
	for(j=i;j<m;j++)
	{
		c++;
		d[S[j]-'0']++;
		if(ch(d)==1)
		{
			if(c>ma)
			ma=c;
		}
	}
}
return ma;
}

Code: 13:53:57 UTC, c, autosave

show code in pop-up

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

int solution(char *s){
int m,i;
m=strlen(S);
int ch(int d[])
{
	int i;
	for(i=0;i<200;i++)
	{
		if(d[i]%2!=0)
		return 0;
	}
	return 1;
}
int ma=0,j,c,h;
for(i=0;i<m;i++)
{
	c=0;
int d[200]={0};
	for(j=i;j<m;j++)
	{
		c++;
		d[S[j]-'0']++;
		if(ch(d)==1)
		{
			if(c>ma)
			ma=c;
		}
	}
}
return ma;
}

Code: 13:54:13 UTC, c, autosave

show code in pop-up

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

int solution(char *s){
int m,k;
m=strlen(S);
int ch(int d[])
{
	int k;
	for(k=0;k<200;i++)
	{
		if(d[i]%2!=0)
		return 0;
	}
	return 1;
}
int ma=0,j,c,h;
for(i=0;i<m;i++)
{
	c=0;
int d[200]={0};
	for(j=i;j<m;j++)
	{
		c++;
		d[S[j]-'0']++;
		if(ch(d)==1)
		{
			if(c>ma)
			ma=c;
		}
	}
}
return ma;
}

Code: 13:54:29 UTC, c, autosave

show code in pop-up

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

int solution(char *s){
int m,k;
m=strlen(S);
int ch(int d[])
{
	int k;
	for(k=0;k<200;i++)
	{
		if(d[k]%2!=0)
		return 0;
	}
	return 1;
}
int ma=0,j,c,h;
for(k=0;k<m;k++)
{
	c=0;
int d[200]={0};
	for(j=i;j<m;j++)
	{
		c++;
		d[S[j]-'0']++;
		if(ch(d)==1)
		{
			if(c>ma)
			ma=c;
		}
	}
}
return ma;
}

Code: 13:54:40 UTC, c, autosave

show code in pop-up

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

int solution(char *s){
int m,k;
m=strlen(S);
int ch(int d[])
{
	int k;
	for(k=0;k<200;k++)
	{
		if(d[k]%2!=0)
		return 0;
	}
	return 1;
}
int ma=0,j,c,h;
for(k=0;k<m;k++)
{
	c=0;
int d[200]={0};
	for(j=k;j<m;j++)
	{
		c++;
		d[S[j]-'0']++;
		if(ch(d)==1)
		{
			if(c>ma)
			ma=c;
		}
	}
}
return ma;
}

Code: 13:54:51 UTC, c, autosave

show code in pop-up

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

int solution(char *s){
int m,k;
m=strlen(S);
int ch(int d[])
{
	int k;
	for(k=0;k<200;k++)
	{
		if(d[k]%2!=0)
		return 0;
	}
	return 1;
}
int ma=0,l,c,h;
for(k=0;k<m;k++)
{
	c=0;
int d[200]={0};
	for(j=k;j<m;j++)
	{
		c++;
		d[S[j]-'0']++;
		if(ch(d)==1)
		{
			if(c>ma)
			ma=c;
		}
	}
}
return ma;
}

Code: 13:55:04 UTC, c, autosave

show code in pop-up

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

int solution(char *s){
int m,k;
m=strlen(S);
int ch(int d[])
{
	int k;
	for(k=0;k<200;k++)
	{
		if(d[k]%2!=0)
		return 0;
	}
	return 1;
}
int ma=0,l,c,h;
for(k=0;k<m;k++)
{
	c=0;
int d[200]={0};
	for(l=k;l<m;l++)
	{
		c++;
		d[S[j]-'0']++;
		if(ch(d)==1)
		{
			if(c>ma)
			ma=c;
		}
	}
}
return ma;
}

Code: 13:55:14 UTC, c, autosave

show code in pop-up

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

int solution(char *s){
int m,k;
m=strlen(S);
int ch(int d[])
{
	int k;
	for(k=0;k<200;k++)
	{
		if(d[k]%2!=0)
		return 0;
	}
	return 1;
}
int ma=0,l,c,h;
for(k=0;k<m;k++)
{
	c=0;
int d[200]={0};
	for(l=k;l<m;l++)
	{
		c++;
		d[S[l]-'0']++;
		if(ch(d)==1)
		{
			if(c>ma)
			ma=c;
		}
	}
}
return ma;
}

Code: 13:55:16 UTC, c, 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

int solution(char *s){
int m,k;
m=strlen(S);
int ch(int d[])
{
	int k;
	for(k=0;k<200;k++)
	{
		if(d[k]%2!=0)
		return 0;
	}
	return 1;
}
int ma=0,l,c,h;
for(k=0;k<m;k++)
{
	c=0;
int d[200]={0};
	for(l=k;l<m;l++)
	{
		c++;
		d[S[l]-'0']++;
		if(ch(d)==1)
		{
			if(c>ma)
			ma=c;
		}
	}
}
return ma;
}

Analysis

Compile error

func.c: In function 'solution':
func.c:3:10: error: 'S' undeclared (first use in this function)
 m=strlen(S);
          ^
func.c:3:10: note: each undeclared identifier is reported only once for each function it appears in
func.c:14:14: warning: unused variable 'h' [-Wunused-variable]
 int ma=0,l,c,h;
              ^

Code: 13:56:55 UTC, c, autosave

show code in pop-up

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

int solution(char *s){
int m,k;
m=strlen(s);
int ch(int d[])
{
	int k;
	for(k=0;k<200;k++)
	{
		if(d[k]%2!=0)
		return 0;
	}
	return 1;
}
int ma=0,l,c,h;
for(k=0;k<m;k++)
{
	c=0;
int d[200]={0};
	for(l=k;l<m;l++)
	{
		c++;
		d[s[l]-'0']++;
		if(ch(d)==1)
		{
			if(c>ma)
			ma=c;
		}
	}
}
return ma;
}

Code: 13:57:01 UTC, c, 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

int solution(char *s){
int m,k;
m=strlen(s);
int ch(int d[])
{
	int k;
	for(k=0;k<200;k++)
	{
		if(d[k]%2!=0)
		return 0;
	}
	return 1;
}
int ma=0,l,c,h;
for(k=0;k<m;k++)
{
	c=0;
int d[200]={0};
	for(l=k;l<m;l++)
	{
		c++;
		d[s[l]-'0']++;
		if(ch(d)==1)
		{
			if(c>ma)
			ma=c;
		}
	}
}
return ma;
}

Analysis

expand all Example tests

▶

example1
example test 1

✔

0.001 s

▶

example2
example test 2

✔

0.001 s

Code: 13:57:13 UTC, c, 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

int solution(char *s){
int m,k;
m=strlen(s);
int ch(int d[])
{
	int k;
	for(k=0;k<200;k++)
	{
		if(d[k]%2!=0)
		return 0;
	}
	return 1;
}
int ma=0,l,c;
for(k=0;k<m;k++)
{
	c=0;
int d[200]={0};
	for(l=k;l<m;l++)
	{
		c++;
		d[s[l]-'0']++;
		if(ch(d)==1)
		{
			if(c>ma)
			ma=c;
		}
	}
}
return ma;
}

Analysis

expand all Example tests

▶

example1
example test 1

✔

0.001 s

▶

example2
example test 2

✔

0.001 s

Code: 13:57:27 UTC, c, autosave

show code in pop-up

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

int solution(char *s){
int m,k;
m=strlen(s);
int ch(int d[])
{
	int k;
	for(k=0;k<2;k++)
	{
		if(d[k]%2!=0)
		return 0;
	}
	return 1;
}
int ma=0,l,c;
for(k=0;k<m;k++)
{
	c=0;
int d[200]={0};
	for(l=k;l<m;l++)
	{
		c++;
		d[s[l]-'0']++;
		if(ch(d)==1)
		{
			if(c>ma)
			ma=c;
		}
	}
}
return ma;
}

Code: 13:57:42 UTC, c, autosave

show code in pop-up

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

int solution(char *s){
int m,k;
m=strlen(s);
int ch(int d[])
{
	int k;
	for(k=0;k<50;k++)
	{
		if(d[k]%2!=0)
		return 0;
	}
	return 1;
}
int ma=0,l,c;
for(k=0;k<m;k++)
{
	c=0;
int d[200]={0};
	for(l=k;l<m;l++)
	{
		c++;
		d[s[l]-'0']++;
		if(ch(d)==1)
		{
			if(c>ma)
			ma=c;
		}
	}
}
return ma;
}

Code: 13:57:53 UTC, c, autosave

show code in pop-up

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

int solution(char *s){
int m,k;
m=strlen(s);
int ch(int d[])
{
	int k;
	for(k=0;k<50;k++)
	{
		if(d[k]%2!=0)
		return 0;
	}
	return 1;
}
int ma=0,l,c;
for(k=0;k<m;k++)
{
	c=0;
int d[50]={0};
	for(l=k;l<m;l++)
	{
		c++;
		d[s[l]-'0']++;
		if(ch(d)==1)
		{
			if(c>ma)
			ma=c;
		}
	}
}
return ma;
}

Code: 13:57:54 UTC, c, 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

int solution(char *s){
int m,k;
m=strlen(s);
int ch(int d[])
{
	int k;
	for(k=0;k<50;k++)
	{
		if(d[k]%2!=0)
		return 0;
	}
	return 1;
}
int ma=0,l,c;
for(k=0;k<m;k++)
{
	c=0;
int d[50]={0};
	for(l=k;l<m;l++)
	{
		c++;
		d[s[l]-'0']++;
		if(ch(d)==1)
		{
			if(c>ma)
			ma=c;
		}
	}
}
return ma;
}

Analysis

expand all Example tests

▶

example1
example test 1

✘

WRONG ANSWER
got 9 expected 8

0.001 s

WRONG ANSWER, got 9 expected 8

▶

example2
example test 2

✘

WRONG ANSWER
got 4 expected 0

0.001 s

WRONG ANSWER, got 4 expected 0

Code: 13:58:16 UTC, c, 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

int solution(char *s){
int m,k;
m=strlen(s);
int ch(int d[])
{
	int k;
	for(k=0;k<100;k++)
	{
		if(d[k]%2!=0)
		return 0;
	}
	return 1;
}
int ma=0,l,c;
for(k=0;k<m;k++)
{
	c=0;
int d[100]={0};
	for(l=k;l<m;l++)
	{
		c++;
		d[s[l]-'0']++;
		if(ch(d)==1)
		{
			if(c>ma)
			ma=c;
		}
	}
}
return ma;
}

Analysis

expand all Example tests

▶

example1
example test 1

✔

0.001 s

▶

example2
example test 2

✔

0.001 s

Code: 13:58:32 UTC, c, autosave

show code in pop-up

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

int solution(char *s){
int m,k;
m=strlen(s);
int ch(int d[])
{
	int k;
	for(k=0;k<100;k++)
	{
		if(d[k]%2!=0)
		return 0;
	}
	return 1;
}
int ma=0,l,c;
for(k=0;k<m;k++)
{
	c=0;
int d[100]={0};
	for(l=k;l<m;l++)
	{
		c++;
		d[s[l]-'0']++;
		if(ch(d)==1)
		{
			if(c>ma)
			ma=c;
		}
	}
}
return ma;
}

Code: 13:58:41 UTC, c, autosave

show code in pop-up

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

int solution(char *s){
int m,k;
m=strlen(s);
int ch(int d[])
{
	int k;
	for(k=0;k<100;k++)
	{
		if(d[k]%2!=0)
		return 0;
	}
	return 1;
}
int ma=0,l,c;
for(k=0;k<m;k++)
{
	c=0;
int d[100]={0};
	for(l=k;l<m;l++)
	{
		c++;
		d[s[l]-'0']++;
		if(ch(d)==1)
		{
			if(c>ma)
			ma=c;
		}
	}
}
return ma;
}

Code: 13:58:45 UTC, c, 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

int solution(char *s){
int m,k;
m=strlen(s);
int ch(int d[])
{
	int k;
	for(k=0;k<100;k++)
	{
		if(d[k]%2!=0)
		return 0;
	}
	return 1;
}
int ma=0,l,c;
for(k=0;k<m;k++)
{
	c=0;
int d[100]={0};
	for(l=k;l<m;l++)
	{
		c++;
		d[s[l]-'0']++;
		if(ch(d)==1)
		{
			if(c>ma)
			ma=c;
		}
	}
}
return ma;
}

Analysis

expand all Example tests

▶

example1
example test 1

✔

0.001 s

▶

example2
example test 2

✔

0.001 s

Code: 13:59:29 UTC, c, 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

int solution(char *s){
int m,k;
m=strlen(s);
int ch(int d[])
{
	int k;
	for(k=0;k<100;k++)
	{
		if(d[k]%2!=0)
		return 0;
	}
	return 1;
}
int ma=0,l,c;
for(k=0;k<m;k++)
{
	c=0;
int d[100]={0};
	for(l=k;l<m;l++)
	{
		c++;
		d[s[l]-'0']++;
		if(ch(d)==1)
		{
			if(c>ma)
			ma=c;
		}
	}
}
return ma;
}

Analysis

expand all Example tests

▶

example1
example test 1

✔

0.001 s

▶

example2
example test 2

✔

0.001 s

Code: 13:59:32 UTC, c, final, score: 62

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

int solution(char *s){
int m,k;
m=strlen(s);
int ch(int d[])
{
	int k;
	for(k=0;k<100;k++)
	{
		if(d[k]%2!=0)
		return 0;
	}
	return 1;
}
int ma=0,l,c;
for(k=0;k<m;k++)
{
	c=0;
int d[100]={0};
	for(l=k;l<m;l++)
	{
		c++;
		d[s[l]-'0']++;
		if(ch(d)==1)
		{
			if(c>ma)
			ma=c;
		}
	}
}
return ma;
}

Analysis summary

The following issues have been detected: timeout errors.

Analysis

Detected time complexity:

O(N**2)

expand all Example tests

▶

example1
example test 1

✔

0.001 s

▶

example2
example test 2

✔

0.001 s

expand all Correctness tests

▶

three
N <= 3

✔

0.001 s

▶

two_distinct
at most two distinct characters, N <= 100

✔

0.001 s

expand all Correctness/performance tests

▶

all_letters
all 26 letters in substring, N <= 130

✔

0.001 s

▶

random
random strings, all characters, N <= 130

✔

0.001 s

expand all Performance tests

▶

random2
random strings, all characters, N <= 500

✔

0.001 s

▶

long_blocks
long blocks of same letters, N <= 100,000

✘

TIMEOUT ERROR
running time: >6.00 sec., time limit: 0.10 sec.

6.000 s