You are viewing a single comment's thread. Return to all comments →
That is definitely an interesting solution. I used a fold for my solution:
len :: [a] -> Int len lst = foldr (\x acc -> acc + 1) 0 lst
Seems like cookies are disabled on this browser, please enable them to open this website
List Length
You are viewing a single comment's thread. Return to all comments →
That is definitely an interesting solution. I used a fold for my solution: