Personality Traits

This problem is straightforward. Generate all permutations of $S$, check is $T$ is a subsequence and count how many swap occurred. If swap count is less or equal to $K$ then increment the answer. To generate all permutations, in $C++$ you can use std::next_permutation(). Total Complexity will be $O(n! * n^2)$.

Solution