The objective is to cement ability to implement core algorithms through repetition. This test suite is not like LeetCode. In fact, it’s more of a prerequisite to LeetCode. The test cases are not exhaustive in the spirit of checking for runtime performance, scalability, etc. Implementations are generalized, so that through practice using this tool, the user can begin avoiding having to think about the algorithmic pattern, and instead focus on its application to the problem at hand.

It uses Minitest to test the user’s implementations, dynamically loaded at runtime.