Given a list of clothing items [A, B, C, ...] and a list of illegal outfits [[A, B], [A, C], ...], return the number of legal outfit combinations. A combination has to have at least 1 outfit and must not contain any illegal combination. I used backtracking to solve it. Thought my solution was super inefficient but it passed all the test cases.