#include <stdio.h> #include <math.h> int find_pattern(int *mem, int n) { int count = 0; int index = 0; for(int* p = mem + 1; p <= (mem + (n - 1)); p++){ if((*p - *(p - 1)) == 1){ count++; if(count == 2){ return index-1; } index++; continue; } count = 0; index++; } 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