W6D5

Today's Learning Goals:

Explain Kruskal's Minimum Spanning Tree algorithm. What algorithm does this remind you of? What's the difference?
Explain floats and clears
Explain the clearfix
What is a Trie?
What might you want to store in each node in your Trie?
How do you handle it when your Trie becomes too large to be stored on one machine?
How would you collect and update the top results for a certain node in the Trie?

Study

Algos

Minimum Spanning Tree (Prims)

Web

Design Autocomplete

JavaScript

First Node Project Continued

Misc

CSS floats and clears

Make Flashcards

Practice

Review Anki.

Code

Network and Apply

Reach out to 2 people
Apply to 5 jobs