The big idea behind recursion is to make the problem smaller and then use the solution to the smaller problem to form the solution to the bigger problem.
In this case, the reduced version of the problem is to make an array from startSum to endNum-1, and then you add endNum to this array.
I am also a beginner and recursion is still a little tricky for me. What might help is to run this function through a debugger and go through it step by step so you can see exactly what is happening in the computer.
Also, I have blurred out your working solution with [spoiler] tags for other campers that haven’t started this problem yet.