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