Hi there! I am new to this forum.
There is a question I was thinking of for several weeks.
Assume you have an app with a predefined list of products. Each user has the possibility to select these products and build up a set of his own products.
This means that every user has a set of products. The question is now if it is possible to search for different products (at once!) and receive the sets that have most of the products in common - e.g. where the intersection has the highest cardinality.
set_of_user_1: [ 'product_1', 'product_2', 'product_3'], set_of_user_2: [ 'product_3', 'product_5', 'product_9'], set_of_user_3: [ 'product_4', 'product_7', 'product_9'],
Then I want to search for:
(is this possible?)
which should return
in this order. I am hoping there is a solution for this.