Computer Science, asked by shahbazmfp786, 9 months ago

you are given towards big in word and inward and an input list of word l you have to find it if the n word can be created from the begin word if you are allowed only the below operations first operation is you can only change small letter in the current word referred to as a hop second operation is the new world created from the above operation must be present in the input list of the word if from the given input we can find multiple search hop sequences output the minimum number of hop required to reach the end word starting from the big in word input format in word in word number of words in input list of word l each word of l as a new list input​

Answers

Answered by maurya666yash
1

Answer:

you are given two words begin word and in word and an input list of words l will have to find if the n word can be created from the big in word if you are allowed only the below operations you can only change one letter in the current word referred to as hope the new word created from the operation must be present in the input list words

Similar questions