Programming, Algorithms, Data Structures, Coding Interviews, Data.
The bottom-up approach is iterative and it doesn’t have the overhead of a recursion call stack. So space complexity of the bottom-up approach is equal to the extra space to store subproblem solutions. Input size of the subproblems In a divide-and-conquer, the input size of the subproblems decreases