#include <stdio.h> int find_pattern(int *mem, int n) { // Write your pointer-based logic here int start_index; if(mem == NULL) return -1; else if(n < 3) { return -1; } else { for(int i = 2; i < n; i++) { if(((*(mem + i) - *(mem + (i - 1))) == 1) && (*(mem + (i - 1)) - *(mem + (i - 2)) == 1)) { start_index = i-2; return start_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