Jump to content
Sign in to follow this  

Recognizing a problem as dynamic programming

Recommended Posts

I've been doing some Topcoder, and there's a bunch of dynamic programming problems in the competition. It takes forever for me to realize that I can write a recursive backtracking solution, but as soon as I can, I can write the algorithm pretty quickly. Problem is, by then, the programming phase is pretty much over. I can write the solution pretty quickly if someones tells me it's a dp problem. Do you guys have some kind of test that you do to see if it's dp?

Share this post

Link to post
Share on other sites

Create an account or sign in to comment

You need to be a member in order to leave a comment

Create an account

Sign up for a new account in our community. It's easy!

Register a new account

Sign in

Already have an account? Sign in here.

Sign In Now
Sign in to follow this