Given a linked list, swap every two adjacent nodes and return its head in codechef in python code example

Example 1: write a function that takes in 2 arrays , merges them together an then return the new array sorted

// const twoArraysSorted = (arr) => {
//     let copy = [...];
//     copy.sort((a,b) => a-b).map(el=> el*2)
//     return arr
// }

Example 2: Return the Cartesian product of this RDD and another one, that is, the RDD of all pairs of elements (a, b) where a is in self and b is in other.

rdd = sc.parallelize([1, 2])
sorted(rdd.cartesian(rdd).collect())
# [(1, 1), (1, 2), (2, 1), (2, 2)]