You’re given an array of strings. Now you can pick any word from the array and start forming a chain of words. You can delete one character from the string provided the new string should also exist in the array. Then you can perform the same deletion operation on the new string and continue unless and until you find a string from where no deletion can be performed. Find out the maximum length of the word chain that can be formed in the array.