When working with strings, one common task is comparing their character composition. This involves analyzing not just what characters are present, but how many times each character appears. This technique is fundamental to solving many string-related problems.
The key insight is that two strings have the same character composition if and only if they contain identical characters with identical frequencies. For example, "abc" and "bca" both contain exactly one 'a', one 'b', and one 'c'.
There are several approaches to counting character frequencies. The most straightforward is using a dictionary where keys are characters and values are their counts. As you iterate through a string, you increment the count for each character you encounter.
Another approach is sorting both strings and comparing them directly. If two strings contain the same characters with the same frequencies, sorting them will produce identical results. This works because sorting arranges characters in a consistent order, making comparison straightforward.
When implementing character frequency analysis, consider edge cases like empty strings, different string lengths, and normalization requirements (case sensitivity, handling spaces/punctuation). These details often determine whether your solution works correctly in all scenarios.
String normalization is particularly important when you need to ignore certain differences. Converting to lowercase handles case insensitivity, while filtering out non-alphabetic characters focuses comparison on letters only.
1def count_characters(text):
2 """Count frequency of each character in a string"""
3 char_count = {}
4 for char in text.lower(): # Normalize to lowercase
5 if char.isalpha(): # Only count letters
6 char_count[char] = char_count.get(char, 0) + 1
7 return char_count
8
9# Example usage
10text1 = "Hello World"
11text2 = "world hello"
12print(count_characters(text1)) # {'h': 1, 'e': 1, 'l': 3, 'o': 2, 'w': 1, 'r': 1, 'd': 1}
13print(count_characters(text2)) # {'w': 1, 'o': 2, 'r': 1, 'l': 3, 'd': 1, 'h': 1, 'e': 1}