0
0
I am trying to find an algorithm to solve the following problem with python.
Given a list of integers, check if after dropping two elements of the list, is posible to divide the list in 3 where the sum of the consecutive numbers are equals.
For example: A = [1, 3, 4, 2, 2, 2, 1, 1, strong text2...