Solving LeetCode Problems in Haskell & Rust
In 2025, we did a long blog series where we solved LeetCode problems using both Haskell and Rust. This allowed us to compare how various data structures and problem solving constructs work in a functional language like Haskell versus a more imperative language like Rust.
For a deeper understanding of the skills behind problem solving in Haskell, you should sign up for our Solve.hs course. This course starts by helping you solidify your basic knowledge of lists and loops. Then you'll learn about all the important data structures and how they're a bit different in Haskell. You'll also learn how to write critical algorithms in Haskell, particularly for graph problems.
Here are the links to the different articles, sorted by category:
List & String Manipulation (Basic Loops)
Longest Substring without Repeating Characters
Data Structures
Binary Tree: k-th smallest element
Find k pairs with smallest sums
Graph Algorithms
Dynamic Programming
Coin Change Coming 10/13/2025
Maximal Square Coming 10/20/2025
Best Time to Buy and Sell Stock IV Coming 10/27/2025