Binary TreesBinary Trees36
❯
  1. 1Preorder Traversal of a Binary Tree using Recursion
  2. 2Preorder Traversal of a Binary Tree using Iteration
  3. 3Inorder Traversal of a Binary Tree using Recursion
  4. 4Inorder Traversal of a Binary Tree using Iteration
  5. 5Postorder Traversal of a Binary Tree Using Recursion
  6. 6Postorder Traversal of a Binary Tree using Iteration
  7. 7Level Order Traversal of a Binary Tree using Recursion
  8. 8Level Order Traversal of a Binary Tree using Iteration
  9. 9Reverse Level Order Traversal of a Binary Tree using Iteration
  10. 10Reverse Level Order Traversal of a Binary Tree using Recursion
  11. 11Find Height of a Binary Tree
  12. 12Find Diameter of a Binary Tree
  13. 13Find Mirror of a Binary Tree
  14. 14Left View of a Binary Tree
  15. 15Right View of a Binary Tree
  16. 16Top View of a Binary Tree
  17. 17Bottom View of a Binary Tree
  18. 18Zigzag Traversal of a Binary Tree
  19. 19Check if a Binary Tree is Balanced
  20. 20Diagonal Traversal of a Binary Tree
  21. 21Boundary Traversal of a Binary Tree
  22. 22Construct a Binary Tree from a String with Bracket Representation
  23. 23Convert a Binary Tree into a Doubly Linked List
  24. 24Convert a Binary Tree into a Sum Tree
  25. 25Find Minimum Swaps Required to Convert a Binary Tree into a BST
  26. 26Check if a Binary Tree is a Sum Tree
  27. 27Check if All Leaf Nodes are at the Same Level in a Binary Tree
  28. 28Lowest Common Ancestor (LCA) in a Binary Tree
  29. 29Solve the Tree Isomorphism Problem
  30. 30Check if a Binary Tree Contains Duplicate Subtrees of Size 2 or More
  31. 31Check if Two Binary Trees are Mirror Images
  32. 32Calculate the Sum of Nodes on the Longest Path from Root to Leaf in a Binary Tree
  33. 33Print All Paths in a Binary Tree with a Given Sum
  34. 34Find the Distance Between Two Nodes in a Binary Tree
  35. 35Find the kth Ancestor of a Node in a Binary Tree
  36. 36Find All Duplicate Subtrees in a Binary Tree
GraphsGraphs46
❯
  1. 1Breadth-First Search in Graphs
  2. 2Depth-First Search in Graphs
  3. 3Number of Provinces in an Undirected Graph
  4. 4Connected Components in a Matrix
  5. 5Rotten Oranges Problem - BFS in Matrix
  6. 6Flood Fill Algorithm - Graph Based
  7. 7Detect Cycle in an Undirected Graph using DFS
  8. 8Detect Cycle in an Undirected Graph using BFS
  9. 9Distance of Nearest Cell Having 1 - Grid BFS
  10. 10Surrounded Regions in Matrix using Graph Traversal
  11. 11Number of Enclaves in Grid
  12. 12Word Ladder - Shortest Transformation using Graph
  13. 13Word Ladder II - All Shortest Transformation Sequences
  14. 14Number of Distinct Islands using DFS
  15. 15Check if a Graph is Bipartite using DFS
  16. 16Topological Sort Using DFS
  17. 17Topological Sort using Kahn's Algorithm
  18. 18Cycle Detection in Directed Graph using BFS
  19. 19Course Schedule - Task Ordering with Prerequisites
  20. 20Course Schedule 2 - Task Ordering Using Topological Sort
  21. 21Find Eventual Safe States in a Directed Graph
  22. 22Alien Dictionary Character Order
  23. 23Shortest Path in Undirected Graph with Unit Distance
  24. 24Shortest Path in DAG using Topological Sort
  25. 25Dijkstra's Algorithm Using Set - Shortest Path in Graph
  26. 26Dijkstra’s Algorithm Using Priority Queue
  27. 27Shortest Distance in a Binary Maze using BFS
  28. 28Path With Minimum Effort in Grid using Graphs
  29. 29Cheapest Flights Within K Stops - Graph Problem
  30. 30Number of Ways to Reach Destination in Shortest Time - Graph Problem
  31. 31Minimum Multiplications to Reach End - Graph BFS
  32. 32Bellman-Ford Algorithm for Shortest Paths
  33. 33Floyd Warshall Algorithm for All-Pairs Shortest Path
  34. 34Find the City With the Fewest Reachable Neighbours
  35. 35Minimum Spanning Tree in Graphs
  36. 36Prim's Algorithm for Minimum Spanning Tree
  37. 37Disjoint Set (Union-Find) with Union by Rank and Path Compression
  38. 38Kruskal's Algorithm - Minimum Spanning Tree
  39. 39Minimum Operations to Make Network Connected
  40. 40Most Stones Removed with Same Row or Column
  41. 41Accounts Merge Problem using Disjoint Set Union
  42. 42Number of Islands II - Online Queries using DSU
  43. 43Making a Large Island Using DSU
  44. 44Bridges in Graph using Tarjan's Algorithm
  45. 45Articulation Points in Graphs
  46. 46Strongly Connected Components using Kosaraju's Algorithm

