https://leetcode.com/problems/shortest-way-to-form-string
Given two strings, A and B, determine the minimum number of cocatenations of subsequences of B to create A. Return -1 if not possible.

Ex:
A: allan
B: lan

Answer: 3 (lan + lan +lan)