1st question: Coin Change II variant. 2nd question: Union Find with Sizes (forget the question name). 3rd question: Given a list of ints, an operation is to add 1 to all ints that are prefixes or suffixes of the list. Determine the minimum operations needed to turn list A to list B; if not possible, return -1.
Sigiloso
1st: dp 2nd: union find 3rd: failed