Alert Using Same Key-Card Three or More Times in a One Hour Period - Problem

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <ctype.h>

#define MAX_NAMES 1000
#define MAX_NAME_LEN 50
#define MAX_TIMES 100

int timeToMinutes(char* time) {
    int hours, minutes;
    sscanf(time, "%d:%d", &hours, &minutes);
    return hours * 60 + minutes;
}

int compare(const void* a, const void* b) {
    return strcmp(*(char**)a, *(char**)b);
}

int compareInts(const void* a, const void* b) {
    return (*(int*)a) - (*(int*)b);
}

char** solution(char** keyName, char** keyTime, int keyNameSize, int* returnSize) {
    char names[MAX_NAMES][MAX_NAME_LEN];
    static int times[MAX_NAMES][MAX_TIMES];
    int counts[MAX_NAMES];
    int numEmployees = 0;
    
    // Group times by employee
    for (int i = 0; i < keyNameSize; i++) {
        int found = -1;
        for (int j = 0; j < numEmployees; j++) {
            if (strcmp(names[j], keyName[i]) == 0) {
                found = j;
                break;
            }
        }
        
        if (found == -1) {
            strcpy(names[numEmployees], keyName[i]);
            times[numEmployees][0] = timeToMinutes(keyTime[i]);
            counts[numEmployees] = 1;
            numEmployees++;
        } else {
            times[found][counts[found]] = timeToMinutes(keyTime[i]);
            counts[found]++;
        }
    }
    
    char** result = malloc(MAX_NAMES * sizeof(char*));
    int resultCount = 0;
    
    // Check each employee
    for (int emp = 0; emp < numEmployees; emp++) {
        if (counts[emp] < 3) continue;
        
        // Handle midnight crossing: if we have times both before and after midnight,
        // adjust the after-midnight times to be next day
        int adjustedTimes[MAX_TIMES];
        for (int i = 0; i < counts[emp]; i++) {
            adjustedTimes[i] = times[emp][i];
        }
        
        int hasLateNight = 0, hasEarlyMorning = 0;
        for (int i = 0; i < counts[emp]; i++) {
            if (times[emp][i] >= 23 * 60) hasLateNight = 1;  // 23:00 or later
            if (times[emp][i] < 2 * 60) hasEarlyMorning = 1;  // before 02:00
        }
        
        if (hasLateNight && hasEarlyMorning) {
            for (int i = 0; i < counts[emp]; i++) {
                if (adjustedTimes[i] < 2 * 60) {  // early morning times
                    adjustedTimes[i] += 24 * 60;  // treat as next day
                }
            }
        }
        
        // Check all combinations of 3 times
        int foundViolation = 0;
        for (int i = 0; i < counts[emp] && !foundViolation; i++) {
            for (int j = i + 1; j < counts[emp] && !foundViolation; j++) {
                for (int k = j + 1; k < counts[emp]; k++) {
                    int threeTimes[3] = {adjustedTimes[i], adjustedTimes[j], adjustedTimes[k]};
                    qsort(threeTimes, 3, sizeof(int), compareInts);
                    if (threeTimes[2] - threeTimes[0] <= 60) {
                        foundViolation = 1;
                        break;
                    }
                }
            }
        }
        
        if (foundViolation) {
            result[resultCount] = malloc((strlen(names[emp]) + 1) * sizeof(char));
            strcpy(result[resultCount], names[emp]);
            resultCount++;
        }
    }
    
    // Sort result
    qsort(result, resultCount, sizeof(char*), compare);
    
    *returnSize = resultCount;
    return result;
}

char* parseString(char* input, int* pos) {
    while (input[*pos] && (input[*pos] == ' ' || input[*pos] == ',' || input[*pos] == '[' || input[*pos] == '"')) (*pos)++;
    if (!input[*pos] || input[*pos] == ']') return NULL;
    
    int start = *pos;
    while (input[*pos] && input[*pos] != '"' && input[*pos] != ',' && input[*pos] != ']') (*pos)++;
    int end = *pos;
    while (input[*pos] && input[*pos] != ',' && input[*pos] != ']') (*pos)++;
    
    char* result = malloc(end - start + 1);
    strncpy(result, input + start, end - start);
    result[end - start] = '\0';
    return result;
}

int main() {
    char line1[2000], line2[2000];
    fgets(line1, sizeof(line1), stdin);
    fgets(line2, sizeof(line2), stdin);
    
    char** keyName = malloc(MAX_NAMES * sizeof(char*));
    char** keyTime = malloc(MAX_NAMES * sizeof(char*));
    int size = 0;
    
    // Parse keyName array
    int pos = 0;
    char* token;
    while ((token = parseString(line1, &pos)) != NULL && size < MAX_NAMES) {
        keyName[size++] = token;
    }
    int keyNameSize = size;
    
    // Parse keyTime array
    pos = 0;
    size = 0;
    while ((token = parseString(line2, &pos)) != NULL && size < MAX_NAMES) {
        keyTime[size++] = token;
    }
    
    int returnSize;
    char** result = solution(keyName, keyTime, keyNameSize, &returnSize);
    
    printf("[");
    for (int i = 0; i < returnSize; i++) {
        printf("\"%s\"", result[i]);
        if (i < returnSize - 1) printf(",");
    }
    printf("]\n");
    
    return 0;
}