A easy Python interview practice problem on DataDriven. Write and execute real python code with instant grading.

Domain

Python

Difficulty

easy

Seniority

L5

Problem

Given a string, return a list of [character, count] pairs for each distinct alphabetic character. Treat case-insensitively (lowercase everything before counting). Sort the pairs alphabetically by character.

Summary

Character frequency as a map.

Practice This Problem

Solve this Python problem with real code execution. DataDriven runs your Python code in a real environment and grades it automatically.