Yan Cui
I help clients go faster for less using serverless technologies.
This article is brought to you by
Don’t reinvent the patterns. Catalyst gives you consistent APIs for messaging, data, and workflow with key microservice patterns like circuit-breakers and retries for free.
One interesting problem I read about as I prepare for various technical interviews is the so called Anagram Substring Search problem where it can be boiled down to the question “find all permutations of s within b“.
Naturally, after all my endeavours with Project Euler and Advent of Code, I cast my mind to how I’d solve this in F#, and it turned out easier than I imagined 
The trick is that if you sort the characters in both strings alphabetically then you can leverage F#’s structural comparison for arrays to check if the two strings are anagrams. Essentially, you only need to answer the question “do the same characters exist in both strings?”, and sorting both strings the same way lets you achieve that really easily.
Try it Yourself
Links
- CareerCup question for Google
- Question on GeeksForGeeks
- DotNetFiddle script
- All my Project Euler solutions in F#
- All my Advent of Code solutions in F#
Whenever you’re ready, here are 3 ways I can help you:
- Production-Ready Serverless: Join 20+ AWS Heroes & Community Builders and 1000+ other students in levelling up your serverless game. This is your one-stop shop for quickly levelling up your serverless skills.
- I help clients launch product ideas, improve their development processes and upskill their teams. If you’d like to work together, then let’s get in touch.
- Join my community on Discord, ask questions, and join the discussion on all things AWS and Serverless.