speller | Wrapper around Yandex.Speller service | FTP library

I'm doing the cs50 speller problem and it seems everything is working except when I run Valgrind it says there is a segmentation fault, when I try running the code the same error also occurs. This is an exercise from cs50 where I have a function which takes a "dictionary" file, which is read word by word by a loop and stored in a hashtable, to read each word, I used a while loop using fscanf taking a string from the pointer of the dictionary, to a string called words (which is bigger than any word on the dictionary), the loop keeps running until reaching EOF:

Valgrind says 0 bytes lost but also says one less Frees than Mallocs
Because I have used malloc only once, I'm only posting those segments and not all the 3 files.

When loading a dictionary.txt file into a hash table:

I am new to C and in one assignment I have to load a 141,000 word dictionary in computer memory.

Below code works when loading a smaller dictionary (I tried up to 700 words) but when loading a bigger dictionary compiler gives segmentation error.

On running debugger, I can see call stack does not have next function (main) in queue when loading 140k word dictionary error on 140k word list. But for small dictionary with 700 words call stack has the next function (main) in the queue ready for execution the call stack is ok with small list

So I've been taking Harvard's CS50 class and currently am working on it's Problem Set 5 called speller (https://cs50.harvard.edu/x/2020/psets/5/speller/)

Basically I think that I have filled everything correctly, however, when trying to compile this error message appears :

I'm working on cs50 pset5 speller, and right now I'm on the check function. I use strcasecmp to compare two strings case insensitively. I'm coding in cs50 Ide(The one they give us in pset1) and my strcasecmp function brings this error message:

I'm working on cs50 pset5 speller, and in the lecture they introduce a new thing called nodes. What is a node? I didn't really understand what they said in the video. When I tried googling it, I got some sites that explained what a node is, but I didn't really understand. I'm new to c so I'm not accustomed to what I call 'coding words'. For instance, I found this on a site about nodes: A dynamic array can be extended by doubling the size but there is overhead associated with the operation of copying old data and freeing the memory associated with the old data structure. What is that supposed to mean? Please help me figure out what a node is because they seem important and useful, especially for pset5. My node is defined like this:

I'm was finished with cs50 pset5 speller(or so I thought), when I ran my complete program for the first time. It started printing out some words, so I was like: "Bingo! I'm done!" and I was seriously happy because I've been working on it for weeks. But then, while it was going through the words, I noticed some words like the word 'and' printed out when they were in the dictionary. So I thought that I had a small bug in my code. But when it came to the end of the list, It didn't do the 'Words misspelled:' Part and the other parts. It didn't even make a new line starting with $~. I had to close up that entire terminal because I couldn't do anything else there since it was like this:

I'm working on cs50 pset5 speller, and I'm on the size function, where you have to count the number of words in the dictionary. I'm trying to count how many things there are in each part of a node (see What is a node in C?), then add them together to make the total. But I don't know how to do that. Here's my code so far:

Very new to programming in C so sorry if I have badly misunderstood something. I am currently doing the speller problem set from CS50 if anyone is familiar with this, and I given words from a text to check if they are spelled correctly by comparing them to a given dictionary. I have sorted this dictionary into a hash table with about 17,000 buckets which point to on average, a linked list with a length of around 100 nodes. There may be several hundred thousand words that need to be spell checked.

My question is this, will checking to see if the length of each word from my dictionary matches the length of the word required to be spellchecked, using strlen(), before then using strcmp() only if the lengths match, be faster than just checking if the strings match using strcmp().

I do potentially see that if there are lots of words that have the same length as your word you want to check, checking the length will disadvantage you but I am wondering if the speed increase, if there is one, by checking the length for words with a more uncommon length will make up for this.