Scan Memory for Three Consecutive Increasing Values

Code

#include <stdio.h>

int find_pattern(int *mem, int n) {
    // Write your pointer-based logic here
    for(int i = 0; i < n - 2; i++ ){
        int *p = mem + i;
    
    if( *(p+1) == *p + 1 && *(p + 1) + 1){
        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;
}

Solving Approach

• Use a loop from 0 to n-3 (because we need 3 elements at once).
• Use pointer p = mem + i to point at each element.

• Check:

  *(p + 1) == *p + 1   // next number is +1 *(p + 2) == *(p + 1) + 1   // next-to-next number is also +1 

• If both are true → return current index i.
• If loop ends → return -1.