393. Unique Character Frequency Sum

Given a string s, calculate the sum of the frequencies of all characters that appear exactly once in the string. If no character appears exactly once, return 0.

Example:
Input: s = "aabbc" Output: 1 (only 'c' appears once).

Run this challenge interactively in Python or JavaScript when the app loads.