elimination of repeated sequences in a simple combination se

[Guest]

Hello everyone, I would like to understand the operation of eliminating repeated strings in a simple combination set.

Let's say I have the following tens: [07, 12, 24, 32, 37, 41, 42, 54, 55]

And I want to make combinations of 6, so I make C 9.6 = 84

Let's say I wanted to optimize this set, and select only the strings that have a single court, that is, I want to eliminate the repetition of the blocks.

What criteria do I use to do this elimination, I found some programs on the internet that do the elimination, but I didn't understand the algorithm to do the eliminations