Roman Number to Integer

Strings

Contents

ProblemExamplesSolutionAlgorithmCodeTimeSpace

Problem Statement❯

Given a Roman numeral string, your task is to convert it into its corresponding integer value.

Roman numerals are represented by combinations of the following characters:

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

Some combinations follow a subtractive pattern, such as:

  • IV = 4
  • IX = 9
  • XL = 40
  • XC = 90
  • CD = 400
  • CM = 900

Your job is to correctly interpret these symbols and return the total integer value. The input string is guaranteed to be a valid Roman numeral or an empty string.

Examples❯

Input (Roman) Output (Integer) Description
"III" 3 Simple addition: 1 + 1 + 1 = 3
"IV" 4 Subtractive case: 5 - 1 = 4
"IX" 9 Subtractive case: 10 - 1 = 9
"LVIII" 58 50 + 5 + 1 + 1 + 1 = 58
"MCMXCIV" 1994 1000 + (1000 - 100) + (100 - 10) + (5 - 1) = 1994
"X" 10 Single symbol: 10
"" 0 Empty string returns 0

Solution❯

To convert a Roman numeral to an integer, we need to carefully process the characters from left to right.

Understanding Roman Numerals

Each Roman character represents a fixed value. For example, I = 1, V = 5, X = 10, etc. Normally, you just add these values together. So VIII = 5 + 1 + 1 + 1 = 8.

But Wait – Some Subtractive Cases

Sometimes a smaller value appears before a larger one, which means we subtract instead of add. For example:

  • IV = 4 (5 - 1)
  • IX = 9 (10 - 1)
  • XL = 40 (50 - 10)

So, while scanning from left to right, if the current character has a value less than the next, we subtract it. Otherwise, we add it.

How This Works in Practice

Let’s take MCMXCIV as an example:

  • M = 1000 (add)
  • CM = 900 (100 before 1000 → subtract 100)
  • XC = 90 (10 before 100 → subtract 10)
  • IV = 4 (1 before 5 → subtract 1)

Total: 1000 + 900 + 90 + 4 = 1994

What Happens with an Empty String?

If the input is empty, we simply return 0. There’s nothing to convert.

Conclusion

This approach is both simple and efficient. By carefully comparing each character with the next one, we can accurately compute the total integer value. It works in O(n) time where n is the length of the Roman numeral.

Algorithm Steps❯

  1. Create a map of Roman characters to their integer values.
  2. Initialize result = 0.
  3. Iterate over the string from left to right:
  4. → If current value is less than next value, subtract it.
  5. → Else, add it.
  6. Return the final result.

Code

Python
Java
JavaScript
C
C++
C#
Kotlin
Swift
Go
Php
def roman_to_int(s):
    roman_map = {'I': 1, 'V': 5, 'X': 10, 'L': 50,
                 'C': 100, 'D': 500, 'M': 1000}
    total = 0
    prev = 0

    for ch in reversed(s):
        curr = roman_map[ch]
        if curr < prev:
            total -= curr  # Subtract if smaller numeral before larger one
        else:
            total += curr  # Add otherwise
        prev = curr

    return total

# Example
print(roman_to_int("MCMXCIV"))  # Output: 1994

Time Complexity❯

CaseTime ComplexityExplanation
Best CaseO(n)The algorithm goes through the Roman numeral string once, where n is its length.
Average CaseO(n)In all scenarios, every character is processed once.
Worst CaseO(n)No matter the combination, we always loop through all characters.

Space Complexity❯

O(1)

Explanation: Only constant space is used to store the result and the mapping of characters.