Python | Series K divisible elements

The problem focused in this article is quite specific and may be less useful in different domains. But the way this is going to solve may open doors to solve potentially like problems, hence making it worth a read. This article solves the problem of testing if a list contains series of K divisible. Let’s discuss certain ways in which this problem can be solved. 

Method #1 : Using sum() + list comprehension + zip() + any() This problem can be solved using the combination of above functions. This method solves problem in 2 steps. In 1st step, we compute all the possible pairs of N using list comprehension and zip function and in the second step we use sum and any function to test for N divisible result, if we find any one of it, we return positive. 

The original list : [1, 5, 6, 4, 8, 12]
Does list contain the desired consecution : True

Time Complexity: O(n),The above code iterates through the list once, hence the time complexity is linear, i.e. O(n).
Space Complexity: O(n),The algorithm uses an additional list to store the result, thus consuming linear space which is O(n).

  Method #2 : Using groupby() + any() The whole logic of doing the 1st step in the above method can be managed using the groupby function in which we perform the grouping and any function can be used later for checking the consecution. 

The original list : [1, 5, 6, 4, 8, 12]
Does list contain the desired consecution : True

Time Complexity: O(n), where n is the number of elements in the list “test_list”.
Auxiliary Space: O(1), constant extra space is required