Chapter 1 complete!! :D

[SevroAuBarca]

Solutions for Chapter 1 🗡️, I really appreciate the feedback, thanks :)

cc @vrom911 @chshersh

[vrom911]

Hi! Absolutely amazing work on the Chapter! Well done 👏🏼

[vrom911]

Your implementation is almost correct 🆗
Unfortunately, it returns negative numbers on negative inputs because of how mod works. Sometimes corner cases can be tricky to spot and fix...

[vrom911]

As we mentioned, the compiler in Haskell is very attentive to the exhaustive pattern-matching. And here it would warn you that Pattern matching is not exhaustive, as the guards have quite complicated logic, and the compiler won't be able to prove that it covers all the cases.

Because of that, you will need to add another guard – | otherwise = ..., to tell the compiler, that your pattern matching is exhaustive 🙂

In this case, it would be enough to replace the last condition check with otherwise, as we know that this is the only possibility left here 🙂

Suggested change

	| (z > y && z < x) || (z < y && z > x) = z
	| otherwise = z

[SevroAuBarca]

oh right, i forgot thah jaja, i send my changes in my PR on the chapter 2, thank you so much :)

[vrom911]

You are on the right way here! You see that there is the pattern in all of this steps.
Instead of manual few steps here, you can continue doing mod x 10 here until x would be smaller than 10 :)
For that you can use recursiuon (call the same function over and over again from the body of the function itself 👌🏼