The coin change problem is a combinatorial problem in which, given a set of coin values and a target value, the goal is to find the amount of all possible coin value combinations to reach the target value. Because of the combinatorial nature, this problem is NP-complete. However, we can alleviate the hardships by employing dynamic programming with memoization and utilizing a neat little property of the problem. To stay true to our values, we solve this problem in Haskell, a purely functional language close to our hearts! :)
Since the announcement of Sihl, we've been working towards the first release.
Version 1.0.0 will stabilize the API, so we can write documentation and encourage others to use Sihl. In this post, we summarize the work so far and what is next on our to-do list.