dogcatcatcodecatdog  // string2  // number of wordscat dog  // words separated by spaceOutput:[0, 13]Testcase 2:Input:barfoobazbitbyte  // string2  // number of wordscat dog  // words separated by spaceOutput:-1

Take the input string and words from the user. Find an efficient algorithm to find the smallest distance (measured in number of words) between any two given words in that string. If no such words are present in that string it should return "None".For example, given a text content of "dog cat hello cat dog dog hello cat world" and words are "hello" and "world" it should return 1 because there's only one word "cat" in between the two words.Sample Test CasesTest Case 1:Expected Output:Enter·the·text:·dog cat hello cat dog dog hello cat worldEnter·a·word·from·the·given·text:·helloEnter·another·word·from·the·given·text:·world1Test Case 2:Expected Output:Enter·the·text:·python eats another pythonEnter·a·word·from·the·given·text:·pythonEnter·another·word·from·the·given·text:·animalNone

Read a string with words separated by space and return its length and count of consonants.Sample Inputwrite a programSample Output158

Words, Vowels and ConsonantsProblemSubmissionsLeaderboardGiven a sentence containing only uppercase/lowercase english alphabets and spaces, you have to count the number of words, vowels and consonants.Input FormatFirst line of input contains T - number of test cases. Its followed by T lines, each line contains a single sentence.Constraints1 <= T <= 10001 <= len(sentence) <= 104Output FormatFor each test case, print the number of words, vowels and consonants, separated by newline.Sample Input 04HiHello World Exception Hi thereSample Output 01 1 12 3 71 4 52 3 4

find the number of alphabet vowels and words in input using string

Write a program that asks the user to input two strings: an input string and a"pattern" string. Both strings contain only lowercase alphabet, and the"pattern" string is shorter than the input string. The program finds and countsnumber of occurrences of the "pattern" string in the input string, assuming thatthe number of occurrences is less than 10. The program replaces the firstcharacter of the first appearance of the "pattern" string in the input string by '1'and the first character of the second appearance of the "pattern" string in theinput string by '2' and so on so forth. Finally, the program outputs two strings:the original input string and the modified string, a string in a line, ended withnewline.