- Trending Categories
- Data Structure
- Networking
- RDBMS
- Operating System
- Java
- iOS
- HTML
- CSS
- Android
- Python
- C Programming
- C++
- C#
- MongoDB
- MySQL
- Javascript
- PHP

- Selected Reading
- UPSC IAS Exams Notes
- Developer's Best Practices
- Questions and Answers
- Effective Resume Writing
- HR Interview Questions
- Computer Glossary
- Who is Who

Suppose we have two arrays (non-growing) nums1 and nums2. The index pair (i, j) with 0 <= i < size of nums1, and 0 <= j < size of nums2 is valid if i <= j and nums1 [i] <= nums2 [j] is true. The pair distance is denoted as (j - i). We have to find the maximum distance from each valid pair (i,j). If there are no valid pairs, return 0.

So, if the input is like nums1 = [60,40,15,10,5], nums2 = [115,30,25,15,10], then the output willbe 1 because, here valid pairs are (0,0), (2,2), (2,3), (3,3), (3,4) and (4,4), here maximum distance is 1 for either pair (2,3) or pair (3,4)

To solve this, we will follow these steps −

if last element of nums1 > first eoelement of nums2, then

return 0

i := 0, j := 0 and max_dist := 0

while i < size of nums1, do

if j < size of nums2 and nums1[i] <= nums2[j], then

max_dist := maximum of max_dist and (j-i)

j := j + 1

otherwise,

j := j + 1

i := i + 1

return max_dist

Let us see the following implementation to get better understanding −

def solve(nums1, nums2): if nums1[len(nums1)-1] > nums2[0]: return 0 i = j = max_dist = 0 while i < len(nums1): if j < len(nums2) and nums1[i] <= nums2[j]: max_dist = max(max_dist, j-i) j += 1 else: j += 1 i += 1 return max_dist nums1 = [60,40,15,10,5] nums2 = [115,30,25,15,10] print(solve(nums1, nums2))

[60,40,15,10,5], [115,30,25,15,10]

1

- Related Questions & Answers
- Program to find maximum distance between empty and occupied seats in Python
- Program to find largest distance pair from two list of numbers in Python
- Find maximum distance between any city and station in Python
- Find Maximum difference pair in Python
- Program to find distance of shortest bridge between islands in Python
- Program to find smallest pair sum where distance is not consecutive in Python
- Find the shortest distance between any pair of two different good nodes in C++
- Find K-th Smallest Pair Distance in C++
- Find maximum distance between any city and station in C++
- Program to find out distance between two nodes in a binary tree in Python
- Find distance between two nodes of a Binary Tree in C++ Program
- Program to find maximum value of k for which we can maintain safe distance in Python
- Program to find maximum number of consecutive values you can make in Python
- Program to find minimum total distance between house and nearest mailbox in Python
- Program to find maximum size of any sequence of given array where every pair is nice in Python

Advertisements