O(t*n) is the number of possible combinations, but each combination is a list of numbers. How is this presented as space complexity of O(t*n) instead of something like O(t*n*s) where O(s) is the number of values in the combination?

Course: Grokking Coding Interview Patterns in Java - Learn Interactively

Lesson: https://www.educative.io/courses/grokking-coding-interview-patterns-java/solution-combination-sum