Add input validation to cyclic_sort to prevent invalid inputs (#15009)

* Add input validation to cyclic_sort

* Add input validation to cyclic_sort

* [pre-commit.ci] auto fixes from pre-commit.com hooks

for more information, see https://pre-commit.ci

* f string literal bug resolved

* [pre-commit.ci] auto fixes from pre-commit.com hooks

for more information, see https://pre-commit.ci

* test cyclic sort input validation

* [pre-commit.ci] auto fixes from pre-commit.com hooks

for more information, see https://pre-commit.ci

---------

Co-authored-by: pre-commit-ci[bot] <66853113+pre-commit-ci[bot]@users.noreply.github.com>

Author: Gairola788

sorts/cyclic_sort.py

@@ -5,6 +5,7 @@
 python -m doctest -v cyclic_sort.py
 or
 python3 -m doctest -v cyclic_sort.py
+
 For manual testing run:
 python cyclic_sort.py
 or
@@ -27,20 +28,42 @@ def cyclic_sort(nums: list[int]) -> list[int]:
     []
     >>> cyclic_sort([3, 5, 2, 1, 4])
     [1, 2, 3, 4, 5]
+
+    >>> cyclic_sort([1, 2, 2])
+    Traceback (most recent call last):
+    ...
+    ValueError: All numbers must be unique, got 2
+
+    >>> cyclic_sort([1, 5])
+    Traceback (most recent call last):
+    ...
+    ValueError: All numbers must be in range 1 to 2, got 5
     """
 
+    # Input validation
+    seen = set()
+    n = len(nums)
+
+    for num in nums:
+        if num in seen:
+            message = f"All numbers must be unique, got {num}"
+            raise ValueError(message)
+
+        if num < 1 or num > n:
+            message = f"All numbers must be in range 1 to {n}, got {num}"
+            raise ValueError(message)
+
+        seen.add(num)
+
     # Perform cyclic sort
     index = 0
     while index < len(nums):
-        # Calculate the correct index for the current element
         correct_index = nums[index] - 1
-        # If the current element is not at its correct position,
-        # swap it with the element at its correct index
+
         if index != correct_index:
             nums[index], nums[correct_index] = nums[correct_index], nums[index]
+
         else:
-            # If the current element is already in its correct position,
-            # move to the next element
             index += 1
 
     return nums
@@ -50,6 +73,7 @@ def cyclic_sort(nums: list[int]) -> list[int]:
     import doctest
 
     doctest.testmod()
+
     user_input = input("Enter numbers separated by a comma:\n").strip()
     unsorted = [int(item) for item in user_input.split(",")]
     print(*cyclic_sort(unsorted), sep=",")