Question

From the following algorithm design techniques which one is used to find all the pairs of shortest distances in a graph?

A Backtracking
B Greedy
C Dynamic programming
D Divide
E Any of the above
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)