Hi All,
I got an array question in OA and I can't find a similar question on Leetcode. Please share a link if you know this question.

There is an unsorted array. The requirement is to return no. of swaps required to fullfill the below constraint.

if arr[i]>arr[j] and i<j then swap the elements. '

The array length can be in the range 1<=len(arr0<=10^9.

The second question I got was this one. https://leetcode.com/problems/robot-bounded-in-circle/