2 files changed, 117 insertions, 0 deletions
diff --git a/challenge-284/lubos-kolouch/python/ch-1.py b/challenge-284/lubos-kolouch/python/ch-1.py
new file mode 100644
index 0000000000..2f817578f1
--- /dev/null
+++ b/challenge-284/lubos-kolouch/python/ch-1.py
@@ -0,0 +1,51 @@
+from typing import List
+import unittest
+
+
+def find_lucky_integer(ints: List[int]) -> int:
+    """
+    Finds the lucky integer in the given list of integers.
+
+    A lucky integer is an integer whose frequency in the array is equal to its value.
+
+    If there are multiple lucky integers, returns the largest one.
+    If no lucky integers are found, returns -1.
+
+    Args:
+        ints (List[int]): A list of integers.
+
+    Returns:
+        int: The lucky integer if found, otherwise -1.
+    """
+    from collections import Counter
+    freq = Counter(ints)
+    lucky_integers = [num for num, count in freq.items() if num == count]
+    if lucky_integers:
+        return max(lucky_integers)
+    else:
+        return -1
+
+
+# Unit Tests
+class TestFindLuckyInteger(unittest.TestCase):
+
+    def test_example1(self):
+        self.assertEqual(find_lucky_integer([2, 2, 3, 4]), 2, 'Example 1')
+
+    def test_example2(self):
+        self.assertEqual(find_lucky_integer([1, 2, 2, 3, 3, 3]), 3,
+                         'Example 2')
+
+    def test_example3(self):
+        self.assertEqual(find_lucky_integer([1, 1, 1, 3]), -1, 'Example 3')
+
+    def test_additional(self):
+        self.assertEqual(find_lucky_integer([5, 5, 5, 5, 5]), 5,
+                         'All same number')
+        self.assertEqual(find_lucky_integer([2, 2, 2, 3, 3]), -1,
+                         'No lucky integer')
+        self.assertEqual(find_lucky_integer([]), -1, 'Empty list')
+
+
+if __name__ == "__main__":
+    unittest.main()
diff --git a/challenge-284/lubos-kolouch/python/ch-2.py b/challenge-284/lubos-kolouch/python/ch-2.py
new file mode 100644
index 0000000000..c0fb8a888b
--- /dev/null
+++ b/challenge-284/lubos-kolouch/python/ch-2.py
@@ -0,0 +1,66 @@
+from typing import List
+import unittest
+
+
+def relative_sort(list1: List[int], list2: List[int]) -> List[int]:
+    """
+    Sorts the elements of list1 based on the relative order defined in list2.
+    Elements not in list2 are placed at the end in ascending order.
+
+    Args:
+        list1 (List[int]): The list of integers to sort.
+        list2 (List[int]): The list defining the relative order.
+
+    Returns:
+        List[int]: The sorted list.
+    """
+    order = {num: idx for idx, num in enumerate(list2)}
+    in_list2 = []
+    not_in_list2 = []
+
+    for num in list1:
+        if num in order:
+            in_list2.append(num)
+        else:
+            not_in_list2.append(num)
+
+    # Sort elements in list1 that are in list2 based on the order in list2
+    in_list2.sort(key=lambda x: (order[x], x))
+
+    # Sort elements not in list2 in ascending order
+    not_in_list2.sort()
+
+    return in_list2 + not_in_list2
+
+
+# Unit Tests
+class TestRelativeSort(unittest.TestCase):
+
+    def test_example1(self):
+        list1 = [2, 3, 9, 3, 1, 4, 6, 7, 2, 8, 5]
+        list2 = [2, 1, 4, 3, 5, 6]
+        expected = [2, 2, 1, 4, 3, 3, 5, 6, 7, 8, 9]
+        self.assertEqual(relative_sort(list1, list2), expected, 'Example 1')
+
+    def test_example2(self):
+        list1 = [3, 3, 4, 6, 2, 4, 2, 1, 3]
+        list2 = [1, 3, 2]
+        expected = [1, 3, 3, 3, 2, 2, 4, 4, 6]
+        self.assertEqual(relative_sort(list1, list2), expected, 'Example 2')
+
+    def test_example3(self):
+        list1 = [3, 0, 5, 0, 2, 1, 4, 1, 1]
+        list2 = [1, 0, 3, 2]
+        expected = [1, 1, 1, 0, 0, 3, 2, 4, 5]
+        self.assertEqual(relative_sort(list1, list2), expected, 'Example 3')
+
+    def test_additional(self):
+        list1 = [7, 5, 9, 4, 8, 6]
+        list2 = [5, 7, 6]
+        expected = [5, 7, 6, 4, 8, 9]
+        self.assertEqual(relative_sort(list1, list2), expected,
+                         'Additional Test')
+
+
+if __name__ == "__main__":
+    unittest.main()