Dataford
Interview QuestionsInterview GuidesExperiencesMock InterviewsPricing
Get started
Roman Numerals Algorithm
00:00
5 left

Roman Numerals Algorithm

EasyPython

Problem

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):
Interviewer

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.

You need to log in / sign up to run or submit.
CodePython 3
You need to log in / sign up to run or submit.Ln 2
Run your code to see test output here.