Roman to Integer - Leetcode 13 - Java
8:56
Пікірлер
@pedroizidoro-q6j
@pedroizidoro-q6j 22 күн бұрын
great
@dipakdas3939
@dipakdas3939 Ай бұрын
❤❤❤❤
@ErRekhaKumari
@ErRekhaKumari 2 ай бұрын
Happy Coding 😊
@swaritthakare3081
@swaritthakare3081 2 ай бұрын
Thank you 🫰
@anshasati1920
@anshasati1920 3 ай бұрын
Very well explained!
@divakart9460
@divakart9460 4 ай бұрын
NICE 🎉
@dkharyana-de5cx
@dkharyana-de5cx 4 ай бұрын
Nice explanation
@sandman.38
@sandman.38 5 ай бұрын
I saw this solution in TS, it was so confusing but this explanation cleared everything up. It makes a lot of sense, it's like a sliding window, you're just upping the frequency of each number already present when shifting each duplicate to become a unique number wow. Ty!
@k5kc
@k5kc 5 ай бұрын
Glad that it makes sense to you :)
@nicos.6019
@nicos.6019 7 ай бұрын
Nice Video, straight to the point and the slides are well made