Help me in solving ADJSUMPAR problem

help
,
1

My issue

    count = 0;
    for (i = 0; i < N; i++) {
        if (B[i] != B[(i + 1) % N]) {
            count++;
        }
    }

    if (count % 2 == 0) {
        printf("YES\n");
    } else {
        printf("NO\n");
    }
}

}
return 0;

My code

#include <stdio.h>

int main() {
    int T, N, i, j, count;

    scanf("%d", &T);
    while (T--) {
        scanf("%d", &N);
        int B[N];

        for (i = 0; i < N; i++) {
            scanf("%d", &B[i]);
        }

        count = 0;
        for (i = 0; i < N; i++) {
            if (B[i] != B[(i + 1) % N]) {
                count++;
            }
        }

        if (count % 2 == 0) {
            printf("YES\n");
        } else {
            printf("NO\n");
        }
    }
}
return 0;
}

Learning course: Roadmap to 3*
Problem Link: https://www.codechef.com/learn/course/klu-roadmap-3star/KLURMP300A/problems/ADJSUMPAR