updated...

python/PrimeChecker.py

@@ -0,0 +1,14 @@
+# Problem Statement: Check if a given number is prime.
+# Time Complexity: O(sqrt(N))
+# Space Complexity: O(1)
+
+def is_prime(n):
+    if n <= 1:
+        return False
+    for i in range(2, int(n**0.5)+1):
+        if n % i == 0:
+            return False
+    return True
+
+# Example
+print(is_prime(29))  # Output: True

python/ZTM_Quest_GuessNumber.py

@@ -0,0 +1,30 @@
+# Problem Statement: Number Guessing Game for ZTM Quest Project
+# The computer selects a random number between 1 and 100. Player tries to guess it until correct.
+# Time Complexity: O(N) in worst case (N = range of numbers)
+# Space Complexity: O(1)
+
+import random
+
+def guess_number_game():
+    number = random.randint(1, 100)
+    attempts = 0
+    guess = 0
+
+    print("Welcome to ZTM Quest Number Guessing Game!")
+    print("I have selected a number between 1 and 100. Try to guess it.")
+
+    while guess != number:
+        try:
+            guess = int(input("Enter your guess: "))
+            attempts += 1
+            if guess < number:
+                print("Too low! Try again.")
+            elif guess > number:
+                print("Too high! Try again.")
+            else:
+                print(f"Congratulations! You guessed it in {attempts} attempts.")
+        except ValueError:
+            print("Please enter a valid integer.")
+
+# Example run
+# guess_number_game()