You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
1.4: Given a string, write an alogorithm to check if it is a permutation of palindrome. A permutation is a rearrangement of letters. The palindromedoes not need to be a dictionary words.
1.6: Implement a method to perform basic string compression using the counts of repeated characters. String aabcccccaaa would became a2b1c5a3. If the compressed string would not became smaller than the original string then it should return the original string. You can assume the string has only uppercase and lower case letters.