Write For Us

Can you beat Python's brevity while keeping it efficient? Go!

E-Commerce Solutions SEO Solutions Marketing Solutions
18 Views

  • Thanks! Share it with your friends!

    You disliked this video. Thanks for the feedback!

ava
Published
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
Category
Project
Tags
Google, developers, pr_pr: Google for Developers;
Sign in or sign up to post comments.
Be the first to comment

Up Next