input: 
  def find_matches(query: str, choices: List[str], threshold: int) -> List[str]:
      """
      Finds matches in the given list of choices that are within a certain Levenshtein distance threshold from the query string.
      
      >>> find_matches("apple", ["apples", "appetite", "banana"], 2)
      ['apples', 'appetite']
      >>> find_matches("cat", ["bat", "dog", "rat"], 1)
      ['bat', 'rat']
      """
  
output:     from Levenshtein import distance
      return [choice for choice in choices if distance(query, choice) <= threshold]