Problem 63. Encode Roman Numerals

Suggested Problems

• Count from 0 to N^M in base N.

  236 Solvers

• 2 b | ~ 2 b

  400 Solvers

• Find perfect placement of non-rotating dominoes (easier)

  363 Solvers

• Finding peaks

  423 Solvers

• Calculate the Number of Sign Changes in a Row Vector (No Element Is Zero)

  777 Solvers

More from this Author96

• Maximum running product for a string of numbers

  2202 Solvers

• Bullseye Matrix

  5988 Solvers

• Select every other element of a vector

  34211 Solvers

• Summing Digits within Text

  2547 Solvers

• Determine if input is odd

  22355 Solvers