D. J.:

- Added the leetcode problem and solution for 1317

Author: nobodyPerfecZ

README.md

@@ -283,6 +283,7 @@
 - [1218 Longest Arithmetic Subsequence of Given Difference](https://leetcode.com/problems/longest-arithmetic-subsequence-of-given-difference/description/)
 - [1304 Find N Unique Integers Sum up to Zero](https://leetcode.com/problems/find-n-unique-integers-sum-up-to-zero/description/)
 - [1312 Minimum Insertion Steps to Make a String Palindrome](https://leetcode.com/problems/minimum-insertion-steps-to-make-a-string-palindrome/description/)
+- [1317 Convert Integer to the Sum of Two No-Zero Integers](https://leetcode.com/problems/convert-integer-to-the-sum-of-two-no-zero-integers/description/)
 - [1329 Sort the Matrix Diagonally](https://leetcode.com/problems/sort-the-matrix-diagonally/description/)
 - [1456 Maximum Number of Vowels in a Substring of Given Length](https://leetcode.com/problems/maximum-number-of-vowels-in-a-substring-of-given-length/description/)
 - [1534 Count Good Triplets](https://leetcode.com/problems/count-good-triplets/description/)

awesome_python_leetcode/_1317_convert_integer_to_the_sum_of_two_no_zero_integers.py

@@ -0,0 +1,33 @@
+from typing import List
+
+
+class Solution:
+    """Base class for all LeetCode Problems."""
+
+    def hasZeros(self, n: int) -> bool:
+        """Check if the integer n has any zeros in its decimal representation."""
+        while n != 0:
+            digit = n % 10
+            if digit == 0:
+                return True
+            n = n // 10
+        return False
+
+    def getNoZeroIntegers(self, n: int) -> List[int]:
+        """
+        No-Zero integer is a positive integer that does not contain any 0 in its decimal
+        representation.
+
+        Given an integer n, return a list of two integers [a, b] where:
+        - a and b are No-Zero integers.
+        - a + b = n
+
+        The test cases are generated so that there is at least one valid solution. If
+        there are many valid solutions, you can return any of them.
+        """
+        num1 = n // 2 + 1 if n % 2 else n // 2
+        num2 = n // 2
+        while self.hasZeros(num1) or self.hasZeros(num2):
+            num1 -= 1
+            num2 += 1
+        return [num1, num2]

tests/test_1317_convert_integer_to_the_sum_of_two_no_zero_integers.py

@@ -0,0 +1,23 @@
+from typing import List
+
+import pytest
+
+from awesome_python_leetcode._1317_convert_integer_to_the_sum_of_two_no_zero_integers import (  # noqa: E501
+    Solution,
+)
+
+
+@pytest.mark.parametrize(
+    argnames=["n", "expected"],
+    argvalues=[
+        (2, [1, 1]),
+        (11, [6, 5]),
+        (1010, [499, 511]),
+        (19, [8, 11]),
+        (2081, [969, 1112]),
+    ],
+)
+def test_func(n: int, expected: List[int]):
+    """Tests the solution of a LeetCode problem."""
+    zero_integers = Solution().getNoZeroIntegers(n)
+    assert zero_integers == expected