Hello Deepthi love ur explanation. Could you help me with this qn please,this came in my coding interview. Given an array A and length N split the array into mutually exclusive subarrays such that the product in each subarray is the same return the maximum possible partitions Example : if the array is [2,6,3] There are two ways [2,3,] and [6] so 2 should be returned I have no idea how to approach this
Hello Deepthi love ur explanation.
Could you help me with this qn please,this came in my coding interview.
Given an array A and length N split the array into mutually exclusive subarrays such that the product in each subarray is the same return the maximum possible partitions
Example : if the array is [2,6,3]
There are two ways [2,3,] and [6] so 2 should be returned I have no idea how to approach this
Lovely presentation from a lovely gal !