Search the Community
Showing results for tags 'recognizing'.
Found 1 result
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?