1. Tell about a project you did and how was implemented. 2. Given a String comprised out of all the chars possible (the string isn't necessarily long, but can contain all char types), return the number of removeLetter actions that would result in the input string to be valid. I'll explain: A "Valid String" is a string that each unique char in it has a count (number of appearances) which is a unique number. For example: given "abcaba", it's valid because 'a' appears 3 times, 'b' appears 2 times and 'c' appears once. In the contrary, "aabb" isn't valid because both 'a' & 'b' appears 2 times in the string. So the question is: implement a method in your lang, that would return the number of remove-letter actions that would convert an invalid string to a valid string. Given "aabb", the function will return 1 (because we can remove 'a' or 'b' and by that making the string valid).
