Loading the journal
Day 10Easy
LeetCode
LeetCodeRoman to Integer
Conditional Traversal / Hash Map LookupSolved Nov 7, 2025
Loading the journal
LeetCodeConditional Traversal / Hash Map LookupSolved Nov 7, 2025
8 in the last 6 months
Community-reported company tags from leetcode-company-wise-problems (updated 2026-10-08). Bar shows how often each company asks it.
Problem
Given a Roman numeral represented by the characters I, V, X, L, C, D, and M, convert it to an integer. The complexity lies in handling the subtraction rule where a smaller value precedes a larger one (e.g., IV = 4, CM = 900).
Reading the solution first feels like progress, but it makes the next similar problem — and the interview version — much harder, because you skipped the part where you figure it out. Give it an honest 20–30 minutes. Stuck? Re-read the pattern, watch the concept video, or try the brute force first.
Hidden: approach · solution code
Watch walkthrough