#include <stdio.h>
int find_pattern(int *mem, int n) {
// Write your pointer-based logic here
int i;
for(i = 0; i<n-3 ; i++){
if(*(mem+i)+2 == *(mem+i+2))
return i;
}
return -1;
}
int main() {
int n, arr[100];
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", &arr[i]);
}
int res = find_pattern(arr, n);
printf("%d", res);
return 0;
}
Solving Approach
iterate through all elements until n-2 , search for value and value +2 at index i and i+2 respectively.