I need to find 5 sequence of alphabets has exists in a given string using regular expression.
Sequence which should check in any of the form like ABCDE, BCDEF, DEFGH, EFGHI,......,PQRST,...,VWZYZ.
Eg.
1) ABCDECODEPROJECT - Match (because "ABCDE" has exists in the string)
2) TESTSTRING - Not Match (because No 5 sequence of alphabets)
3) SAMPLEQRSTUEND - Match (because "QRSTU" has exists in the string)
4) WEBSITELMNOPEND - Match (because "LMNOP" has exists in the string)
5) QUESTIONANSWER - Not Match (because No 5 sequence of alphabets)
Can you help me on build regular expression to check all possible combination in alphabets?
Sequence which should check in any of the form like ABCDE, BCDEF, DEFGH, EFGHI,......,PQRST,...,VWZYZ.
Eg.
1) ABCDECODEPROJECT - Match (because "ABCDE" has exists in the string)
2) TESTSTRING - Not Match (because No 5 sequence of alphabets)
3) SAMPLEQRSTUEND - Match (because "QRSTU" has exists in the string)
4) WEBSITELMNOPEND - Match (because "LMNOP" has exists in the string)
5) QUESTIONANSWER - Not Match (because No 5 sequence of alphabets)
Can you help me on build regular expression to check all possible combination in alphabets?