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

🎓
Think You're Ready for RBI Grade B?
RBI Grade B 2026 Phase 1 Memory Based Paper
  • 200 Questions with Detailed Solutions
  • Section-wise Coverage (GA, English, Quant & Reasoning)