Hi. it's been a while.
These days, I've started studying JS again.
I solved a JS algorithm problem.
This problem is part of the Top 150 Interview Questions,
so I have to solve it.
anyway, I think it is about Array problem.
I first converted the String to an array and then used a for loop and an if statement.
We need to save time, so I count backwards like this.
so my submission is~~!!
I'm not sure if it's the best solution actually,
but I'm satisfied with the result. It was really hard to solve the problem by myself without Googling, but I solved it 100% on my own. So, I'm proud of myself.👩🏻💻😆
Now, I'll go to bed. Good night, stranger.
good night stranger.
'열정가득한 개발자의 이야기 > Javascript Algorithm' 카테고리의 다른 글
1207. Unique Number of Occurrences (Javascript) (0) | 2024.09.29 |
---|---|
3005. Count Elements With Maximum Frequency (javascript) (3) | 2024.09.28 |
392. Is Subsequence (Javascript) (0) | 2024.09.23 |