Implement prototype(loaded: str, requested: str) -> dict[str, int] and solve with the same signature. Casefold each whole input string, count only alphabetic code points, and return positive deficits requested_count - loaded_count. Insert returned keys in Python sorted order. Do not normalize Unicode further.
Examples: ('ab', 'aaa') returns {'a': 2}; ('ß', 'SS') returns {}. Empty strings are valid.
The prototype may rescan strings for each distinct requested letter. The final version should build frequency maps. Inputs remain unchanged. No additional error cases are required.
Drag or use the arrow keys to resize. Home collapses the question; End collapses the editor. Enter or double-click resets the split.
Loading editor…
Loading editor…
No results yet.
Complete the starter code, then run the checks.
Results and errors will appear here.