From d44673328d2090fd92611e14b158c4d638932349 Mon Sep 17 00:00:00 2001 From: Sushree2904 Date: Fri, 14 Jun 2024 00:06:51 -0700 Subject: [PATCH 1/8] anagram.py --- Task/Sushree/anagram.py | 22 ++++++++++++++++++++++ 1 file changed, 22 insertions(+) create mode 100644 Task/Sushree/anagram.py diff --git a/Task/Sushree/anagram.py b/Task/Sushree/anagram.py new file mode 100644 index 0000000..869ff4c --- /dev/null +++ b/Task/Sushree/anagram.py @@ -0,0 +1,22 @@ +def is_anagram(s: str, t: str) -> bool: + + if len(s) != len(t): + return False + char_count_s = {} + char_count_t = {} + + for char in s: + char_count_s[char] = char_count_s.get(char, 0) + 1 + + for char in t: + char_count_t[char] = char_count_t.get(char, 0) + 1 + + return char_count_s == char_count_t + +s1 = "anagram" +t1 = "nagaram" +print(is_anagram(s1, t1)) + +s2 = "rat" +t2 = "car" +print(is_anagram(s2, t2)) From 0a204c5b942fde18b434ee939bcfcc236d0f1443 Mon Sep 17 00:00:00 2001 From: Sushree2904 Date: Fri, 14 Jun 2024 00:12:29 -0700 Subject: [PATCH 2/8] Create ques2.py --- Task/Sushree/ques2.py | 20 ++++++++++++++++++++ 1 file changed, 20 insertions(+) create mode 100644 Task/Sushree/ques2.py diff --git a/Task/Sushree/ques2.py b/Task/Sushree/ques2.py new file mode 100644 index 0000000..76c89de --- /dev/null +++ b/Task/Sushree/ques2.py @@ -0,0 +1,20 @@ +def frequency_in_lexicographical_order(s: str): + frequency = {} + for char in s: + if char.isalpha(): + if char in frequency: + frequency[char] += 1 + else: + frequency[char] = 1 + + sorted_uppercase = sorted([char for char in frequency if char.isupper()]) + sorted_lowercase = sorted([char for char in frequency if char.islower()]) + + for char in sorted_uppercase: + print(f"{char}: {frequency[char]}") + + for char in sorted_lowercase: + print(f"{char}: {frequency[char]}") + +input_string = "Robotics Society" +frequency_in_lexicographical_order(input_string) From 9f12716dd85b4782c97abc9038f7e89c6b34b9ba Mon Sep 17 00:00:00 2001 From: Sushree2904 Date: Fri, 14 Jun 2024 00:32:38 -0700 Subject: [PATCH 3/8] ques10.py --- Task/Sushree/ques10.py | 17 +++++++++++++++++ 1 file changed, 17 insertions(+) create mode 100644 Task/Sushree/ques10.py diff --git a/Task/Sushree/ques10.py b/Task/Sushree/ques10.py new file mode 100644 index 0000000..a180664 --- /dev/null +++ b/Task/Sushree/ques10.py @@ -0,0 +1,17 @@ +def transpose(matrix): + m = len(matrix) + n = len(matrix[0]) + + transposed_matrix = [[0] * m for _ in range(n)] + + for i in range(m): + for j in range(n): + transposed_matrix[j][i] = matrix[i][j] + + return transposed_matrix + +matrix1 = [[1, 2, 3], [4, 5, 6], [7, 8, 9]] +matrix2 = [[1, 2, 3], [4, 5, 6]] + +print(transpose(matrix1)) +print(transpose(matrix2)) From df90acc6494a1df9db4d950238bec48f83d764d9 Mon Sep 17 00:00:00 2001 From: Sushree2904 Date: Sat, 15 Jun 2024 23:55:34 -0700 Subject: [PATCH 4/8] Add files via upload --- task-3.py | 18 ++++++++++++++++++ task-8.py | 14 ++++++++++++++ 2 files changed, 32 insertions(+) create mode 100644 task-3.py create mode 100644 task-8.py diff --git a/task-3.py b/task-3.py new file mode 100644 index 0000000..953eea2 --- /dev/null +++ b/task-3.py @@ -0,0 +1,18 @@ +def plus_one(digits): + n = len(digits) + for i in range(n-1, -1, -1): + digits[i] += 1 + if digits[i] < 10: + return digits + digits[i] = 0 + + return [1] + digits + +example1 = [1, 2, 3] +example2 = [4, 3, 2, 1] +example3 = [9] + +print(plus_one(example1)) +print(plus_one(example2)) +print(plus_one(example3)) + diff --git a/task-8.py b/task-8.py new file mode 100644 index 0000000..22d187d --- /dev/null +++ b/task-8.py @@ -0,0 +1,14 @@ +def count_frequencies(lst): + frequency_dict = {} + + for element in lst: + if element in frequency_dict: + frequency_dict[element] += 1 + else: + frequency_dict[element] = 1 + + return frequency_dict + +example = [1,2,2,3,5,6,4,7,7] +result = count_frequencies(example) +print(result) \ No newline at end of file From 30d52a224ec8f9b064b1a65a7c88d35ffda0456f Mon Sep 17 00:00:00 2001 From: Sushree2904 Date: Tue, 2 Jul 2024 04:03:25 -0700 Subject: [PATCH 5/8] Rename anagram.py to ques1.py --- Task/Sushree/{anagram.py => ques1.py} | 0 1 file changed, 0 insertions(+), 0 deletions(-) rename Task/Sushree/{anagram.py => ques1.py} (100%) diff --git a/Task/Sushree/anagram.py b/Task/Sushree/ques1.py similarity index 100% rename from Task/Sushree/anagram.py rename to Task/Sushree/ques1.py From 9e507e647c1aa7b36061ec128012929bd4d9ab84 Mon Sep 17 00:00:00 2001 From: Sushree2904 Date: Tue, 2 Jul 2024 04:04:05 -0700 Subject: [PATCH 6/8] Update and rename task-3.py to ques3.py --- task-3.py => ques3.py | 0 1 file changed, 0 insertions(+), 0 deletions(-) rename task-3.py => ques3.py (100%) diff --git a/task-3.py b/ques3.py similarity index 100% rename from task-3.py rename to ques3.py From 04fd3aeac6e909946b60125a3396fc701baca54b Mon Sep 17 00:00:00 2001 From: Sushree2904 Date: Tue, 2 Jul 2024 04:04:37 -0700 Subject: [PATCH 7/8] Update and rename task-8.py to ques8.py --- task-8.py => ques8.py | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) rename task-8.py => ques8.py (91%) diff --git a/task-8.py b/ques8.py similarity index 91% rename from task-8.py rename to ques8.py index 22d187d..fc01cf3 100644 --- a/task-8.py +++ b/ques8.py @@ -11,4 +11,4 @@ def count_frequencies(lst): example = [1,2,2,3,5,6,4,7,7] result = count_frequencies(example) -print(result) \ No newline at end of file +print(result) From bb5bd7b179c58dc1d1e0c92327fce937d93fc882 Mon Sep 17 00:00:00 2001 From: Sushree2904 Date: Tue, 2 Jul 2024 05:27:47 -0700 Subject: [PATCH 8/8] Add files via upload --- ques6.py | 24 ++++++++++++++++++++++++ ques7.py | 20 ++++++++++++++++++++ 2 files changed, 44 insertions(+) create mode 100644 ques6.py create mode 100644 ques7.py diff --git a/ques6.py b/ques6.py new file mode 100644 index 0000000..f5cec1e --- /dev/null +++ b/ques6.py @@ -0,0 +1,24 @@ +def is_prime(n): + if n <= 1: + return False + for i in range(2, n): + if n % i == 0: + return False + return True + +def prime_difference(N, A): + primes = [] + for i in range(N): + if is_prime(A[i]): + primes.append(A[i]) + + if len(primes) == 0: + return 1 + + smallest_prime = min(primes) + largest_prime = max(primes) + return largest_prime - smallest_prime + +A = [1, 2, 3, 4, 5, 6] +N = 6 +print(prime_difference(N, A)) \ No newline at end of file diff --git a/ques7.py b/ques7.py new file mode 100644 index 0000000..76bd782 --- /dev/null +++ b/ques7.py @@ -0,0 +1,20 @@ +def smallest_prime_factor(n): + if n <= 1: + return n + for i in range(2, n + 1): + if n % i == 0: + return i + return n + +def amount_roy_pays(N, prices): + results = [] + for price in prices: + min_prime = smallest_prime_factor(price) + roy_pays = price - min_prime + results.append(roy_pays) + return results + + +N = 2 +prices = [5, 10] +print(amount_roy_pays(N, prices)) \ No newline at end of file