Minimize operations to make string Z equal to T by appending subsequence of S
Given two strings S and T, and an empty string Z, the task is to print the minimum operations required to make string Z equal to T by appending any subsequence of S at the end of Z. If it is impossible to do so, then print -1. Example: Input: S = "aabce", T="ace" Output: 1 Input: S = "abacaba", T =