Uploaded March 2026 | Updated September 2026, 2 weeks ago
A minimalist string algorithm developer challenge: write a function in any language that returns the first non-repeating character in a string, or null if every character repeats. Our example Python version solves it in 87 characters. Your turn: Can you make it shorter? Which language gives you the cleanest frequency counting? Can you make it O(n)? Share your solution in the comments!
Subscribe to Google for Developers → https://goo.gle/developers
Speaker: Christine Rafla
A minimalist string algorithm developer challenge: write a function in any language that returns the first non-repeating character in a string, or null if every character repeats. Our example Python version solves it in 87 characters. Your turn: Can you make it shorter? Which language gives you the cleanest frequency counting? Can you make it O(n)? Share your solution in the comments!
Subscribe to Google for Developers → https://goo.gle/developers
Speaker: Christine Rafla
