Minimize (max(A[i], B[j], C[k]) – min(A[i], B[j], C[k])) of three different sorted arrays in Python

Suppose we have three sorted arrays A, B, and C (these can be of different sizes), we have to find compute the minimum absolute difference between the maximum and minimum number of any triplet (A[i],B[j],C[k]) such that they are under arrays A, B and C respectively,

So, if the input is like A : [ 2, 5, 6, 9, 11 ], B : [ 7, 10, 16 ], C : [ 3, 4, 7, 7 ] , then the output will be 1 as by selecting A[i] = 6 B[j] = 7 and C[k] = 7, we will get the minimum difference as max(A[i], B[j], C[k]) - min(A[i], B[j], C[k])) = |7-6| = 1

To solve this, we will follow these steps −

• i := size of A - 1
• j := size of B - 1
• k := size of C - 1
• minimum_dfference := |maximum of A[i], B[j], C[k] - minimum of A[i], B[j], C[k]|
• while i is not same as -1 and j is not same as -1 and k is not same as -1, do
  • current_diff := |maximum of A[i], B[j], C[k] - minimum of A[i], B[j], C[k]|
  • if current_diff < minimum_dfference is non-zero, then
    • minimum_dfference := current_diff
  • maximum_term := maximum of A[i], B[j], C[k]
  • if A[i] is same as maximum_term, then
    • i := i - 1
  • otherwise when B[j] is same as maximum_term, then
    • j := j - 1
  • otherwise,
    • k := k - 1>
• return minimum_dfference

Example

Let us see the following implementation to get better understanding −

 Live Demo

def solve(A, B, C):
   i = len(A) - 1
   j = len(B) - 1
   k = len(C) - 1
   minimum_dfference = abs(max(A[i], B[j], C[k]) - min(A[i], B[j], C[k]))
   while i != -1 and j != -1 and k != -1:
      current_diff = abs(max(A[i], B[j], C[k]) - min(A[i], B[j], C[k]))
      if current_diff < minimum_dfference:
         minimum_dfference = current_diff
      maximum_term = max(A[i], B[j], C[k])
      if A[i] == maximum_term:
         i -= 1
      elif B[j] == maximum_term:
         j -= 1
      else:
         k -= 1
   return minimum_dfference
A = [ 2, 5, 6, 9, 11 ]
B = [ 7, 10, 16 ]
C = [ 3, 4, 7, 7 ]
print(solve(A, B, C))

Input

A = [ 2, 5, 6, 9, 11 ] B = [ 7, 10, 16 ] C = [ 3, 4, 7, 7 ]

Output

1

Arnab Chakraborty

Published on 27-Aug-2020 12:23:16

• Related Questions & Answers
• Minimize (max(A[i], B[j], C[k]) – min(A[i], B[j], C[k])) of three different sorted arrays in C++
• Count the triplets such that A[i] < B[j] < C[k] in C++
• Construct a Turing machine for L = {aibjck | i*j = k; i, j, k ≥ 1}
• Count pairs (i,j) such that (i+j) is divisible by both A and B in C++
• Maximize arr[j] – arr[i] + arr[l] – arr[k], such that i < j < k < l in C++
• Count frequency of k in a matrix of size n where matrix(i, j) = i+j in C++
• Maximum value of |arr[i] – arr[j] - + |i – j| in C++
• Find maximum sum of triplets in an array such than i < j < k and a[i] < a[j] < a[k] in C++
• Find Maximum value of abs(i – j) * min(arr[i], arr[j]) in an array arr[] in C++
• Maximize value of (arr[i] – i) – (arr[j] – j) in an array in C++
• Find maximum sum of triplets in an array such than i < j < k and a[i] < a[j] < a[k] in Python
• Program to find a pair (i, j) where nums[i] + nums[j] + (i -j) is maximized in Python?
• Count number of pairs (i, j) such that arr[i] * arr[j] > arr[i] + arr[j] in C++
• Construct a Turing machine for L = {aibjck | i>j>k; k ≥ 1}
• Count of unique pairs (arr[i], arr[j]) such that i < j in C++