Discussion on "Javascript: Use a Hash Map to solve "First Non-Repeating Character" in O(n) time"

Austin · 2023-06-01T18:45:34.055Z

If you're struggling with LeetCode problems, algorithms and data structures, or job interview prep, hash maps are a great tool to have in your tool belt. They're fast, flexible, and easy to implement. Other languages like Ruby utilize hashes specific...

Hey, you're back! Well, for this I'd use a simple two column array

BASIC code at forums.craigslist.org

I neglected to put a guard around that first For loop in case the string was empty, oops

Glad to be back :)

I never would have thought of using ASCII math, that's a neat tactic. This would be another O(n) solution right?

I wonder how long it'll be until I post one of these that you couldn't solve in BASIC, you're quick!

Austin It's O(n) since it's one pass through the string and then one pass through the array whose size is constant no matter how big the string gets.

Bring it on! If I can't quickly solve it in BASIC, I probably could in 1983 8-bit Atari LOGO

Still more edits lol — If you're looking for some really crazy challenges, try some Knuth

Austin Hey, you still alive? Is this an actual leetcode problem? If so, I can't find it. I'm mainly tackling the hard problems in C (the closest thing to BASIC they have lol) but I figured I'd convert the BASIC solutions I posted back in 2023 to C and actually submit them

EDIT: Is it 387. First Unique Character in a String? Looks like it

Discussion

Javascript: Use a Hash Map to solve "First Non-Repeating Character" in O(n) time

Responses(1)

Recent in Forum

Search Hashnode

Javascript: Use a Hash Map to solve "First Non-Repeating Character" in O(n) time

Responses(1)

Recent in Forum