With new perfomance requirements you need to be lechevalier to solve this) I think this kata deserves 3kyu, you can see it by amount of people who solved it.
If the list input contains any invalid values, discard it entirely
Can you explain your logic?
I had 400 lines of code...
hi @K01egA , g . f is not equivalent to f . g
if f: A->B and g: B->A
g . f
f . g
f . g = id_B
g . f = id_A
which imply that for all element b in B, we have id_B(b) = b
and for all element a in A ,we have id_A(a) = a
Testcase 'Undertale, ice tic-tac-toe puzzle (edited)' has new line character after last line. Is it issue?
This comment is hidden because it contains spoiler information about the solution
There are 4 possible things that might happen, not just 2. And only 1 of them is problematic, really.
Just put in whatever that makes it type-check.
I understand that some cases like isoUnMaybe isoBaz are impossible. How proofs should be represented in code? return undefined, throw error, change function type?