← Greedy Algorithms Quiz: all 8 questions
Greedy Algorithms Quiz · Question 8 of 8
Which problems are typically solved greedily? (select all that apply)
Which problems are typically solved greedily? (select all that apply)
- A.Non-overlapping intervals
- B.Assign cookies
- C.Coin change with arbitrary coins
- D.Longest common subsequence
Answer & explanation
Correct answer: Non-overlapping intervals · Assign cookies
Arbitrary coin change and LCS need dynamic programming.
Can you get the rest right without peeking?
Take the timed Greedy Algorithms Quiz quiz free. Pass it to earn XP and count towards your certificate.
Start the quiz →