feat(m3): add solution exe 003

[AlessandroVerzella]

I did the exercise without using recursion. The base case is the equality of the two strings and whether one or both strings are empty.
However, I am having difficulty decomposing the problem to find the recursive function. I should start with the last character of both strings, but I do not know how to proceed.
Could we please look at this together in the mentorship?

[aleattene]

However, I am having difficulty decomposing the problem to find the recursive function. I should start with the last character of both strings, but I do not know how to proceed.

In this and the next exercise you just have to follow the algorithm as described in the README file

Could we please look at this together in the mentorship?

Of course yes.