All submissions

Detect Alternating Pattern

Code

#include <stdio.h>

int is_alternating_pattern(int *mem, int k, int n) {
    // Write your pointer logic here
    for(int i=0; i<n; i++) {
        int tmp = *(mem+i);
        bool flag = true;
        if((i+k) > n) return 0;
        for(int j=i+1; j<i+k; j++) {
            if(tmp != *(mem+j)) {
                tmp = *(mem+j);
            } else {
                flag = false;
                break;
            }
        }
        if(flag) return 1;
    }
    return 0;
}

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, n);
    printf("%d", res);

    return 0;
}

Solving Approach

 

 

 

Loading...

Input

6 6 1 0 1 0 1 0

Expected Output

1