Extensible FizzBuzz Code | Dataford Interview Questions

Axon interfaces may need compact, rule-based labels for ordered event values. Implement an extensible version of FizzBuzz that supports the classic rules and additional divisibility rules without changing the algorithm.

Write fizz_buzz(n, rules=None) to return a list containing one result for every integer from 1 through n.

Formal Specification

n is a positive integer.
rules is either None or a list of two-element lists, where each pair contains a positive divisor and its string label, such as [3, "Fizz"].
If rules is None, use [[3, "Fizz"], [5, "Buzz"]].
For each number, concatenate the labels for every rule whose divisor divides the number, preserving rule order.
If no rule matches, use the number's decimal representation.
Return a list of strings. Do not print the results.

Constraints

1 <= n <= 10^5
1 <= len(rules) <= 10
Each divisor is a positive integer no greater than 10^9
Each label is a non-empty string
Rule order determines concatenation order

Function Signature

def fizz_buzz(n, rules=None):

Your question is Extensible FizzBuzz Code. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem