← Back to companies
[ OK ] Loaded —
[ INFO ]
$ cd
$ ls -lt
01
02
03
04
05
$ ls -lt
01
02
03
04
05
user@intervues:~/$
Given an array of strings arr[] and two different strings start and target, find the length of the smallest chain from string start to target such that only one character of adjacent words differs and each word exists in arr[]. If no such chain exists, return 0. All words are of the same length and contain only lowercase English alphabets.