Day 9: Heartbeats

This morning started off with a difficult coding kata called “Double Cola.” Given a list of people in line for a vending machine, determine who buys the n‘th cola under the condition that every time a person drinks a cola, they are doubled (cloned) and these clones move to the end of the line. Our initial solution is to keep popping off and pushing onto the queue of people, but this is not an efficient solution (especially for large n values, this broke Markus’s tddbin 😵). We know that there is a mathematical solution that will be more time and space efficient. We saw a couple of them online but were very confused about them… so we will see if we continue to solve this tomorrow or move onto another problem.

Our new summer intern joined our kata this morning because she had mentioned that she was unfamiliar with TDD and wanted to learn about it. No better way to learn something than by doing it (or, at least participate while watching others do it)! Of course this was a very foreign process to me way back when I started participating in the katas (a whopping 2 weeks ago - can you believe how fast time flies!?), so I understood her confusion. It can be quite unintuitive.

Otherwise, I worked through more of the Haskell book which is starting to get a bit dry. These past two chapters focus on types (type signatures, type inference, polymorphism, currying, partial application, etc.) which means that the reading is quite dense - at least to me. But the book does a nice job of eliding unecessary details and spreading out exercises nicely to periodically help pump the blood a little bit.

I also talked to Ugurcan about the heartbeat he created! This heartbeat dashboard is in many rooms around the offices and displays the previous day’s data on the number of visitors, started bookings, and completed bookings on HolidayCheck. He and Wolfram were telling me that many people want to expand this tool, so I will see what input I can get and if it interests me to take this project further.

TTFN


Last updated: