From 3c4f9793fa9ec5d55964ecf100b9c322e3bdab4d Mon Sep 17 00:00:00 2001
From: LachezarLazarov <62560048+LachezarLazarov@users.noreply.github.com>
Date: Sun, 17 Oct 2021 20:52:35 +0300
Subject: [PATCH 1/3] Upload homework1 - checkCircle

---
 .../19_Lachezar_Lazarov/01_checkCircles.py    | 30 +++++++++++++++++++
 1 file changed, 30 insertions(+)
 create mode 100644 homeworks/19_Lachezar_Lazarov/01_checkCircles.py

diff --git a/homeworks/19_Lachezar_Lazarov/01_checkCircles.py b/homeworks/19_Lachezar_Lazarov/01_checkCircles.py
new file mode 100644
index 0000000..35e0c0d
--- /dev/null
+++ b/homeworks/19_Lachezar_Lazarov/01_checkCircles.py
@@ -0,0 +1,30 @@
+from math import sqrt
+
+def checkCircle(c1_center, c1_rad, c2_center, c2_rad):
+    if (c1_center == c2_center and c1_rad == c2_rad):
+	    return "Matching"
+
+    c1_x, c1_y = c1_center
+    c2_x, c2_y = c2_center
+
+    dist = sqrt((c1_x - c2_x)**2+(c1_y - c2_y)**2)
+    sum_rad = c1_rad + c2_rad 
+
+    if (dist < sum_rad):
+        return "Intersecting"
+    if (dist >sum_rad):
+        return "Not intersecting"
+    
+    if(c1_rad + dist == c2_rad or c2_rad + dist == c1_rad):
+        return "Containing!"
+
+    if(dist == sum_rad):
+        return "Touching"
+    
+c1_center = (2,0)
+c1_rad = 1
+
+c2_center = (1,1)
+c2_rad = 2
+
+print(checkCircle(c1_center,c1_rad,c2_center,c2_rad))

From ceb4fcb5fdeb5e36e2586a7912f40f327e1afa91 Mon Sep 17 00:00:00 2001
From: LachezarLazarov <62560048+LachezarLazarov@users.noreply.github.com>
Date: Wed, 12 Jan 2022 23:18:26 +0200
Subject: [PATCH 2/3] Create num_ways.py

---
 homeworks/19_Lachezar_Lazarov/num_ways.py | 9 +++++++++
 1 file changed, 9 insertions(+)
 create mode 100644 homeworks/19_Lachezar_Lazarov/num_ways.py

diff --git a/homeworks/19_Lachezar_Lazarov/num_ways.py b/homeworks/19_Lachezar_Lazarov/num_ways.py
new file mode 100644
index 0000000..12b0479
--- /dev/null
+++ b/homeworks/19_Lachezar_Lazarov/num_ways.py
@@ -0,0 +1,9 @@
+M = input("Stairs to climb: ")
+
+def num_ways(n):
+    if n == 0 or n == 1:
+        return 1
+    else:
+        return num_ways(n-1) + num_ways(n-2)
+
+print(num_ways(int(M)))

From 7292b28e76ba54d296ab8ab305f967408ecf109c Mon Sep 17 00:00:00 2001
From: LachezarLazarov <62560048+LachezarLazarov@users.noreply.github.com>
Date: Wed, 12 Jan 2022 23:19:51 +0200
Subject: [PATCH 3/3] Create replace1.py

---
 homeworks/19_Lachezar_Lazarov/replace1.py | 14 ++++++++++++++
 1 file changed, 14 insertions(+)
 create mode 100644 homeworks/19_Lachezar_Lazarov/replace1.py

diff --git a/homeworks/19_Lachezar_Lazarov/replace1.py b/homeworks/19_Lachezar_Lazarov/replace1.py
new file mode 100644
index 0000000..00a32a2
--- /dev/null
+++ b/homeworks/19_Lachezar_Lazarov/replace1.py
@@ -0,0 +1,14 @@
+def replace1(list1, find, replace):
+    for i in range(0, len(list1)):
+        if list1[i] == find:
+            list1[i] = replace
+        try:
+            if len(list1[i]) > 1:
+                list1[i] = replace1(list1[i], find, replace)
+        except:
+            continue
+    return list1
+    
+list1 = [ 'a', 1, [ ['a', 'b'], 1], ([1, 3, 'a'], 'b')]
+res = replace1(list1, 'a', 'c')
+print(res) # => [ 'c', 1, [ ['c', 'b'], 1], ([1, 3, 'c'], 'b')]