I have a solution for Advent of Code 17-2015. https://github.com/PuercoPop/advent-of-code/blob/31e12f8db6807586fd5a4197d22390f8b390ca56/2015/17.dyalog. It works but I'd like some feedback on how to improve it. Specific questions I have:
- How can I reshape ss to be able to count length of the subsets that matched the condition with ⍴¨?
- Is there a way to use ⊢ to avoid having to repeat ps i on both sides of ⊆?