Given 2 strings `target` and `source`, find the minimum number of steps to make `target` a substring of `source`. In 1 step you can take a substring of `source` and append it at the end of `source`.\n\n**Example 1:**\n```\nInput: target = "abcd", source = "dbcfda"\nOutput: 2\nExplanation:\nThe target string can be constracted as follow "dbcfda" + "bc" + "d" = "dbcfdabcd"\nSo the minimum number of steps is 2.\n```\n\n**Example 2:**\n```\nInput: target = "abc", source = "abdabb"\nOutput: -1\n```\n\n**Example 3:**\n```\nInput: target = "abcd", source = "fabcda"\nOutput: 0\n```

Given 2 strings target and source, find the minimum number of steps to make target a substring of source. In 1 step you can take a substring of source and appen