From 20a4fdf38465c2731100c3fbd1aac847cd0b9322 Mon Sep 17 00:00:00 2001
From: imp <imp07@qq.com>
Date: Thu, 19 Aug 2021 20:08:20 +0800
Subject: [PATCH] [mypy] Fix type annotations for strings (#4637)

* Fix mypy error for can_string_be_rearranged_as_pal

* Fix mypy error for levenshtein_distance.py

* Fix mypy error for word_patterns.py

* Fix mypy error for word_occurrence.py
---
 strings/can_string_be_rearranged_as_palindrome.py | 2 +-
 strings/levenshtein_distance.py                   | 2 +-
 strings/word_occurrence.py                        | 2 +-
 strings/word_patterns.py                          | 2 +-
 4 files changed, 4 insertions(+), 4 deletions(-)

diff --git a/strings/can_string_be_rearranged_as_palindrome.py b/strings/can_string_be_rearranged_as_palindrome.py
index 7fedc5877..ddc4828c7 100644
--- a/strings/can_string_be_rearranged_as_palindrome.py
+++ b/strings/can_string_be_rearranged_as_palindrome.py
@@ -43,7 +43,7 @@ def can_string_be_rearranged_as_palindrome(input_str: str = "") -> bool:
         return True
     lower_case_input_str = input_str.replace(" ", "").lower()
     # character_freq_dict: Stores the frequency of every character in the input string
-    character_freq_dict = {}
+    character_freq_dict: dict[str, int] = {}
 
     for character in lower_case_input_str:
         character_freq_dict[character] = character_freq_dict.get(character, 0) + 1
diff --git a/strings/levenshtein_distance.py b/strings/levenshtein_distance.py
index 540a21c93..9f7a7e3e6 100644
--- a/strings/levenshtein_distance.py
+++ b/strings/levenshtein_distance.py
@@ -41,7 +41,7 @@ def levenshtein_distance(first_word: str, second_word: str) -> int:
     if len(second_word) == 0:
         return len(first_word)
 
-    previous_row = range(len(second_word) + 1)
+    previous_row = list(range(len(second_word) + 1))
 
     for i, c1 in enumerate(first_word):
 
diff --git a/strings/word_occurrence.py b/strings/word_occurrence.py
index ef612e12d..4acfa41ad 100644
--- a/strings/word_occurrence.py
+++ b/strings/word_occurrence.py
@@ -14,7 +14,7 @@ def word_occurence(sentence: str) -> dict:
     >>> dict(word_occurence("Two  spaces"))
     {'Two': 1, 'spaces': 1}
     """
-    occurrence = defaultdict(int)
+    occurrence: dict = defaultdict(int)
     # Creating a dictionary containing count of each word
     for word in sentence.split():
         occurrence[word] += 1
diff --git a/strings/word_patterns.py b/strings/word_patterns.py
index d229954de..90b092a20 100644
--- a/strings/word_patterns.py
+++ b/strings/word_patterns.py
@@ -28,7 +28,7 @@ if __name__ == "__main__":
     with open("dictionary.txt") as in_file:
         wordList = in_file.read().splitlines()
 
-    all_patterns = {}
+    all_patterns: dict = {}
     for word in wordList:
         pattern = get_word_pattern(word)
         if pattern in all_patterns: