i wanna get a clear picture of this before start. when you say min length of contiguous sub of an array
let's say array A=[3,1,2,3,4,5], N=6 are below both good solutions? A[0] to A[m] where m<=N A[i] to A[m] where i<=m m<=N On Oct 19, 3:58 am, Abhishek Kumar Singh <iiita2007...@gmail.com> wrote: > Given an array of length N. How will you find the minimum length > contiguous sub - array of whose sum is S and whose product is P . Here > S and P will be given to you. -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algoge...@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
