Ive solved this problem but im being marked down though im getting the right output

#include <stdio.h>
int main() 
{
	int t, i, j;
    scanf("%d",&t);
	
	while(t--)
	{
	    int N;
	    scanf("%d",&N);
	    int A[N];
	    for(i=0; i < N; i++)
	    {
	        scanf("%d",&A[i]);
	    }
	    
	    int num_frames = N;
	    
	    for (i = 0;  i < N - 1; i++)
	    {
	        if (A[i] == A[i - 1] || A[i] == A[i + 1])
	        {
	            for (j = 0; j < N - 1; j++)
	            {
	                A[j] = A[j + 1];
	            }
	            N--;
	            i--;
	            num_frames--;
	            }
	        }
	        printf("%d\n", num_frames);
	    }
	    return (0);
}

output
1
1
3
3
please i neeed help. the code is in C

Can you share the link of the problem?

try using this code

#include <stdio.h>

int main() {
    int t, i, j;
    scanf("%d", &t);

    while (t--) {
        int N;
        scanf("%d", &N);
        int A[N];
        
        for (i = 0; i < N; i++) {
            scanf("%d", &A[i]);
        }

        int num_frames = N;
        
        for (i = 0; i < num_frames - 1; i++) {
            if ((i > 0 && A[i] == A[i - 1]) || A[i] == A[i + 1]) {
                for (j = i; j < num_frames - 1; j++) {
                    A[j] = A[j + 1];
                }
                num_frames--;
                i--;
            }
        }
        
        printf("%d\n", num_frames);
    }
    
    return 0;
}

how?

this is the correct code pls

#include <stdio.h>
int main()
{
int t, i, j;
scanf(ā€œ%dā€,&t);

while(t--)
{
    int N;
    scanf("%d",&N);
    int A[N];
    for(i=0; i < N; i++)
    {
        scanf("%d",&A[i]);
    }
    
    int num_frames = N;
    
    for (i = 0;  i < N - 1; i++)
    {
        if ((i > 0 && A[i] == A[i - 1]) || A[i] == A[i + 1])
        {
            for (j = i; j < N - 1; j++)
            {
                A[j] = A[j + 1];
            }
            N--;
            i--;
            num_frames--;
            }
        }
        printf("%d\n", num_frames);
    }
    return (0);

}

thanks any ways