#include <stdio.h>
int is_alternating_pattern(int *mem, int k) {
for(int i = 1 ; i < k ; i++){
if(*( mem + i ) == *( mem + i - 1 )){
return 0;
}
}
return 1;
}
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
Take first element as your starting point → *mem
Loop from second element (i = 1) to k - 1
For every element:
Compare it with the previous element using pointer arithmetic → *(mem + i) and *(mem + i - 1)
If both are same, pattern is broken → return 0
If loop completes, return 1 (means pattern is alternating)