Can you beat Python's brevity while keeping it efficient? Go!
8 061
19.2
Google Developers2.63M
Next
63 days – 9 4280:08Popular
50 days – 4 7660:36
105 days – 14 2600:08Published on 16 Mar 2026, 13:01
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 → goo.gle/developers
Speaker: Christine Rafla
Subscribe to Google for Developers → goo.gle/developers
Speaker: Christine Rafla
Fresh videos
11 hours – 1124:59
1 day – 1 0330:11
1 day – 5024:07
1 day – 1 6450:18
6 days – 1 3500:36
10 days – 8020:23Random videos
4 days – 2 085 3140:59
30.04.25 – 8683:15
07.10.24 – 317 1251:15
09.10.23 – 4751:39
28.10.21 – 5 1676:04
28.08.14 – 64 18215:37
1 day – 8920:34
4 days – 1021:37
4 days – 7 8704:28
5 days – 2673:42
5 days – 1 00814:01
5 days – 731 8920:38
7 days – 65 87811:08