Re-sorting nested lists by matching index

I have two lists each containing 3 nested sublists (see image, left of the bold black line). Each group of 3 nested lists all have the same total number of indices but one group of 3 has more indices in each nested list. I am trying to create a definition that re-sorts/pairs values by their index number into new nested lists of 3 (see image, final Watch node). I want to be able to map the function across both lists so that it re-sorts regardless of the different number of items in each. Does anyone have any suggestions?


list question


Vikram, this is exactly what I needed. Thanks.

1 Like