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

typedef struct node
{
    char word[20];
    struct node *next;
}
node;

int hashs(char *str);
void free_hash(node *kill);
void print_list(node *say);

int main(void)
{
    node *table[26];
    char name[20];
    int place;
    for (int i = 0; i < 26; i  )
    {
        table[i]->next = NULL;
    }

    while (1)
    {
        printf("('e' to exit) enter name: ");
        scanf("s", name);
        if (name[0] == 'e' && name[1] == '\0')
        {
            break;
        }
        place = hashs(name);

        node *n = malloc(sizeof(node));
        if (n == NULL)
        {
            for (int i = 0; i < 26; i  )
            {
                free_hash(table[i]);
            }
            printf("memory issue\n");
            return 89;
        }
        strcpy(n->word, name);
        n->next = table[place]->next;
        table[place]->next = n;


    }

    for (int i = 0; i < 26; i  )
    {
        print_list(table[i]);
    }
    for (int i = 0; i < 26; i  )
    {
        free_hash(table[i]);
    }
}

int hashs(char *str)
{
    return toupper(str[0]) - 'A';
}

void free_hash(node *kill)
{
    if (kill == NULL)
    {
        return;
    }
    free_hash(kill->next);
    free(kill);
}

void print_list(node *say)
{


    for (node *temp = say; temp != NULL; temp = temp->next)
    {
        printf("%s\n", temp->word);
    }

    return;
}