Roman Numerals Algorithm | Dataford Interview Questions

Write an algorithm to print a series of Roman numerals.

Implement roman_series(n), which returns a list containing the canonical Roman numeral representation of every integer from 1 through n, inclusive. For example, roman_series(5) returns ["I", "II", "III", "IV", "V"], and roman_series(10) ends with "X". The input is an integer from 1 through 3999; use subtractive notation such as IV, IX, XL, XC, CD, and CM.

Constraints

1 <= n <= 3999
Use canonical Roman numeral notation
The output contains exactly n strings

Function Signature

def roman_series(n):

Your question is Roman Numerals Algorithm. 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

Write an algorithm to print a series of Roman numerals.

Constraints

1 <= n <= 3999
Use canonical Roman numeral notation
The output contains exactly n strings

Function Signature

def roman_series(n):

Your question is Roman Numerals Algorithm. 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.