Here are some questions based on the information on the cards:

   1. What is the main difference between "dynamic programming" and "divide and conquer"?
   2. In which type of problems is dynamic programming used?
   3. What is the first step of a dynamic algorithm before solving a sub-problem?
   4. What is the purpose of memoization in dynamic programming?
   5. How do greedy algorithms differ from dynamic algorithms?
spam fails_task lang_mismatch pii not_appropriate hate_speech sexual_content quality toxicity humor helpfulness creativity violence