Anagram Substring Search problem in F#

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

Liked this article? Support me on Patreon and get direct help from me via a private Slack channel or 1-2-1 mentoring.
Subscribe to my newsletter


Hi, I’m Yan. I’m an AWS Serverless Hero and the author of Production-Ready Serverless.

I specialise in rapidly transitioning teams to serverless and building production-ready services on AWS.

Are you struggling with serverless or need guidance on best practices? Do you want someone to review your architecture and help you avoid costly mistakes down the line? Whatever the case, I’m here to help.

Hire me.


Check out my new course, Complete Guide to AWS Step Functions. In this course, we’ll cover everything you need to know to use AWS Step Functions service effectively. Including basic concepts, HTTP and event triggers, activities, callbacks, nested workflows, design patterns and best practices.

Get Your Copy