We have extended our Early Bird Tickets for Inspire 2023! Discounted pricing goes until February 24th. Save your spot!

Alteryx Designer Discussions

Find answers, ask questions, and share expertise about Alteryx Designer and Intelligence Suite.
SOLVED

All Possible Combinations - Unique Combination Where Order Doesn't Matter

csmith11
11 - Bolide

While I was working on building out a tool to compare every file in a given directory against another file in the same directory, I came across a old problem.

 

This is an old SQL pro tip I learned back in college from one of my professors. Unfortunately, until this morning I'd forgotten this technique. A coworker of mine help me relearn and build this scenario out.

 

To simplify the scenario we've used A,B,C,D,E, to represent file names.

 

The object was to get a list of all combinations without any combo of A, A or  B,B, Ect.

We also wished to eliminate any duplicate combos for example B,A would be a duplicate of A,B.

 

See Example Data Below

 

 

csmith11_1-1631111923874.png 

 

 

csmith11_2-1631112007657.png

 

I built this solution into a reusable macro, and want to put it out into the community incase it wasn't already out there. Hopefully, it'll prove useful so someone else.

Please like this post if you find this solution valuable.

csmith11_3-1631112799107.png

 

 

 

 

 

 

 

 

1 REPLY 1
csmith11
11 - Bolide

See Attached Macro for Solution.

Labels