Roman to Integer - LeetCode 13 | Java

Published: 24 June 2022
on channel: Code with Carter

13,438

265

Question: https://leetcode.com/problems/roman-t...

Today I solve and explain a Easy level difficulty leetcode SQL problem using Java called "13. Roman to Integer"

The approach I took was using a switch case to quickly translate the characters to it's corresponding integer value. With every iteration I look up the integer translation and add it to the count.

The main trick is that if the previous number is smaller than the current number we want to decrement the current running sum by the previous number. Otherwise we simply add the current number.

Time complexity: O(N)
Space complexity: O(1)

Code Solution Post: (Sign into LeetCode to view)
https://leetcode.com/problems/roman-t...

Checkout my Blog Post: "Reflecting on 1 Year of LeetCode"
/ reflecting-on-1-year-of-leetcode

If you found this helpful Like and Subscribe! I solve LeetCode Algorithms and SQL Problems daily!

#leetcode #java #tutorial #leetcode #algorithm #faang

On this page of the site you can watch the video online Roman to Integer - LeetCode 13 | Java with a duration of hours minute second in good quality, which was uploaded by the user Code with Carter 24 June 2022, share the link with friends and acquaintances, this video has already been watched 13,438 times on youtube and it was liked by 265 viewers. Enjoy your viewing!

264,230

6.9K