#include <stdio.h> int find_pattern(int *mem, int n) { // Write your pointer-based logic here int strt = 0; for(int i = 1;i<n;i++){ if(*(mem+i)-*(mem+strt) == (i-strt)){ if((i-strt) == 2){ return strt; } }else{ strt = 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; }
Test Cases
Test Results
Input
8 2 4 5 6 9 11 12 14
Expected Output
1