gfg-potd July 4,2023

[aneesh1024]

Is this approach based on sliding window algorithm ?

[getlost01]

First of all, thank you for reaching me.

Yes, this is the dynamic sliding approach, in which our end pointer j iterates and increases by 1 in each iteration and we check that the element product within the starting and ending pointer of our subarray (a kind window) is lesser than k or not. If we encounter a condition where the current product of subarray becomes greater than k. Then we reduce the size of the subarray (a kind window), by increasing starting pointer value.

For more clearance, please refer to the example from the readme file.

[aneesh1024]

Oh, now I get it ,thanks for taking the time to explain me.