Question

Google | OA | Online Coding Test Questions and Solutions | Set - 40 | 2022

Answer 1

Approach:
5 pairs of (i,j): {(2,4), (2,5), (4,5), (3,5),(3,4)} satisfying the given inequality. Therefore, the answer is 5.

My approach:
Brute force, O(N^2):

for(int i=0;i<n-1;i++){
    for(int j=i+1;j<n;j++){
        if(ai-aj+c <= bi-bj+d)
           count++;

Answer 2

Q1. Count Pairs
Given 2 integer arrays, a and b and 2 integers c and d, find the pairs of i,j such that
(ai - aj+c) <= (bi - bj + d), where i<j.
Sample Test Case:
Given:
n = 5
c = 3
d = 2
Array a = [9,4,2,3,6]
Array b = [1,4,3,1,2]