Let’s have N different strings/words for each word print the minimum part of it which makes it unique toward others, for example:
A13-OLinuXino -> a
iMX233-OLinuXino -> 2
MOD-PULSE -> p
MOD-IO -> -i
i.e. if you search for “a” in all words you will find it only in “A13-OLinuXino”, if you search for “2” in all words you will find it only in “iMX233-OLinuXino” and so on.
You can code the solution in any language during the weekend and have to submit it to firstname.lastname@example.org latest on Sunday April 7th .
On Monday we will upload the solutions on GitHub and review https://github.com/OLIMEX/WPC .
You can play with your real name or with nick if you want to be anonymous, we will not disclosure your personal info if you do not want to.
Good Luck and Have fun!