Problem 63. Encode Roman Numerals

• Created by Cody Team
• Appears in 4 groups

×

By solving this problem, you will make progress in the following group(s)

All Things Fibonacci

• 9 Problems
• 323 Finishers

Basics - Fibonacci

• 8 Problems
• 357 Finishers

M3 Challenge Problem Group

• 20 Problems
• 21 Finishers

Prográmky

• 10 Problems
• 84 Finishers

Like (16)

Difficulty:

(3033)

Rate

• Solve Later   
• Add To GroupÂ

Create a function taking a non-negative integer as its parameter and returning a string containing the Roman Numeral representation of that integer.

By convention, "modern" Roman numerals are written by expressing each digit separately starting with the leftmost digit and skipping any digit with a value of zero.

Examples

• If n is 1990 then romStr = 'MCMXC' since 1000=M, 900=CM, 90=XC.
• If n is 2008 then romStr = 'MMVIII' since 2000=MM, 8=VIII.
• If n is 1666 then romStr = 'MDCLXVI'.
• If n is 0 then romStr is empty ([] and '' are both acceptable)

n will always be an integer between 0 and 3999 (inclusive).

This problem is adapted from Rosetta Code.

Solve

Solution Stats

60.56% Correct | 39.44% Incorrect

• 3600 Solutions
• 1979 Solvers

Last Solution submitted on May 06, 2025

Last 200 Solutions

Solution Comments

Problem Recent Solvers1979

Suggested Problems

• Find the two most distant points

  2897 Solvers

• Reverse the vector

  15074 Solvers

• Back to basics 15 - classes

  524 Solvers

• 03 - Matrix Variables 4

  628 Solvers

• There are 10 types of people in the world

  1180 Solvers

More from this Author96

• Replace NaNs with the number that appears to its left in the row.

  3024 Solvers

• Nearest Numbers

  4793 Solvers

• Remove all the consonants

  4126 Solvers

• Find common elements in matrix rows

  2679 Solvers

• Maximum running product for a string of numbers

  2212 Solvers