input: Write a python function to find the longest common prefix among a list of strings.
  assert find_longest_common_prefix(["flower","flow","flight"]) == "fl"
  assert find_longest_common_prefix(["dog","racecar","car"]) == ""
  assert find_longest_common_prefix(["interspecies","interstellar","interstate"]) == "inters"
  assert find_longest_common_prefix(["throne","dungeon"]) == ""
  assert find_longest_common_prefix(["throne","throne"]) == "throne"
output: def find_longest_common_prefix(strs):
      if not strs:
          return ""
      
      shortest_str = min(strs, key=len)
      
      for i, char in enumerate(shortest_str):
          for other in strs:
              if other[i] != char:
                  return shortest_str[:i]
      
      return shortest_str