SPLIT ARRAY RECURSION

#1

WHAT IS THE LOGIC AND RECURSIVE CASE FOR THIS

#2

Approach:

generate all subsequences whose sum is half of totalSum
then print the subsequence and remaining elements from array

now try to implement this
if found any difficulty feel free to ask

#3

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.

#4

How to find remaining elements from array after finding subsequence