#include <stdio.h> int find_pattern(int *mem, int n) { // Write your pointer-based logic here int index =0,first_data,second_data,third_data; for(int i=0; i<n-2; i++) { first_data = *(mem+i); second_data = *(mem+i+1); third_data = *(mem+i+2); // printf("i=%d, first_data=%d, second_data=%d, third_data=%d, \n",i,first_data,second_data,third_data); if((first_data==second_data-1)&&(second_data==third_data-1)) { // printf("index value i=%d \n", i); 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; }
Test Cases
Test Results
Input
8 2 4 5 6 9 11 12 14
Expected Output
1