Compare commits

...
4 Commits
Author SHA1 Message Date
stud203788 6d8e66cc05 Implement gcd function 2026-04-17 22:52:01 +03:00
stud203788 72f33ca843 Add sceleton gcd function 2026-04-17 22:38:06 +03:00
stud203788 39b258ffec Implement most_frequent_value function 2026-04-17 22:34:59 +03:00
stud203788 524581e2fc Add sceleton of most_frequent_value function 2026-04-17 22:25:00 +03:00
2 changed files with 33 additions and 0 deletions
+17
View File
@@ -0,0 +1,17 @@
def most_frequent_value(d: dict) -> tuple:
frequency = {}
for value in d.values():
if value in frequency:
frequency[value] += 1
else:
frequency[value] = 1
max_value = None
max_count = 0
for value, count in frequency.items():
if count > max_count:
max_count = count
max_value = value
return(max_value, max_count)
if __name__ == "__main__":
print(most_frequent_value({"a": 1, "b": 2, "c": 1, "d": 3}))
+16
View File
@@ -0,0 +1,16 @@
def gcd(a: int, b: int) -> int:
result = []
for i in range(1, min(a, b) + 1):
if a % i == 0 and b % i == 0:
result.append(i)
else:
continue
return max(result)
if __name__ == "__main__":
print(gcd(18, 24))