Program to find maximum difference of any number and its next smaller number in Python

Suppose we have a list of numbers called nums, we have to find the maximum difference that exists between any number and the next smaller number. Our goal is to solve this in linear time.

So, if the input is like nums = [14, 2, 6, 35, 12], then the output will be 21, as 35 and 14 have the largest difference of 21.

To solve this, we will follow these steps −

• max_val := maximum of nums, min_val := minimum of nums

• if max_val is same as min_val, then

  • return 0

• delta := (max_val − min_val) / (size of nums − 1)

• min_map := an empty map (if some values are not there return value as inf)

• max_map := an empty map (if some values are not there return value as −inf)

• res := 0, idx := 0

• for each num in nums, do

  • idx := the floor of ((num − min_val) / delta)

  • max_map[idx] := maximum of max_map[idx] and num

  • min_map[idx] := minimum of min_map[idx] and num

• prev := min_val

• for i in range 0 to size of nums − 1, do

  • if min_map[i] is not same as inf , then

    • res := maximum of res and (min_map[i] − prev)

    • prev := max_map[i]

• return res

Let us see the following implementation to get better understanding −

Example

 Live Demo

from collections import defaultdict
import math
class Solution:
   def solve(self, nums):
      max_val = max(nums)
      min_val = min(nums)
      if max_val == min_val:
         return 0
      delta = (max_val − min_val) / (len(nums) − 1)
      min_map = defaultdict(lambda: float("inf"))
      max_map = defaultdict(lambda: float("−inf"))
      res = 0
      idx = 0
      for num in nums:
         idx = math.floor((num − min_val) / delta)
         max_map[idx] = max(max_map[idx], num)
         min_map[idx] = min(min_map[idx], num)
      prev = min_val
      for i in range(len(nums)):
         if min_map[i] != float("inf"):
            res = max(res, min_map[i] − prev)
            prev = max_map[i]
      return res
ob = Solution()
nums = [14, 2, 6, 35, 12]
print(ob.solve(nums))

Input

[14, 2, 6, 35, 12]

Output

21

Arnab Chakraborty

Published on 26-Dec-2020 11:08:03

• Related Questions & Answers
• Program to find maximum number by adding 5 at any place in Python
• Find sum of a number and its maximum prime factor in C++
• Program to find maximum number of eaten apples in Python
• Find maximum difference between nearest left and right smaller elements in Python
• Difference between a number and its reversed number JavaScript
• Find next Smaller of next Greater in an array in C++
• Program to find maximum number of non-overlapping substrings in Python
• Program to find number of columns flips to get maximum number of equal Rows in Python?
• Program to find maximum number of balanced groups of parentheses in Python
• Find the closest and smaller tidy number in C++
• Number of smaller and larger elements - JavaScript
• Program to find maximum number of coins we can collect in Python
• Program to find maximum number of balls in a box using Python
• Program to find maximum number of groups getting fresh donuts in Python
• Find the maximum number of composite summands of a number in Python