Basics 0/97

Complete search: enumerating candidate solutions · 3 of 3

Subsets and permutations

Loop over every subset with a bit mask and over every ordering with the library, without counting a repeated string twice.

2,707 words · 13 min read

Difficulty: how hard each problem is if its topic is new to you.

Core 5

Additional practice 5