2 files changed, 56 insertions, 0 deletions
diff --git a/challenge-151/lubos-kolouch/python/ch-1.py b/challenge-151/lubos-kolouch/python/ch-1.py
new file mode 100644
index 0000000000..fd34a05784
--- /dev/null
+++ b/challenge-151/lubos-kolouch/python/ch-1.py
@@ -0,0 +1,30 @@
+import re
+
+
+def get_min_depth(input: str):
+    """Calculate the depth"""
+    # Input: '1 | 2 3 | 4 5'
+
+    # iterate through the layers. If the next layer does not have 2^n items,
+    # there must be a leaf node
+
+    input = re.sub(r"\s", "", input)
+    layers = input.split("|")
+
+    for layer_count, _ in enumerate(layers, 1):
+        # if not defined means we are at the last layer
+
+        try:
+            items_count = len(layers[layer_count])
+        except IndexError:
+            return layer_count
+
+        if items_count != 2**layer_count:
+            return layer_count
+
+    return None
+
+
+assert get_min_depth("1 | 2 3 | 4 5") == 2
+assert get_min_depth("1 | 2 3 | 4 *  * 5 | * 6") == 3
+assert get_min_depth("1 | 2 3") == 2
diff --git a/challenge-151/lubos-kolouch/python/ch-2.py b/challenge-151/lubos-kolouch/python/ch-2.py
new file mode 100644
index 0000000000..d71588785d
--- /dev/null
+++ b/challenge-151/lubos-kolouch/python/ch-2.py
@@ -0,0 +1,26 @@
+cache = {}
+
+
+def get_houses_max(houses: list):
+    """Calculate the best way through the houses"""
+
+    try:
+        return cache[",".join(map(str, houses))]
+    except KeyError:
+        pass
+
+    max_value = 0
+    house_index = 0
+
+    for house_index, _ in enumerate(houses[2:]):
+        next_houses_values = get_houses_max(houses[2 + house_index :])
+        if next_houses_values > max_value:
+            max_value = next_houses_values
+
+    cache[",".join(map(str, houses))] = houses[0] + max_value
+    return houses[0] + max_value
+
+
+assert get_houses_max([2, 4, 5]) == 7
+cache = {}
+assert get_houses_max([4, 2, 3, 6, 5, 3]) == 13