Back to course home
0% completed
Vote For New Content
Incorrect Time Complexity
João Vitor Almeida
Sep 25, 2024
The time complexity seems that is wrong, because there is a maxium value that the roman number can reach(3999) and it is represented with 9 characters, so basically the maximum size of my input is 9 so it's constant, and this is the reason that I believe that the time complexity is O(1)
0
0
Comments
On this page
Problem Statement
Examples
Solution
Step-by-Step Algorithm
Algorithm Walkthrough
Code
Complexity Analysis