void FindPattern(string inputstring)
{
int length = inputstring.length()
int currentEnd = 1; //end position of the first substring to be searched
int currentBeg = 0; //begining position of the first substring
int Result = 0;
char* Pattern= null;
while( currentEnd < length-3) // we look
Rephrasing the question again :
Q. Find all the patterns which are present in the character array given. A
pattern is a sub-array containing 2 or more chars and is having a frequency
of more than one.
Example:
i/p: aabcdadabc
o/p: ab, abc, bc, da
basically what we have to search is those sub-
explain the question a little further please
On Tue, Feb 2, 2010 at 11:03 AM, Algoose Chase wrote:
> Hope you meant a pattern is sub-array containing 2 or more UNIQUE chars.
> hope based on dfn, "abcd" is also a pattern in the input you have given.
>
>
> On Tue, Feb 2, 2010 at 1:11 AM, ankit mah
Hope you meant a pattern is sub-array containing 2 or more UNIQUE chars.
hope based on dfn, "abcd" is also a pattern in the input you have given.
On Tue, Feb 2, 2010 at 1:11 AM, ankit mahendru wrote:
> Q. Find all the patterns once which are present in the character array
> given. A pattern is a
Q. Find all the patterns once which are present in the character array
given. A pattern is a sub-array containing 2 or more chars.
Example:
i/p: aabcdadabc
o/p: ab, abc, bc, da
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to thi
