Given a list of integers L and a target integer T return true or false if there exists a sublist of integers whose sum is equal to T. For this particular problem, both positive and negative numbers are allowed. To keep things simple, we will assume 0 is not allowed and that T cannot be 0. Let's see some examples of inputs and the expected outputs. Examples Input: L- [1, 2, 3] T-4 Output: True. The sublist [1, 3] sums to 4. Input: L- [5, 1, 6, 7] T-17 Output: False. There are no sublists that have a sum equal to 17. Input: L- [13, 16, -9, 24, -19, 16, -25, -15, 18, 4] T-10 Output: True. A sublist (as there are many) is [13, -19, 16].

The problems for which the deterministic polynomial-time algorithm exists belong to the complexity class (p) and it is central in the field of computational complexity theory. According to Cobham’s thesis, polynomial time is a synonym for “feasible”, “fa…