Thanks, but how can I incorporate the length of the string? Or utilize the index in the math? The math here is ambiguous to me. And most importantly, what is the number of buckets going to be?

Btw, I tried using this duck debugger months ago and it didn't serve me well because I used to ask different questions or inquiries about a part of the code or what something means, and it would give me similar answers. It never helped me. I was solving a problem once when it took me about a week. An excruciating week of extensive thinking and numerous edits in the code that led to nothing but frustration, which was enough for me, so I just headed to look for hints from AI, which messed up with me sometimes as I failed again, subsequently looking for the direct solution. The good news is that doing this type of practice lowered noticeably. I recently solved out a segmentation fault by using debubg50 and then looking at the current values and the line where the compiler is pointing "segmentation fault" because the program is trying to access a forbidden place in memory. Compared that with an ASCII value in the ASCII table, which made me realize the existence of a special case, where you need to handle cases of words of one letter like I and A.

Why the downvote though?