input: Write a python function to find the longest possible ride duration from a list of start times.
  assert find_longest_ride([9.00, 9.40, 9.50, 11.00, 15.00]) == 6.0
  assert find_longest_ride([8.00, 8.30, 9.00, 12.00, 13.00]) == 5.0
  assert find_longest_ride([10.00, 10.20, 10.30, 11.30, 12.30]) == 2.3
output: def find_longest_ride(start_times):
      if len(start_times) < 2:
          return 0.0
      start_times.sort()
      max_duration = 0.0
      for i in range(1, len(start_times)):
          duration = start_times[i] - start_times[i - 1]
          if duration > max_duration:
              max_duration = duration
      return max_duration