Question

Which of the following properties must a problem exhibit to be solvable by a greedy algorithm?

A Overlapping subproblems and optimal substructure.
B Greedy choice property and optimal substructure.
C No backtracking and exponential time complexity.
D Memoization and tabulation.
E Divide and conquer and recursion.
Practice Next

Hey! Ask a query