Paypal reached out to me in March 2021. Below is first round of interview.\n\n```\nGiven input array.\nArr = [4, 8, 5,3,1]\n\nOutput all pair of elements satisfying below condition.\n(4,1) (8,2) (8,3) (8,1) (5,1) (3,1)\n\nCondition:\n(i,j) -> i and j are array indexes, i < j\nArr[i] > 2*Arr[j]\n\n```\n\nI have her solution using O(n2), she asked for better solution. We later reached to merge sort based solution. It can solved in similar way. In merge sort, the place where we compare if element is greater or lesser, replace that statement with arr[i] > 2*arr[j]. This lead to soltuion in O(n log n). I explained her full solution and entire interview hour went in solution finalization.\n\nSimilar to : https://leetcode.com/problems/reverse-pairs/\n\nRejected :(

Paypal reached out to me in March 2021. Below is first round of interview.\n\n\nGiven input array.\nArr = [4, 8, 5,3,1]\n\nOutput all pair of elements satisfyin