From 8c23faa2a617a24aed7f64e05b62311c20ce3991 Mon Sep 17 00:00:00 2001
From: MertYksl03 <mert.yksl.03@gmail.com>
Date: Tue, 3 Mar 2026 11:12:23 +0300
Subject: [PATCH] created pyramid and sequences

---
 Week03/pyramid_mert_yuksel.py   |  6 ++++++
 Week03/sequences_mert_yuksel.py | 32 ++++++++++++++++++++++++++++++++
 2 files changed, 38 insertions(+)
 create mode 100644 Week03/pyramid_mert_yuksel.py
 create mode 100644 Week03/sequences_mert_yuksel.py

diff --git a/Week03/pyramid_mert_yuksel.py b/Week03/pyramid_mert_yuksel.py
new file mode 100644
index 00000000..f6670fa5
--- /dev/null
+++ b/Week03/pyramid_mert_yuksel.py
@@ -0,0 +1,6 @@
+def calculate_pyramid_height(number_of_blocks):
+    height = 0
+    while (number_of_blocks >= 0):
+        height += 1
+        number_of_blocks -= height
+    return height -1
\ No newline at end of file
diff --git a/Week03/sequences_mert_yuksel.py b/Week03/sequences_mert_yuksel.py
new file mode 100644
index 00000000..38780d58
--- /dev/null
+++ b/Week03/sequences_mert_yuksel.py
@@ -0,0 +1,32 @@
+def remove_duplicates(seq: list) -> list:
+    """
+    This function removes duplicates from a list.
+    """ 
+    unique_items = []
+    for item in seq:
+        if item not in unique_items:
+            unique_items.append(item)
+    return unique_items
+
+def list_counts(seq: list) -> dict:
+    """
+    This function counts the number of 
+    occurrences of each item in a list.
+    """
+    counts = {}
+    for item in seq:
+        if item in counts:
+            counts[item] += 1
+        else:
+            counts[item] = 1
+    return counts
+
+def reverse_dict(d: dict) -> dict:
+    """
+    This function reverses the keys
+    and values of a dictionary
+    """
+    reversed_dict = {}
+    for key, value in d.items():
+        reversed_dict[value] = key
+    return reversed_dict