[ Thanks to Mike
Golvach for this link. ]
“Our objective in this whole set of exercises, again
is: Given a Number Pool of “x through y,” create the maximum
possible Fixed List Length variations of our Fixed List that
contain some variation of our Guaranteed Combination, without any
duplication (i.e. 1, 2, 3 is equal to 2, 3, 1 and would only count
as one match), and return the results.”
LinuxToday is a trusted, contributor-driven news resource supporting all types of Linux users. Our thriving international community engages with us through social media and frequent content contributions aimed at solving problems ranging from personal computing to enterprise-level IT operations. LinuxToday serves as a home for a community that struggles to find comparable information elsewhere on the web.
Advertiser Disclosure: Some of the products that appear on this site are from companies from which TechnologyAdvice receives compensation. This compensation may impact how and where products appear on this site including, for example, the order in which they appear. TechnologyAdvice does not include all companies or all types of products available in the marketplace.
