What is the space complexity of the following dynamic programming implementation used to find the minimum number of jumps?
|Answer» B. o(n)|
|Explanation: the space complexity of the above dynamic programming implementation is o(n).|
Login to Continue
It will take less than 2 minutes