From f520d2e745305f82f3b1a8f0c2cf7dfb78ead6c7 Mon Sep 17 00:00:00 2001 From: rft0 Date: Sun, 8 Mar 2026 18:25:43 +0300 Subject: [PATCH 1/2] create pyramid_rafet_taskin.py --- Week03/pyramid_rafet_taskin.py | 7 +++++++ 1 file changed, 7 insertions(+) create mode 100644 Week03/pyramid_rafet_taskin.py diff --git a/Week03/pyramid_rafet_taskin.py b/Week03/pyramid_rafet_taskin.py new file mode 100644 index 00000000..cb8d928a --- /dev/null +++ b/Week03/pyramid_rafet_taskin.py @@ -0,0 +1,7 @@ +def calculate_pyramid_height(blocks): + layer = 0 + while blocks >= (layer + 1): + layer += 1 + blocks -= layer + + return layer From 63c4a47da0aebec40e312bd275b29ce54bf7b2a9 Mon Sep 17 00:00:00 2001 From: rft0 Date: Sun, 8 Mar 2026 18:27:23 +0300 Subject: [PATCH 2/2] create sequences_rafet_taskin.py --- Week03/sequences_rafet_taskin.py | 17 +++++++++++++++++ 1 file changed, 17 insertions(+) create mode 100644 Week03/sequences_rafet_taskin.py diff --git a/Week03/sequences_rafet_taskin.py b/Week03/sequences_rafet_taskin.py new file mode 100644 index 00000000..d20173bd --- /dev/null +++ b/Week03/sequences_rafet_taskin.py @@ -0,0 +1,17 @@ +def remove_duplicates(l): + return list(dict.fromkeys(l)) + +def list_counts(l): + counts = {} + for item in l: + if item in counts: + counts[item] += 1 + else: + counts[item] = 1 + return counts + +def reverse_dict(d): + reversed_d = {} + for key, value in d.items(): + reversed_d[value] = key + return reversed_d