Resolve #106. Add "slices of a series of digits" function

Author: shorodilov

src/sequences/__init__.py

@@ -25,7 +25,7 @@
 Balanced Parentheses
 --------------------
 
-A parentheses is said to be balanced if each left parenthesis has its
+A parentheses are said to be balanced if each left parenthesis has its
 respective right parenthesis to match its pair in a well-nested format.
 
 .. autofunction:: are_parentheses_balanced
@@ -39,4 +39,4 @@
     "get_longest_uniq_length",
 ]
 
-from .func import *
+from sequences.func import *

src/sequences/func.py

@@ -79,6 +79,7 @@ def get_longest_palindrome(origin: str, /) -> str:
 
     size: int = len(origin)
 
+    # noinspection PyMissingOrEmptyDocstring
     def expand(left: int, right: int) -> int:
         while left >= 0 and right < size and origin[left] == origin[right]:
             left -= 1
@@ -233,3 +234,43 @@ def add_spaces(origin: str) -> str:
     origin = origin.replace(" ", "")
 
     return "".join(f" {c}" if c.isupper() else c for c in origin).lstrip()
+
+
+def get_consecutive_slices(origin: str, n: int) -> List[List[int]]:
+    """
+    Return possible slices of string as a collection of lists of digits
+
+    :param origin: the input string of digits
+    :type origin: str
+    :param n: the length of slices to be extracted
+    :type n: int
+
+    :return: a list containing sublists of consecutive slices of length "n"
+    :rtype: list
+
+    :raise: ValueError
+
+    Given a string of digits and an integer `n`, this function returns all
+    consecutive slices of length `n` from the string.
+
+    Usage:
+
+    >>> assert get_consecutive_slices("0123", 1) == [[0], [1], [2], [3]]
+    >>> assert get_consecutive_slices("0123", 2) == [[0, 1], [1, 2], [2, 3]]
+    >>> assert get_consecutive_slices("0123", 3) == [[0, 1, 2], [1, 2, 3]]
+
+    """
+
+    size: int = len(origin)
+    if size < n:
+        raise ValueError("slice size is bigger than origin length")
+
+    origin = list(map(int, origin))
+    result = []
+    idx = 0
+
+    while idx <= size - n:
+        result.append(origin[idx:idx + n])
+        idx += 1
+
+    return result

tests/sequences/func_test.py

@@ -1,3 +1,5 @@
+import pytest
+
 import sequences
 
 
@@ -77,3 +79,19 @@ def test_add_space():
     assert sequences.add_spaces("test_test") == "test_test"
     assert sequences.add_spaces("JohnDoe") == "John Doe"
     assert sequences.add_spaces("John Doe") == "John Doe"
+
+
+def test_get_consecutive_slices():
+    assert sequences.get_consecutive_slices("0123", 1) == [[0], [1], [2], [3]]
+    assert (
+        sequences.get_consecutive_slices("0123", 2) == [[0, 1], [1, 2], [2, 3]]
+    )
+    assert (
+        sequences.get_consecutive_slices("0123", 3) == [[0, 1, 2], [1, 2, 3]]
+    )
+
+    with pytest.raises(ValueError,
+                       match="slice size is bigger than origin length"):
+        sequences.get_consecutive_slices("0123", 5)
+    with pytest.raises(ValueError):
+        sequences.get_consecutive_slices("abcdefg", 1)