Lecturer explaining algorithms

Hi
I need a teacher to explain algorithms for 10 lectures with the ability of the teacher to give examples and questions and expand the material.
For example, the first lecture contains Backtracking and branch & bounds: sum of subsets, n queens problem, convex hull, 0/1 knapsack
Simple random permutation generator
Fisher and Yates' random permutation generator
Coupon collection problem
Stable mariage problem
Minimum cut)

Note: -Note the purpose of the explanation is to understand the material so that I can pass the exam, the payment is after each lecture, but the question is how do I know if the lecturer is good or not, because I tried one of the people and I did not benefit from anything, I just wasted my money and time.