Solving DNASTORAGE problem

include <stdio.h>
include <string.h>

void encodeSequence(char binaryString, int length) {
for (int i = 0; i < length; i += 2) {
if (binaryString[i] == ‘0’ && binaryString[i + 1] == ‘0’) {
printf(“A”);
} else if (binaryString[i] == ‘0’ && binaryString[i + 1] == ‘1’) {
printf(“T”);
} else if (binaryString[i] == ‘1’ && binaryString[i + 1] == ‘0’) {
printf(“C”);
} else if (binaryString[i] == ‘1’ && binaryString[i + 1] == ‘1’) {
printf(“G”);
}
}
printf(“\n”);
}

int main() {
int T, N;
scanf(“%d”, &T);

for (int t = 0; t < T; t++) {
    scanf("%d", &N);

    char binaryString[N + 1];
    scanf("%s", binaryString);

    // Ensure the input string length is even
    if (strlen(binaryString) != N) {
        printf("Invalid input. Length mismatch!\n");
        return 1;
    }

    encodeSequence(binaryString, N);
}

return 0;

}