awelgorithms

// free skill check

find the skill you're actually missing.

16 questions, about 10 minutes, no sign-up. You get a skill map across hash maps, two pointers, sliding window and stacks, plus the one skill to practice next.

01 / 16// hash maps

Return the first character in a string that appears exactly once. What is the cleanest O(n) approach?