Find all possible roman numbers from string


I have to write an algorithm for finding all possible roman numbers from a string. I shouldn’t use brute force, but I have to use proper algorithm and/or proper data structure. Can someone give me any advice where to start, cause I can’t remeber anything except brute force solution for it.
Thank you

Use a regular expression, and that happens to be one of the samples I wrote for RegExRX.


You can use RegEx in Xojo:
we have some RegEx kings here in the forum.

Edit: the King of RegEx was faster than me :wink:

Unlikely a regex solution will suffice.
‘explain your algorithm’.

1 Like