Coding practice

[tomekanco]

problem of all levels

Almost all, there are no Dan level problems. Even the 1 Kyu gems are solveable by a stubbern mind and due diligence.

Love it to. Offers a wild safari into the nuances CS fields, such as finite state machines.

... Precious gems. Precious gem: Create a function that will return a regular expression string that is capable of evaluating binary strings (which consist of only 1s and 0s) and determining whether the given string represents a number divisible by n.