From 3d6513ae610f5b7ee842b9a5b5c41b164da1e2ca Mon Sep 17 00:00:00 2001 From: ZabihollahNamazi Date: Wed, 24 Jun 2026 16:57:12 +0100 Subject: [PATCH 1/2] common prefix --- .../common_prefix/common_prefix.py | 18 ++++++++---------- 1 file changed, 8 insertions(+), 10 deletions(-) diff --git a/Sprint-2/improve_with_precomputing/common_prefix/common_prefix.py b/Sprint-2/improve_with_precomputing/common_prefix/common_prefix.py index f4839e7..fb309f0 100644 --- a/Sprint-2/improve_with_precomputing/common_prefix/common_prefix.py +++ b/Sprint-2/improve_with_precomputing/common_prefix/common_prefix.py @@ -2,17 +2,15 @@ def find_longest_common_prefix(strings: List[str]): - """ - find_longest_common_prefix returns the longest string common at the start of any two strings in the passed list. - - In the event that an empty list, a list containing one string, or a list of strings with no common prefixes is passed, the empty string will be returned. - """ + if len(strings) < 2: + return "" + sorted_strings = sorted(strings) longest = "" - for string_index, string in enumerate(strings): - for other_string in strings[string_index+1:]: - common = find_common_prefix(string, other_string) - if len(common) > len(longest): - longest = common + for i in range(len(sorted_strings) - 1): + common = find_common_prefix(sorted_strings[i], sorted_strings[i + 1]) + if len(common) > len(longest): + longest = common + return longest From cefb36c6612ebf75268e873086aaede4255376a1 Mon Sep 17 00:00:00 2001 From: ZabihollahNamazi Date: Wed, 24 Jun 2026 17:06:17 +0100 Subject: [PATCH 2/2] count letters done --- .../count_letters/count_letters.py | 22 +++++++++++-------- 1 file changed, 13 insertions(+), 9 deletions(-) diff --git a/Sprint-2/improve_with_precomputing/count_letters/count_letters.py b/Sprint-2/improve_with_precomputing/count_letters/count_letters.py index 62c3ec0..03883a7 100644 --- a/Sprint-2/improve_with_precomputing/count_letters/count_letters.py +++ b/Sprint-2/improve_with_precomputing/count_letters/count_letters.py @@ -2,13 +2,17 @@ def count_letters(s: str) -> int: """ count_letters returns the number of letters which only occur in upper case in the passed string. """ - only_upper = set() + upper_letters = set() + lower_letters = set() for letter in s: - if is_upper_case(letter): - if letter.lower() not in s: - only_upper.add(letter) - return len(only_upper) - - -def is_upper_case(letter: str) -> bool: - return letter == letter.upper() + if letter.isupper(): + upper_letters.add(letter) + elif letter.islower(): + lower_letters.add(letter) + + only_upper_count = 0 + for letter in upper_letters: + if letter.lower() not in lower_letters: + only_upper_count += 1 + + return only_upper_count