Vidyalelo
Data Structure · Q21

Dynamic Programming in Data Structures

Programming · Data Structure · question 21

Q21

Which problem-solving technique is particularly effective for problems with optimal substructure?

A.
Depth-First Search
B.
Divide and Conquer
C.
Greedy Algorithms
D.
Dynamic Programming
Answer

Answer: Option D

Solution

Answer: Option D
No explanation is given for this question Let's Discuss on Board