Create a program in R5RS (a dialect of scheme) to take a list of atleast 2 integers and return the maximum length of two sublists that have the same sum
Create a program in R5RS (a dialect of scheme) to take a list of atleast 2 integers and return the maximum length of two sublists that have the same sum. for example 1,2,3,4 would have sublists of 1,4 and 2,3 and the output would be 2. However if no possible sublists can be made to fit the above criteria return 0. Not all numbers from a list need to be used in the sub lists, for example the list 1,-1,2,-3,4,-2 would have sublists of 1,-1 and 2,-2 and would return 2. So basically find every possible sublist and then return the length of the biggest sublists that have matching sums and lengths, so even the list 4,4 would return 1. This should be done in ONE recursive function and ONE cond statement and all parameters excludeing the list should be initialized with values of 0 which should roughly look like:
(define sublists (lambda (List followed by any other parameters)
(cond
code
))).
we can only use null?,car,cdr,else,+,-,=,>,>=,<,<=,if,and,user defined parameters, integer literals, parentheses, and the function for the sake of recursive calling. We can't use let. Also we are using DrRacket and i don't know if that would change anything else.
Step by step
Solved in 5 steps with 2 images
