Google Apprenticeship OA | Software Development | Kumar K | Set - 48

Question

Answer 1

ok a variation of count inversion problem
rearrange the equation as (ai-bi) + (c-d) <= (aj-bj)
now make an array of (ai-bi) for all i = 0 -> n-1 and count these pairs