In this kata you have to create all permutations of an input string and remove duplicates, if present. This means, you have to shuffle all letters from the input in all possible orders.Examples:123permutations('a'); // [
Given the string representations of two integers, return the string representation of the sum of those integers.For example:
1sumStrings('1','2') // => '3'
A string representation of an integer will contain no charact
Welcome to Hexo! This is your very first post. Check documentation for more info. If you get any problems when using Hexo, you can find the answer in troubleshooting or you can ask me on GitHub.
Quick StartCreate a new p