Question

Give the algorithm to decide if a list of integers can be divided into two smaller lists of
equal sum. For example,
[10, 20 , 30 , 5 , 40 , 50 , 40 , 15]
can be fairly divided into
[10, 20, 30, 5, 40] and [50, 40, 15]
However,
[4, 4, 8, 10,14] cannot be divided.

Answer 1

It is a subset sum problem.
See https://www.geeksforgeeks.org/dynamic-programming-subset-sum-problem/ and pseudocode https://en.wikipedia.org/wiki/Subset_sum_problem