Learn how to hack* a Google interview! Want to work at Google, Facebook, Dropbox or other software companies? You'll need to pass a technical interview - and that's why we're here. Questions like: - Find the smallest element in a list - Find a duplicate value in a list - Find the top k in n values - Find a cycle in a linked list Topics include: - Data structures - Sorting - Hashing - big O notation These questions are fun puzzles, and - trust us - you'll see them all the time. See you soon! Best, Tim and Kim *not actually hacking.

Algorithms describe a "recipe" for doing something. Having good algorithms that are fast and easy to use is important for every area of life. In this class we'll talk about computer science algorithms in particular. We'll talk about how to use algorithms to sort a list of things, create tables that make looking up values really easy, and find shortest paths in graphs.

Come get your fancy shpants on with our mocktail lounge. Shake up your own mocktail, refresh with a variety of juices, and chill like a G6. (All drinks are non-alcoholic. Please don't sue us.)

Algorithms describe a "recipe" for doing something. Having good algorithms that are fast and easy to use is important for every area of life. In this class we'll talk about computer science algorithms in particular. We'll talk about how to use algorithms to sort a list of things, create tables that make looking up values really easy, and find shortest paths in graphs.

6.01 crammed into two hours! Also known as Introduction to Electrical Engineering and Computer Science I, 6.01 is the first step to being a Course 6 major. 6.01T is simply 6.01(Tim's Version). We'll be covering basic programming, signals and systems, feedback, control, circuits, op-amps, probability, search algorithms and more! If we have time, at least. This is obviously more breadth than depth, but it will be awesome.

Make a micro LED Flashlight! LED + Switch + AA Battery = LED Flashlight. In 15 minutes, make your own and take it home!