Since Roman numerals have an upper bound, the time complexity is always O(1).
you are viewing a single comment's thread
view the rest of the comments
view the rest of the comments
Since Roman numerals have an upper bound, the time complexity is always O(1).