Exhaustive search. Divide & conquer. Dynamic Programming. Greedy. Iterative.
You understand how to design and analyze algorithms using
Dynamic Programming 1
Dynamic Programming 2
Dynamic Programming 3
Greedy Algo 1
Greedy Algo 2
Greedy Algo 3
CLRS Problem 15-2
CLRS Problem 16-1
CLRS Problem 16-5
CLRS Problem 17-3 and 15-6