Here's the question you clicked on:

55 members online
  • 0 replying
  • 0 viewing


  • 3 years ago

using dynamic programming. how would i find the least amount of perfect squares that go into a number? ie: input: 60,000 output: 3. [136^2 + 140^2 + 148^2 ]

  • This Question is Closed
  1. khurramshahzad
    • 3 years ago
    Best Response
    You've already chosen the best response.
    Medals 0

    i can tell u on C language or c++ .. u can get idea from there.. if ok the tell me

  2. Not the answer you are looking for?
    Search for more explanations.

    • Attachments:

Ask your own question

Sign Up
Find more explanations on OpenStudy
Privacy Policy