Practice
Resources
Contests
Online IDE
New
Free Mock
Events New Scaler
Practice
Improve your coding skills with our resources
Contests
Compete in popular contests with top coders
Events
Attend free live masterclass hosted by top tech professionals
New
Scaler
Explore Offerings by SCALER

Problem Description

Given two words A and B, and a dictionary C, find the length of shortest transformation sequence from A to B, such that:

• You must change exactly one character in every transformation.
• Each intermediate word must exist in the dictionary.

NOTE:

• Return 0 if there is no such transformation sequence.
• All words have the same length.
• All words contain only lowercase alphabetic characters.

Problem Constraints
1 <= length(A), length(B), length(C[i]) <= 25
1 <= length(C) <= 5000

Input Format

The first argument of input contains a string, A.

The second argument of input contains a string, B.

The third argument of input contains an array of strings, C.

Output Format

Return an integer representing the minimum number of steps required to change string A to string B.

Example Input

Input 1:

``` A = "hit"
B = "cog"
C = ["hot", "dot", "dog", "lot", "log"]
```

Input 2:

``` A = "cat"
B = "bat"
C = ["rat"]
```

Input 3:

``` A = "bait"
B = "pant"
C = ["a","b"]
```

Example Output

Output 1:

` 5`

Output 2:

` 2`

Output 3:

` 0`

Example Explanation

Explanation 1:

``` "hit" -> "hot" -> "dot" -> "dog" -> "cog"
```

Explanation 2:

``` "cat" -> "bat"
```

Explanation 3:

``` No intermediate words are present in the given dictionary so transformation is not possible. We will return 0 for this case.
```

NOTE: You only need to implement the given function. Do not read input, instead use the arguments to the function. Do not print the output, instead return values as specified. Still have a question? Checkout Sample Codes for more details.
Hints
• Hint 1
• Solution Approach
• Complete Solution

## Discussion

Free Mock Assessment
Fill up the details for personalised experience.
All fields are mandatory
Current Employer *
Enter company name *
Select an option *
1993
1994
1995
1996
1997
1998
1999
2000
2001
2002
2003
2004
2005
2006
2007
2008
2009
2010
2011
2012
2013
2014
2015
2016
2017
2018
2019
2020
2021
2022
2023
2024
2025
2026
2027
2028
Phone Number *
OTP will be sent to this number for verification
+1 *
+1
Change Number
Phone Number *
OTP will be sent to this number for verification
+1 *
+1
Change Number
1993
1994
1995
1996
1997
1998
1999
2000
2001
2002
2003
2004
2005
2006
2007
2008
2009
2010
2011
2012
2013
2014
2015
2016
2017
2018
2019
2020
2021
2022
2023
2024
2025
2026
2027
2028
*Enter the expected year of graduation if you're student
Current Employer *
Company Name *