Skip to main content
Search type Search syntax
Tags [tag]
Exact "words here"
Author user:1234
user:me (yours)
Score score:3 (3+)
score:0 (none)
Answers answers:3 (3+)
answers:0 (none)
isaccepted:yes
hasaccepted:no
inquestion:1234
Views views:250
Code code:"if (foo != bar)"
Sections title:apples
body:"apples oranges"
URL url:"*.example.com"
Saves in:saves
Status closed:yes
duplicate:no
migrated:no
wiki:no
Types is:question
is:answer
Exclude -[tag]
-apples
For more details on advanced search visit our help page
Results tagged with
Search options not deleted user 10791

The problem set for Week 5 will challenge you to apply what you've learned about pointers, memory management, file i/o and structs, creating more complex data structures (such as Hash Tables or Tries) and leveraging their power to write a lightning-fast spell check algorithm.

0 votes
1 answer
299 views

pset5 Why can't I create the root node for my trie?

The only code I have added to the top of my dictionary.c is this #include <stdbool.h> #include <stdio.h> #include <stdlib.h> #include <ctype.h> #include "dictionary.h" /** * Returns true if word i …
Wet Feet's user avatar
  • 121
0 votes
1 answer
27 views

pset5 Can't seem to get pointers right for `unload()`

This is my struct node defined in dictionary.h typedef struct node { bool is_word; struct node* children[27]; } node; struct node* root; This is the part of the code I'm having problems wi …
Wet Feet's user avatar
  • 121