1. Dictionary_words works well and looks optimized for run time, nice job! I recommend adding benchmarking to your functions to test out alternative solutions. One idea is to try is pulling words while opening the file rather than after.
2. Creating histograms with dictionaries, list of lists and list of tuples all work and seem well optimized. All tests pass for listogram and dictogram, nice job! Your list of counts is incomplete, but it's off to a good start. Here is my solution if you need some inspiration: https://github.com/SWHarrison/CS1.2-Tweet-Generator/blob/9e24aa04322102c5563cc560d13eab0c86ea411c/histogram.py#L79
   This is a great challenge to level up your understanding of arrays/matrices!
3. In your sample class you are using a while loop for a set number of iterations. In general it is better practice to use a for loop in situations with a set number of iterations. Your sampling method also seems to be inaccurately sampling words, make sure to test your methods thoroughly!
4. Heroku app is working and seems to be running as expected, nice job! I am not seeing any stretch challenges however. If you make local changes be sure to push them to the deployed version.
5. Your markov chain is being created successfully, but it is hard coded for the start token. There also appears to be some trouble when trying to create the sentence. Make sure to test your functions with different inputs to see if your code is robust.

• You can reduce the time complexity from O(n) to O(1) of your length() method by adding an attribute to keep track of the number of nodes you added or deleted. for example .size or something like that. so if you append or prepend a node you would do self.size += 1, if you delete self.size -= 1.
• Great work on implementing the stretch challenge.
• Don't forget to test the stretch challenges you completed to make sure it is robust.

• Heroku app works, but text generation seems a little funky in terms of length of sentence, and some buttons appear non-functional. Try your best to improve the UI!
• Great job on n-th order Markov chains!

Hi Audi! I've graded your hashtable submission and have feedback for you:

• good job passing all unit tests
• good job using underlying linked list methods
• unfortunately, your time complexity analysis is off. Even though you have some nested for loops in some methods (like items), the code will never iterate through more than n items where n is the number of items in the hashtable. Remember that with Big O notation, a quadratic time complexity means that the number of operations done increases exponentially as n increases - however these functions will only increase linearly. Please fix
• try some stretch challenges!