Tweet Note: read the whole series here.   Continuing on from where we left off with traits last time around, let’s look at Scala’s case class/object which can be used to create Algebraic Data Types (ADTs) in Scala.   Case Class You can declare an ADT in F# using Discriminated Unions (DUs). For example, a binary tree might be represented

Tweet Note: read the whole series here.   Continuing on from where we left off with type inference last time around, let’s look at a language feature in Scala that doesn’t exist in F# – traits. Scala has both abstract classes and traits (think of them as interfaces, but we’ll get into the differences shortly) to support

Tweet It’s a new year, a new job, a new language (Scala) and runtime (JVM) to work with. After a week of learning about my new surroundings at Space Ape Games and getting up to speed with Scala I have learnt a fair bit. In my own journey (aided by Twitter’s Scala School, Odersky’s Coursera course and

Tweet ps. look out for all my other solutions for Advent of Code challenges here.   Day 24 See details of the challenge here. Today’s challenge is a mix of Breadth-First Search (or Level Order Tree Traversal) and the Travelling Salesman Problem. First, let’s parse the input file into a 2D array to make it easier

Tweet ps. look out for all my other solutions for Advent of Code challenges here.   Day 23 See details of the challenge here. Today’s input looks like this: cpy a b dec b cpy a d cpy 0 a cpy b c inc a .. Today’s challenge is an extension to Day 12, where we