Women Who Code San Francisco hosted an event to practice algorithms. The event was held at a recruiting agency, Talener SF. The evening began with a video of a lecture by an engaging MIT professor from the Introduction to Algorithms class. The lecture concerned AVL trees, which is a type of binary search tree. For an AVL tree, the heights of the left and right children or every node cannot differ in height by more than one. The video showed how to do an insertion, left and right rotations, and double rotations. I enjoyed the video so much, I cannot wait to see more of them.
Then, we broke up into two groups and worked on whiteboarding problems together from LeetCode. Sadly, we all over-thought the solution to a very simple problem!
michdcode 