The algorithm avoids usage of brute force by implementing a dynamic programming approach

Can you explain me a bit more what does it mean and how is it achieved?

Hi @someone555777

I don’t think there is a simple β€œexplain a bit more” explanation for this broad statement (the ideas were covered in the course materials).

But if I tried to dumb down to a single sentence explanation, then it would be β€œthis algorithm uses prior calculations for future calculations, that is why it is a dynamic programming approach, instead of being brute force where you calculate every step from the beginning every time.”

Cheers

1 Like