Documentation Index
Fetch the complete documentation index at: /llms.txt
Use this file to discover all available pages before exploring further.
Tested Python solution for LeetCode 3442 with 26 pytest cases. Generate a practice environment with lcpy.
lcpy gen -n 3442 # by problem number
lcpy gen -s maximum_difference_between_even_and_odd_frequency_i # by problem name
s consisting of lowercase English letters.
Your task is to find the maximum difference diff = freq(a1) - freq(a2) between the frequency of characters a1 and a2 in the string such that:
a1 has an odd frequency in the string.a2 has an even frequency in the string.Input: s = "aaaaabbc"
Output: 3
Explanation: The character 'a' has an odd frequency of 5, and 'b' has an even frequency of 2.
The maximum difference is 5 - 2 = 3.
Input: s = "abcabcab"
Output: 1
Explanation: The character 'a' has an odd frequency of 3, and 'c' has an even frequency of 2.
The maximum difference is 3 - 2 = 1.
3 <= s.length <= 100s consists only of lowercase English letters.s contains at least one character with an odd frequency and one with an even frequency.from collections import Counter
class Solution:
# Time: O(n)
# Space: O(1)
def max_difference(self, s: str) -> int:
freqs = Counter(s).values()
return max(f for f in freqs if f % 2 == 1) - min(f for f in freqs if f % 2 == 0)
| Time | Space |
|---|---|
| O(n) | O(1) |