Hi ..... can anyone help me out in finding solution to the following question. Please!!
It uses sliding window algorithm. I'm trying to find solution in Java.... But solution in any programming language will be very helpful.
If anyone knows the solution, please do mail me at email@example.com
"Suppose W = cAda and the given sequence S is AbrAcadAbR then the answer is 2.
You may assume that the number of glyphs in W is at most 3000 and the number of glyphs in S is not more than 3000000.