We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
For the start, Project Euler only requires you "count" the character differences, while Hacker Rank requires you to actually convert to the short form.
More problematic difference is that their inputs follow different rules. All of Project Euler inputs are still "valid": e.g. only one 'V' can appear in a string.
I ended up having two different solutions for these questions. I had a solution passing all tests in Hacker Rank, but failing Project Euler.
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Project Euler #89: Roman numerals
You are viewing a single comment's thread. Return to all comments →
This Hacker Rank question looks similar to the original Project Euler question, but it's actually quite different.
For the start, Project Euler only requires you "count" the character differences, while Hacker Rank requires you to actually convert to the short form. More problematic difference is that their inputs follow different rules. All of Project Euler inputs are still "valid": e.g. only one 'V' can appear in a string.
I ended up having two different solutions for these questions. I had a solution passing all tests in Hacker Rank, but failing Project Euler.