@ Rahul patil ofcourse array may have negative or positive integers
@ Kishen both O(n) and O(n logn) solutions was asked in this yahoo coding
round question
On Tue, Oct 19, 2010 at 1:28 PM, Abhishek Kumar Singh <
iiita2007...@gmail.com> wrote:
> Given an array of length N. How will you find t
@ Minotauraus
*
*
*but here we are not going to find maximum product subarray, we are finding
here the subarray whose product is k.
*
correct me if i am wrong
On Thu, Sep 30, 2010 at 9:35 PM, Minotauraus wrote:
> I guess you could use Kadane's algo replacing addition with
> multiplication.
> htt
