LeetCode Tutorial 13. Roman to Integer

preview_player
Показать описание
GoodTecher LeetCode Tutorial 13. Roman to Integer

LeetCode Tutorial by GoodTecher. The tutorial provides a step-by-step demonstration on how to solve coding problems.

Complete Playlist for the GoodTecher LeetCode Tutorial:

GoodTecher Website:

GoodTecher Channel on YouTube:

GoodTecher Github:

GoodTecher Facebook

GoodTecher Twitter
Рекомендации по теме
Комментарии
Автор

These "Easy" challenges in Leetcode are kicking my ass.

Auzep
Автор

Thank you for such a good explanation. I do get confused between retrieving the values in terms of code in general, but i'll keep practicing to get the numbers speak to me. Thank you, you are a Great Teacher !

Priyanka-lxxw
Автор

Very elegant logic! No need to consider special pairs!

anant
Автор

have been trying this problem using a dictionary and iterating over the string with two pointer values. When a subtraction case is found, the pointer increments by 2. Otherwise, it just increments by 1. Turns out that this is quite problematic because it occasionally skips over the last character :((

matthewsmith
Автор

what was your approach when you first saw the problem

dolphinwhale
Автор

Very well explained, easy and concise

karantyagi
Автор

Excellent explanation with help of IX and XI :)

srinis
Автор

good video! really like your problem solving process! Just a quick question, how did you find the pattern of adding Roman letters backwards? thanks!

JJ-Bond
Автор

hello! You can just use an array itself for storing (of size 128)

mithunraam
Автор

I dont get the idea of line 17. Can you explain? Thank you!

LeoGoldenLabrador