How to find all subsets using backtracking?

Question

Programming

In general: There is a set (array) which consists of capital letters of the Latin alphabet. The length of the set is set by the user (no more than 26). It is necessary to find all subsets that consist of N elements using the backtracking method.
At least a simple example program :)