Create are_string_occurences_equal.py #672
Open
+47
−0
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
This PR adds the Python implementation for the LeetCode 1941 problem — "Check if All Characters Have Equal Number of Occurrences".
The solution determines whether every character in a string appears the same number of times.
Key Details:
Algorithm Used: Frequency Counting using collections.Counter
Time Complexity: O(n)
Space Complexity: O(k), where k is the number of unique characters
Approach:
Count occurrences of each character using Counter.
Convert all frequency values into a set.
If the length of this set equals 1, it means all counts are identical.
Files Added:
are_string_occurrences_equal.py → Main implementation with docstrings and sample runs.