Thanks for teaching me about this function!
You created a list of pairs, which has O(n) search time. You could use a set to give you O(1) search time--although, for three elements it probably doesn't matter.
This comment is hidden because it contains spoiler information about the solution
I have the same question, but I still haven't figured it out. What do you mean by "the output is inside a loop"?
Never mind I get it
My favorite solution, very declarative
Very clean!
I like zip_longest. Didn't know about that method
I like the use of types:
type Level = Int type Score = Int
I wrote a mini fractions libary before I realized the pattern haha
My favorite solution
I agree. That's how I wrote mine.
Good descriptive naming
You can use the cons operator (:) instead of ++, because those arrays have size 1
:
++
intercalate " " is equivalent to unwords from the prelude--you could make your code a littlemore concise that way
intercalate " "
unwords
Loading collection data...
Thanks for teaching me about this function!
You created a list of pairs, which has O(n) search time. You could use a set to give you O(1) search time--although, for three elements it probably doesn't matter.
This comment is hidden because it contains spoiler information about the solution
I have the same question, but I still haven't figured it out. What do you mean by "the output is inside a loop"?Never mind I get it
My favorite solution, very declarative
This comment is hidden because it contains spoiler information about the solution
Very clean!
I like zip_longest. Didn't know about that method
I like the use of types:
type Level = Int
type Score = Int
I wrote a mini fractions libary before I realized the pattern haha
My favorite solution
I agree. That's how I wrote mine.
Good descriptive naming
You can use the cons operator (
:
) instead of++
, because those arrays have size 1intercalate " "
is equivalent tounwords
from the prelude--you could make your code a littlemore concise that wayLoading more items...