A

Admin • 828.03K Points
Coach

Q. What is the space complexity of the following dynamic programming implementation used to find the minimum number of jumps?

  • (A) o(1)
  • (B) o(n)
  • (C) o(n2)
  • (D) o(5)
Explanation by: Admin
the space complexity of the above dynamic programming implementation is o(n).

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Be the first to start discuss.