Input: "45+60-80+90" Output: "45" "+" "60" "-" "80" "+" "90"
I need help in writing the code where I enter the input in which each char is followed by its occurrence and output should be absolute string.
Example Input a10b5c4 Output aaaaaaaaaabbbbbcccc
Convert the given string into palindrome with minimum number of appends(at end of the given string). O(n) algorithm will be appreciated ??
Input :=> Malayal Output :=> Malayalam
Find the first non repeating character in a string.
For example Input string: "abcdeabc" Output: "e"