A solution to a leetcode problem
Given two integers n and k, return the kth lexicographically smallest integer in the range [1, n]
A lazy solution is implemented in Haskell and Rust
A detailed description of the problem solution can also be found here