Question

Consider generating all permutations of the string "ABC" using a backtracking approach. Which of the following sequences represents a valid path in the recursion tree, leading to a complete permutation?

A A -> B -> C (ABC)
B A -> C -> B (ACB)
C B -> A -> C (BAC)
D All of the above
E None 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)