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)
