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

Domain

Python

Difficulty

medium

Seniority

L4

Problem

Decode a telemetry encoding for 26 letter frequencies (a..z). Rules: digits 0-9 map to positions a-j; '#' followed by a digit (NN#) means positions k-z (24#=x, 26#=z). '(n)' denotes multi-digit count n enclosed. Return a 26-element integer list of counts for each letter. (The test pattern gives '1(2)2(3)324#26#(5)': a=2, b=3, c=1, d..j=0, x=1, z=5.)

Summary

The encoding is hiding multipliers. Decode it.

Practice This Problem

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