All submissions

Detect Alternating Pattern

Code

#include <stdio.h>

int is_alternating_pattern(int *mem, int k) {
    // Write your pointer logic here
    //int n1=sizeof(mem)/sizeof(*(mem));
    //printf("%d ",n1);
    int a=0,b=0;
    for(int j=0;j<k-1;j++){
            if((*(mem+j)==0&&*(mem+j+1)==1)||(*(mem+j)==1&&*(mem+j+1)==0)){
                a=1;
                if(j==k-2){
                    b=1;
                    break;
                }
            }
            else{
                break;
            }
        }
    return b;
}

int main() {
    int n, k, arr[100];
    scanf("%d %d", &n, &k);

    for (int i = 0; i < n; i++) {
        scanf("%d", &arr[i]);
    }

    int res = is_alternating_pattern(arr, k);
    printf("%d", res);

    return 0;
}

Solving Approach

 

 

 

Loading...

Input

6 6 1 0 1 0 1 0

Expected Output

1