#include <stdio.h>
int is_alternating_pattern(int *mem, int k) {
// Write your pointer logic here
int *p = mem;
for(int i = 1; i<k-1; i++)
{
if(*(p+i)==*(p+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
assign the starting address of the array to a pointer
iterate a loop from i=1 to i=k-1
at each step compare *(p+1) == *(p+i-1) if equal chain breaks then return 0