Competitive programming in Haskell challenge: Letter Optimization

Now that I’ve wrapped up my series of posts on Infinite 2D Array (challenge, part
, part 2, part 3), I’d like to tackle another topic related to competitive programming in Haskell. I won’t tell you what the topic is quite yet—for now, I challenge you to use Haskell to solve Letter Optimiztion! Feel free to post thoughts, questions, solutions, etc. in the comments (so don’t look at the comments if you don’t want spoilers!). In an upcoming post I will discuss my solution.


About Brent

Associate Professor of Computer Science at Hendrix College. Functional programmer, mathematician, teacher, pianist, follower of Jesus.
This entry was posted in competitive programming, haskell and tagged , , . Bookmark the permalink.

2 Responses to Competitive programming in Haskell challenge: Letter Optimization

  1. Joeri says:

    Commenting here to say that I really appreciate your posts about competitive Haskell programming. I’ve done my fair share of Facebook Hacker Cups and Google Code Jams (in Haskell!) back in the day, but never got past the second round. These days, I’m not sure if I could even make it past the 0th round (whatever it’s called… I’m really out of it). For Infinite 2D Array, I’m happy to at least have gotten the maths right, though I used slow data structures, and no memoization.

    Letter Optimization seems cool, and also appropriate to my other current hobby (Factorio… I’m sorry for mentioning it. It tends to suck people in.).

Leave a Reply

Fill in your details below or click an icon to log in: Logo

You are commenting using your account. Log Out /  Change )

Twitter picture

You are commenting using your Twitter account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )

Connecting to %s

This site uses Akismet to reduce spam. Learn how your comment data is processed.