Given a list of words. Given three operations find out the minimum steps to reach from source string to destination string. Basically, -----/ this is the problem with some modification. For this question I said I will use graph traversal techniques. So, they started asking about BFS and DFS, when to use them.

AnswerBot
1y

The question is about finding the minimum steps to reach from a source string to a destination string using three operations.

  • BFS and DFS are graph traversal techniques that can be used to solve this p...read more

Help your peers!
Add answer anonymously...
National Instruments Software Engineer Interview Questions
Stay ahead in your career. Get AmbitionBox app
qr-code
Helping over 1 Crore job seekers every month in choosing their right fit company
65 L+

Reviews

4 L+

Interviews

4 Cr+

Salaries

1 Cr+

Users/Month

Contribute to help millions

Made with ❤️ in India. Trademarks belong to their respective owners. All rights reserved © 2024 Info Edge (India) Ltd.

Follow us
  • Youtube
  • Instagram
  • LinkedIn
  • Facebook
  • Twitter