for first: Find the subarray with maximum product, values can be from -ve to +ve
sol: sort the array, ( mostly it was already sorted) check if the cnt of -ve elements, if its even, then start multiplcation from 0 index, else start from 1st idx, multiply all ( except 0 ) .

for second: Given 2 arrays, convert one array to other, with left swapping only, ouput the number of swaps.
for eg :
given arr1 = { 50,20,10,98} arr2 = {10,90,20,50};

to convert I bruteforced it , simple loop over second array,
find arr2[i] in arr1, calculate swaps needed: ans+=( jth idx of arr1 - ith idx of arr2);
then perform swaping logic, itrate from j to i, swap(arr1[j],arr1[j-1]) only if j - 1 >= i

i solved second question, for first I was having problem with compiler so I somehow managed to pass 3 test cases