#C3192. Unique Characters Frequency
Unique Characters Frequency
Unique Characters Frequency
Given a string consisting of only uppercase and lowercase alphabets, your task is to compute the frequency of each character in a case-sensitive manner. The result should be presented in a dictionary-like format where the keys are the characters and the values are their counts.
The frequency of a character ( x ) can be expressed by the formula: ( frequency(x) = \sum_{i=1}^{n} \mathbf{1}_{{x = s_i}} ), where ( s_i ) denotes the i-th character in the string.
inputFormat
The input consists of a single line that contains a string made up entirely of uppercase and lowercase letters. Note that the string may be empty.
outputFormat
Output a dictionary where each key is a character from the input string and its corresponding value is the count of that character. The dictionary should be printed exactly as shown in the examples.## sample
abc
{'a': 1, 'b': 1, 'c': 1}