Given an array of integers, find the one that appears an odd number of times. There will always be only one integer that appears an odd number of times
your task is to create all permutations of a non-empty input string and remove duplicates, if present
Given an array (arr) as an argument complete the function countSmileys that should return the total number of smiling faces.
Rules for a smiling face:
- Each smiley face must contain a valid pair of eyes. Eyes can be marked as : or ;
- A smiley face can have a nose but it does not have to. Valid characters for a nose are - or ~
- Every smiling face must have a smiling mouth that should be marked with either ) or D