This flow is a replication of the Levenshtein Distance algorithm to calculate string similarity (number of steps required to make two strings same). The flow is a manual trigger based and accepts two string inputs (this can however be integrated with any other flow and the strings can be passed dynamically)
Thank you for this, this saves me a lot of time, this is awesome and I greatly appreciate you posting this. I will give this a shot on my current project and hope it is still functional 2.5 years after this post! 😄