Integer to Roman

Problem Description

Given an integer num where $1 \leq \text{num} \leq 3999$, convert it to its Roman numeral representation.

Process each decimal place from highest to lowest.
For values starting with 4 or 9, use subtractive notation:
- 4: IV, 9: IX
- 40: XL, 90: XC
- 400: CD, 900: CM
Otherwise, append the largest symbol not exceeding the remaining value, subtract it, and continue.
Only I, X, C, and M can repeat consecutively (up to 3 times). V, L, and D cannot repeat; use subtractive forms instead of four repeats.

Return the Roman numeral string corresponding to num.

Example 1

Input: num = 3749
Output: "MMMDCCXLIX"
Explanation:
- 3000 → MMM
- 700 → DCC
- 40 → XL
- 9 → IX

Example 2

Input: num = 58
Output: "LVIII"
Explanation:
- 50 → L
- 8 → VIII

Example 3

Input: num = 1994
Output: "MCMXCIV"
Explanation:
- 1000 → M
- 900 → CM
- 90 → XC
- 4 → IV

class Solution:
    def intToRoman(self, num: int) -> str:
        # Write your code here
        pass

Solution 1: This approach uses a mapping of integer values to Roman symbols and iteratively constructs the Roman numeral by subtracting values and appending symbols. The time and space complexity are both O(1) due to the fixed number of Roman numeral symbols.