A medium Python interview practice problem on DataDriven. Write and execute real python code with instant grading.
- Domain
- Python
- Difficulty
- medium
- Seniority
- L3
Problem
Given a dict mapping store names to lists of review strings, return the single review string that appears in the most distinct stores. Within a store, duplicates count only once toward that store. Tie-break alphabetically by review string.
Summary
The echo came back.
Practice This Problem
Solve this Python problem with real code execution. DataDriven runs your Python code in a real environment and grades it automatically.