Roman Numeral to Integer - Amazon Top Interview Questions


Problem Statement :


Given a string numeral representing a Roman numeral, convert it to an integer.

Roman numerals contain the symbols representing values in the following list:

"I" = 1
"V" = 5
"X" = 10
"L" = 50
"C" = 100
"D" = 500
"M" = 1000

Roman numerals are typically written largest to smallest, from left to right, and can be computed by summing up the values of all the symbols. However, in some cases, when a symbol of lower value is to the left of a symbol of higher value, then the lower value is subtracted from the higher one.

There are 6 cases where this is possible:

When "I" is before "V", we get 4.
When "I" is before "X", we get 9.
When "X" is before "L", we get 40.
When "X" is before "C", we get 90.
When "C" is before "D", we get 400.
When "C" is before "M", we get 900.

Constraints

1 ≤ n ≤ 15 where n is the length of numeral

1 ≤ k ≤ 3000 where k is the number numeral represents

Example 1

Input

numeral = "XII"

Output

12

Explanation

"XII" = 10 + 1 + 1 = 12


Example 2

Input

numeral = "XIV"

Output

14

Explanation

"XIV" = 10 + 4 = 14


Solution :



title-img 




                        Solution in C++ :

int solve(string numeral) {
    unordered_map<char, int> mp;
    mp['I'] = 1;
    mp['V'] = 5;
    mp['X'] = 10;
    mp['L'] = 50;
    mp['C'] = 100;
    mp['D'] = 500;
    mp['M'] = 1000;

    int n = numeral.length();

    int prev = INT_MAX;
    int curr;
    int ans = 0;

    for (int i = 0; i < n; i++) {
        curr = mp[numeral[i]];  // get the current value
        ans += curr;            // add it to result
        if (curr > prev) {      // subtractive case
            ans -= 2 * prev;
        }
        prev = curr;  // update prev for next iteration
    }

    return ans;
}
                    




                        Solution in Python : 
                            
class Solution:
    def solve(self, numeral):
        value = {"M": 1000, "D": 500, "C": 100, "L": 50, "X": 10, "V": 5, "I": 1}
        res = 0
        prev = 0
        for i in range(len(numeral) - 1, -1, -1):
            n = value[numeral[i]]
            if n >= prev:
                res += int(n)
            else:
                res -= int(n)
            prev = n
        return res


View More Similar Problems

Tree: Level Order Traversal

Given a pointer to the root of a binary tree, you need to print the level order traversal of this tree. In level-order traversal, nodes are visited level by level from left to right. Complete the function levelOrder and print the values in a single line separated by a space. For example: 1 \ 2 \ 5 / \ 3 6 \ 4 F

View Solution →

Binary Search Tree : Insertion

You are given a pointer to the root of a binary search tree and values to be inserted into the tree. Insert the values into their appropriate position in the binary search tree and return the root of the updated binary tree. You just have to complete the function. Input Format You are given a function, Node * insert (Node * root ,int data) { } Constraints No. of nodes in the tree <

View Solution →

Tree: Huffman Decoding

Huffman coding assigns variable length codewords to fixed length input characters based on their frequencies. More frequent characters are assigned shorter codewords and less frequent characters are assigned longer codewords. All edges along the path to a character contain a code digit. If they are on the left side of the tree, they will be a 0 (zero). If on the right, they'll be a 1 (one). Only t

View Solution →

Binary Search Tree : Lowest Common Ancestor

You are given pointer to the root of the binary search tree and two values v1 and v2. You need to return the lowest common ancestor (LCA) of v1 and v2 in the binary search tree. In the diagram above, the lowest common ancestor of the nodes 4 and 6 is the node 3. Node 3 is the lowest node which has nodes and as descendants. Function Description Complete the function lca in the editor b

View Solution →

Swap Nodes [Algo]

A binary tree is a tree which is characterized by one of the following properties: It can be empty (null). It contains a root node only. It contains a root node with a left subtree, a right subtree, or both. These subtrees are also binary trees. In-order traversal is performed as Traverse the left subtree. Visit root. Traverse the right subtree. For this in-order traversal, start from

View Solution →

Kitty's Calculations on a Tree

Kitty has a tree, T , consisting of n nodes where each node is uniquely labeled from 1 to n . Her friend Alex gave her q sets, where each set contains k distinct nodes. Kitty needs to calculate the following expression on each set: where: { u ,v } denotes an unordered pair of nodes belonging to the set. dist(u , v) denotes the number of edges on the unique (shortest) path between nodes a

View Solution →