sir, we have to find total no. of contiguous subsequence in an optimal way from array of integers such that their product is equal to p^2-q^2 , where p and q are any integers. for eg, a[]=2, 5, 6…ans=2(5 and 2 5 6)
Q. regarding subsequence
@aman17nov1999 This is the question of ongoing contest https://www.codechef.com/APRIL20A/problems/SQRDSUB, so I can’t really answer it right now, but I will once the contest ends.
I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.
On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.