Ad
  • Custom User Avatar

    Yup, same issue here.

  • Custom User Avatar

    Same issue here. My solution included <li> tags and the tests kept erroring out at "<".
    Eventually I yielded and came looking for the answers, saw that many past solutions used tags as well, so I copied and pasted them, and they also return an error "<". Does anybody have any idea what's going on?

  • Custom User Avatar

    This comment is hidden because it contains spoiler information about the solution

  • Custom User Avatar

    The problem is that you seem to make a substitution by finding the first character. In your case it is M; CM = 900. You need to refine the algorithm so that the longest possible combination of several characters is found first.
    First find CM, change it to 900, then find M and change it to 1000. The result sum is 1900.

  • Custom User Avatar

    This one is driving me insane. Anyone else having this issue?
    I can successfully convert from Roman with ONE PARTICULAR EXCEPTION: "MCM" should convert to 1900 but it always converts to 2100. What's really driving me insane is that the other similar cases convert correctly:
    CXC returns 190.
    XIX returns 19.
    These cases work under the exact same logic than MCM but, for some reason, MCM return 2100 instead of 1900.

    Also, M correctly returns 1000, MM correctly returns 2000, C correctly returns 100, and CM correctly returns 900.

    Has anyone encountered this issue? I've been looking at my code for over an hour now and I really can't figure out why this one particular case works differently from all the others

    Disclaimer: I know you can't really tell what the exact problem is without looking at the code. For now, I just want to now if anyone else has also ran into this weird problem.