I am looking for a list of problems (the more problems, the better) with their respective algorithmic method (s) these problems can be solved. For instance:
The shortest path → Dijkstra's algorithm (dynamic programming), and maybe others ...
Backpack problem → can be solved by dynamic programming, ...
The task of a convex hull → can be accomplished by dividing and conquering, ...
If each task has a small paragraph explaining how the problem is solved (for example, it can explain how to "divide" the problem in the separation and subjugation algorithm) with this technique, which would be even better.
Is there such a list on the net or in the book?
* UPDATE after blocking ... *
I am not looking for the problems that are most often encountered in programming contests such as TopCoder . Problems from such sites (contests) are used to “hide” the definition of a problem that should be found by the user. I am looking for problem definitions, for example Given a graph of G = (V, E) ... and he gave a solution method Can be solved using divide and conquest ... instead of problem definitions like this: Given N houses, John is trying to find a way to get home as soon as possible ... about how the problems are described in the websites of programming competitions.
, . "" . , , , , , , , . >