Category Archives: competitive programming

Competitive programming in Haskell challenge: Letter Optimization

Posted on March 11, 2023 by Brent

Now that I’ve wrapped up my series of posts on Infinite 2D Array (challenge, part 1, 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 … Continue reading →

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

Competitive programming in Haskell: Infinite 2D array, Level 4

Posted on February 24, 2023 by Brent

In a previous post, I challenged you to solve Infinite 2D Array using Haskell. After deriving a formula for that involves only a linear number of terms, last time we discussed how to efficiently calculate Fibonacci numbers and binomial coefficients … Continue reading →

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

Competitive programming in Haskell: Infinite 2D array, Levels 2 and 3

Posted on January 16, 2023 by Brent

In a previous post, I challenged you to solve Infinite 2D Array using Haskell. As a reminder, the problem specifies a two-parameter recurrence , given by for for for . Last time, we derived a formula for that involves only … Continue reading →

Posted in competitive programming, haskell | Tagged , , | 1 Comment

Competitive programming in Haskell: better binary search

Posted on January 1, 2023 by Brent

Binary search is a workhorse of competitive programming. There are occasional easy problems where binary search is the solution in and of itself; more often, it’s used as a primitive building block of more complex algorithms. It is often presented … Continue reading →

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

Competitive programming in Haskell: Infinite 2D array, Level 1

Posted on December 3, 2022 by Brent

In my previous post, I challenged you to solve Infinite 2D Array using Haskell. As a reminder, the problem specifies a two-parameter recurrence , given by for for for . We are given particular values of and , and asked … Continue reading →

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

Competitive programming in Haskell: Infinite 2D array

Posted on September 1, 2022 by Brent

If you like number theory, combinatorics, and/or optimizing Haskell code, I challenge you to solve Infinite 2D Array using Haskell. Level 1: can you come up with a general formula to compute ? Level 2: In general, how can you … Continue reading →

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

Competitive programming in Haskell: BFS, part 4 (implementation via STUArray)

Posted on November 17, 2021 by Brent

In a previous post, we saw one way to implement our BFS API, but I claimed that it is not fast enough to solve Modulo Solitaire. Today, I want to demonstrate a faster implementation. (It’s almost certainly possible to make … Continue reading →

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

Competitive programming in Haskell: Enumeration

Posted on November 15, 2021 by Brent

I’m in the middle of a multi-part series on implementing BFS in Haskell. In my last post, we saw one implementation, but I claimed that it is not fast enough to solve Modulo Solitaire, and I promised to show off … Continue reading →

Posted in competitive programming, haskell | Tagged , , , , | 1 Comment

Competitive programming in Haskell: BFS, part 3 (implementation via HashMap)

Posted on October 29, 2021 by Brent

In a previous post, I showed how we can solve Modulo Solitaire (and hopefully other BFS problems as well) using a certain API for BFS, and we also explored some alternatives. I had a very interesting discussion with Andrey Mokhov … Continue reading →

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

Competitive programming in Haskell: BFS, part 2 (alternative APIs)

Posted on October 18, 2021 by Brent

In my last post, I showed how we can solve Modulo Solitaire (and hopefully other BFS problems as well) using a certain API for BFS, which returns two functions: one, level :: v -> Maybe Int, gives the level (i.e. … Continue reading →

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