Monthly Archives: May 2020

Competitive programming in Haskell: permutations

Posted on May 30, 2020 by Brent

In my previous post I challenged you to solve The Power of Substitution. This problem presents us with a substitution cipher, and asks how many times we would have to iterate the encoding process in order to turn a given … Continue reading →

Posted in competitive programming, haskell | Tagged , , , , , , , | 5 Comments

Competitive programming in Haskell: building unordered trees

Posted on May 22, 2020 by Brent

In my previous post I challenged you to solve Subway Tree System, which encodes trees by recording sequences of steps taken away from and towards the root while exploring the whole tree, and asks whether two such recordings denote the … Continue reading →

Posted in competitive programming, haskell | Tagged , , , , , , , , , | 26 Comments

Competitive programming in Haskell: sorting tree shapes

Posted on May 19, 2020 by Brent

In my previous post I challenged you to solve this problem, which essentially asks how many distinct binary tree shapes are created when we take lists of numbers and build a tree from each by repeated binary search tree insertion. … Continue reading →

Posted in competitive programming, haskell | Tagged , , , , , , , | 19 Comments

Competitive programming in Haskell: summer series

Posted on May 16, 2020 by Brent

Now that this weird and crazy semester is finally over, I’d like to get back to doing some blogging (among other things). I’m going to return to my series on competitive programming in Haskell (previous posts here: basic setup; code … Continue reading →

Posted in competitive programming, haskell | Tagged , , , | 6 Comments