1
#include <stdio.h>
2
int main() {
3
    int n;
4
    printf("Enter the number of elements");
5
    scanf("%d", &n);
6
    int arr[n];
7
    printf("Enter %d elements\n", n);
8
    for (int i = 0; i < n; i++) {
9
        scanf("%d", &arr[i]);
10
    }
11
    int diff = arr[1] - arr[0];
12
    int isAP = 1;
13
    for (int i = 1; i < n - 1; i++) {
14
        if (arr[i + 1] - arr[i] != diff) {
15
            isAP = 0;
16
            break;
17
        }
18
    }
19
    if (isAP) {
20
        printf(" in AP\n");
21
    } else {
22
        printf("elements are NOT in AP\n");
23
    }
24
    return 0;
25
}
26
 
27
#include <stdio.h>
28
int main() {
29
    int n, i, diff, missingTerm;
30
    printf("Enter the number of element");
31
    scanf("%d", &n);
32
    int arr[n];
33
    printf("Enter the elements");
34
    for(i = 0; i < n; i++) {
35
        scanf("%d", &arr[i]);
36
    }
37
    diff = (arr[n-1] - arr[0]) / n;
38
    for(i = 0; i < n - 1; i++) {
39
        if(arr[i+1] - arr[i] != diff) {
40
            missingTerm = arr[i] + diff;
41
            break;
42
        }
43
    }
44
    printf(" missing term is %d\n", missingTerm);
45
    return 0;
46
}
47
 
48
#include <stdio.h>
49
int main() {
50
    int size;
51
    printf("enter no of element ");
52
    scanf("%d",&size);
53
    int arr[size];
54
    printf("enter the elements");
55
    for(int i=0;i<size;i++)
56
    {
57
      scanf("%d",&arr[i]);
58
    }
59
    int i, j = 0, k = size - 1;
60
    for(i = 0; i < size; i++) {
61
        if(arr[i] < 0) {
62
            if(i != j) {
63
                arr[i] = arr[j];
64
                arr[j] = -1;
65
            }
66
            j++;
67
        }
68
    }
69
    for(i = 0; i < size; i++) {
70
        if(arr[i] == 0) {
71
            k--;
72
        }
73
    }
74
    for(i=0;i<size;i++)
75
    {
76
      printf("%d",arr[i]);
77
    }
78
    return 0;
79
}