Topic: Array Problem / Level: intermediate

Problem: Find the smallest subarray where the product of elements is divisible by both their digit cubes and their index sum using dynamic programming.

Run the code to see the output here...