# Project Euler 89 - Roman Numerals

#### Posted on December 17, 2013

##### Last updated on December 21, 2013

Problem Description

My approach is to first convert the roman numeral to an integer, and then optimally convert it back to a roman numeral. There is a different way of approaching this problem (reduce pieces like IIII to IV), but I didn’t opt for them. The solution is in Haskell.