A list of words is given as input, create a program which will find all the common substrings in those words as well the longest common substring of them. The common should not be repeated in the results and should be printed in the alphabetical order The input words can be in upper or lower cases. But the common substring search should not be case sensitive. That is Good and good are considered same. Note: The substrings which have a length greater than or equal to three only needs to print as output. If there is only one common substring available which is of length greater than or equals to three, then the program should print only the Longest Common Substring. If there are more than one common substring available, then the Largest Common Substring will be printed at first. Then will print the Common Substrings in next line. Also, the Largest Common Substring should be printed separately and not to be included in the Common Substrings list. If there are no common substrings available which is having length greater than three, then the output sould be printed as "NO COMMON STRINGS example, t: good goodness goods there are two common substrings of length greater than or equals to three are goo and good. Out good is the Largest Common Substring and goo is the common substring.
Answers
Answered by
0
Answer:
It is because the bottom part is kept on fire which gives it a black colour.
The inner part also becomes black
sometime.
The outer part if cleaned thoroughly it won't be much black.
Answered by
0
Answer:
Answer:
It is because the bottom part is kept on fire which gives it a black colour.
The inner part also becomes black
sometime.
The outer part if cleaned thoroughly it won't be much black.
Similar questions