How will you find the subarray whose product is k in an array of negative and positive numbers
efficient algorithm is to be considered, it will be better if time complexity is O(n) -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
