Challenge #265: Keep In Touch

[ARussell34]

I had to re-read that they had to be states that are touching to have all the possible two-letter state abbreviation combos.

[ahsanaali]

See solution solution. 

Understanding question / "the ask" is 50% of the solution. Totally misunderstood it at the beginning and had to look into the solution.

[JamesCharnley]

Spoiler

I think this might be one of the best challenges out there. Great concept and fun logic

[RWvanLeeuwen]

here's my take

Spoiler

i opted to show all possible combinations in the solution outputsort the letters twice, join the result setcounting distinct words per state that is part of a solution

[SkomantasTamulaitis]

Tough one. Spend a good 3h on this, primarily because for the first 2.5h I thought that "four states that border each other" meant that each state in that group of 4 had to boarder the same 3 states. There's only one such instance CO, UT, AZ, and MN. After discovering that this is not the question, I started over and turned to other solutions which taught me that you can identify spatial objects that touch each other using a formula tool! Thanks @JamesCharnley 

Spoiler

[grazitti_sapna]

Solution

[TungThanhHo]

my solution

[BSilverblatt]

Thanks for the challenge! Here's my solution:

[kristiadiuisan]

Spoiler

[ed_hayter]

Spoiler

Made a bit of a meal of this. It is impressive what you can do with some joins though. Made the mistake of deleting my workflow of pairs and then had the pain of rethinking that part of the workflow. What I will say is a key takeaway of this challenge is not to just trial and error joins. When you use a join you should have a strong sense of a plan of what you are joining on and for and what you want the end result to look like.