<filename>hard/python3/c0037_164_maximum-gap/00_leetcode_0037.py
# DRUNKWATER TEMPLATE(add description and prototypes)
# Question Title and Description on leetcode.com
# Function Declaration and Function Prototypes on leetcode.com
#164. Maximum Gap
#Given an unsorted array, find the maximum difference between the successive elements in its sorted form.
#Try to solve it in linear time/space.
#Return 0 if the array contains less than 2 elements.
#You may assume all elements in the array are non-negative integers and fit in the 32-bit signed integer range.
#Credits:
#Special thanks to @porker2008 for adding this problem and creating all test cases.
#class Solution:
#    def maximumGap(self, nums):
#        """
#        :type nums: List[int]
#        :rtype: int
#        """



# Time Is Money
<filename>hard/python3/c0037_164_maximum-gap/00_leetcode_0037.py
# DRUNKWATER TEMPLATE(add description and prototypes)
# Question Title and Description on leetcode.com
# Function Declaration and Function Prototypes on leetcode.com
#164. Maximum Gap
#Given an unsorted array, find the maximum difference between the successive elements in its sorted form.
#Try to solve it in linear time/space.
#Return 0 if the array contains less than 2 elements.
#You may assume all elements in the array are non-negative integers and fit in the 32-bit signed integer range.
#Credits:
#Special thanks to @porker2008 for adding this problem and creating all test cases.
#class Solution:
#    def maximumGap(self, nums):
#        """
#        :type nums: List[int]
#        :rtype: int
#        """



# Time Is Money
# DRUNKWATER TEMPLATE(add description and prototypes) # Question Title and Description on leetcode.com # Function Declaration and Function Prototypes on leetcode.com #164. Maximum Gap #Given an unsorted array, find the maximum difference between the successive elements in its sorted form. #Try to solve it in linear time/space. #Return 0 if the array contains less than 2 elements. #You may assume all elements in the array are non-negative integers and fit in the 32-bit signed integer range. #Credits: #Special thanks to @porker2008 for adding this problem and creating all test cases. #class Solution: #    def maximumGap(self, nums): #        """ #        :type nums: List[int] #        :rtype: int #        """ # Time Is Money