Are you sure you're getting this? Is this statement true or false?
The bottom-up dynamic programming approach for solving the Fibonacci sequence has a space complexity of O(n).
Press true if you believe the statement is correct, or false otherwise.
Back to course sections
Mark As Completed Discussion