To find the cartesian product of the given sets in TypeScript, we can use nested loops or the reduce
method to iterate through all the possible combinations of elements from each set.
Here is an example of using nested loops to find the cartesian product of the given sets:
index.ts491 chars17 lines
We use three nested for
loops to iterate through each set element and create an array containing all the combinations. Finally, we push each combination to a new array cartesianProduct
.
Alternatively, you can use the reduce
method to achieve the same result:
index.ts420 chars15 lines
Here, we use the reduce
method to iterate through each set and create an array containing all the combinations. The first reduce
call is used to iterate through set1
. For each element in set1
, we concat
its corresponding elements created by the inner reduce
call. The inner reduce
call iterates through set2
and returns an array of all combinations with val1
. Finally, we map
each element in the resulting array of set2
combinations to also include the corresponding val3
from set3
.
gistlibby LogSnag