At vero eos et accusamus et iusto odio dignissimos ducimus qui blanditiis praesentium voluptatum deleniti atque corrupti quos dolores et quas molestias excepturi sint occaecati cupiditate non provident, similique sunt in culpa qui officia deserunt mollitia animi, id est laborum et dolorum fuga. Et harum quidem rerum facilis est et expedita distinctio. Nam libero tempore, cum soluta nobis est eligendi optio cumque nihil impedit quo minus id quod maxime placeat facere possimus, omnis voluptas assumenda est, omnis dolor repellendus. Itaque earum rerum hic tenetur a sapiente delectus, ut aut reiciendis voluptatibus maiores alias consequatur aut perferendis doloribus asperiores repellat.
..............yeah I'm retard...I can't help ya here :/ Sorry
Is "APPLIECATION" meant to be APPLEICATION
No. of words common in a stretch means the longest common string. For example, "EXAMple" and " EXAMination" has a common string of length four. They don't have to start at the beginning. Or, "reSTRIct" and "STRIke" have again a common string of length four. These are easier to look for by inspection because of the short length. You need an algorithm to look for common strings of lengths in the hundreds, for example binary strings. @rvc Does that answer the question?
No please help me with program
Do you have an algorithm? If you have, please post the algorithm before working on the program.
Have you done trees?... and dynamic programming?
yes please tell me the logic to compare the strings
First thing first, do you understand the problem?
Good, if you have done trees and dynamic programming, you can start by taking a look at the algorithm suggest in the following link: https://en.wikipedia.org/wiki/Longest_common_substring_problem
okay thank you so much
You're welcome! :)