CS50x Week 5 is where memory management becomes the whole point — two problems that cover recursive struct allocation, pointer-based family trees, hash tables, and the kind of disciplined free() practice that Valgrind keeps you honest about. From simulating blood type inheritance across three generations to building a spell checker that loads 143,000 words into a hash table, this week is one of the most technically rewarding in the course. Here is how both problems came toget