The problem description:
I have tree lists (dropdowns, actually) suppose a,b & c , initially having x,y & z number of items respectively.
When i select any option from one of the lists, one of the two things can happen:
a. The options in the other lists remain the same
b. The one or more options in the other lists gets flitered (i.e. removed) from the list
This removal of items is not predictable. Now the user can select an option in the other list, resulting in more filtering, and so on.
Considering that the sequence of selection of matters. I would like to have an algorithm that could get me the ways in which the user can select all possible combiantions from these three lists.
I have thought about this, but did not get any success. Any help would be greatly appreciated!