Hello and welcome to the challenge!
Write a code converting the given camel case string to its kebab case version. Remember about removing all digits.
solve('someCamelCaseName') -> 'some-camel-case-name'
solve('camelCase2') -> 'camel-case'
- camel case string containing letters and digits
- kebab case string consisting of lowercase letters and dashes
1 < length of the input string < 200
Have fun and good luck! :)