Commit graph

3 commits

Author SHA1 Message Date
William Carroll
64bd3f0303 Complete balanced binary tree problem
Supporting a function that returns true if a tree has no two leaf nodes with
depth differences greater than 1.
2020-01-22 10:08:56 +00:00
William Carroll
34dc3e05c8 Complete practice algorithms from InterviewCake.com
While I've done these algorithms before, I'm preparing for an on-site with
DeepMind, so I created a subdirectory called deepmind where I'm storing my
second attempts at these problems. The idea of storing them in a second
directory is to remove the urge to check my existing solutions that also exist
in this repository.
2020-01-18 17:04:05 +00:00
William Carroll
a62553f7b7 Add DeepMind subdirectory
I need to prepare for my on-site with DeepMind, so I'll host some attempts to
solve data structures and algorithms questions here.
2020-01-17 20:08:24 +00:00