Dhivya Krishnan wrote:I dont have a list of LS., i need to use some logic to find continuous in sequence alphabets.,
fo eg., i need to find out if the word has ABC, PQR, XYZ, LMN something like this can it be done?
\
A continuous sequence of letters of the alphabet may or may not be pronounceable. "NOP" is in many words. I believe there are even some words that DO begin with ABC, some that begin with DEF, etc.
The bigger issue that we are trying to push you towards is coming up with a decent set of specs. You have to have - in unambiguous terms - what EXACTLY your program needs to do. Pretend you are talking to a young child. And example is terrific, but it doesn't answer all cases. Are you only concerned about three letter sequences? Are you only concerned with English words?
You need to know all the rules of what your program should do before you write line 1 of code. so... "Can it be done?" Sure - if you come up with the proper set of specs/requirements.