catc | a simple tiny C Compiler using Lex & Yacc | Parser library

Correlated subquery approaches or a full cross join approach will all perform the task of comparing every row in one table with every row in the other (in one manner or another). Comparing (joining) all these rows when the tables get large get prohibitive. In these cases different approaches are needed.

Brute forcing won't be fast (if it even completes) so we need to be a bit more efficient in going about this. I tell clients to think about how they would do this query (by hand) if I gave them stacks of index cards. A person values their time so they don't go about this by making all possible combinations, they would come up with a more efficient way that they can complete quickly and get back to their lives. In cases like the one you are describing you need to find the more efficient approach. I'd be happy to talk to you more about building these types of queries.

Taking your data (and sprucing it up a bit for some more interesting cases) I created an example of how you can do this. (Yes, you could cross join the small tables and do this with simpler SQL but that won't scale.)

Data setup:

You can use REGEXP_SUBSTR, but you must specify the number of columns.

Based on what I understood from the question and gathered from comments. you are not looking for get_dummies since you may have a larger string not necessarily seperated by the ;. In that case its better that you use series.str.findall to return the values which match strings in cat. Then you can either join them and use str.get_dummies() or MultiLabelBinarizer:

After you've found the subcategory this condition item.id === chosenSubcategoryId would always be false.

To get the ids of the subcategory items, use an internal recursion. I've used Array.forEach() to iterate the items, add the ids to the respective arrays in the result (res), and iterate the children recursively.

I managed to fix it. The problem I had is that it gave a path away from the origin, I corrected it with the following:

As per the comment above, but to explain what's going on more simply:

I think you can put the logic of the inner-most loop in a function and then call that function based on the input. Alternatively, you can try to solve the same problem with recursion, wherein the user-input would define the recursion depth. Initialize a global variable depth and set that to 0. In the first line of the function, increment depth with 1 and every time the function will be called, it's value will be increased. In the base case, set a condition for the depth variable and the input variable to be equal, as soon as the depth variable == the input variable, the recursion will stop.

I think these things happen because when you click on that image it will trigger clickHandler: