-3
Objective
Given a string txt and a string pat, your task is to find all occurrences of pat and its k-tuples in txt, but with the following constraints:
Character Frequency Constraint: You can only use characters from pat
that appear in txt at least as many times as they do in pat. If pat
contain...