This site does not allow itself to be embedded. You can still read it on the original site — the toolbar below keeps your place in the directory.
For the past few weeks, I’ve been starting off my days with Haskell flavored code katas from Codewars . Today I started with the kata below and figured it would be a good exercise to walk through my solution. Write a function that will return the count of distinct case-insensitive alphabetic characters and numeric digits that occur more than once in the input string. The input string can be…
Comments
Nothing yet. Say the first thing.
Sign in to join the conversation.