{"version":"1.0","type":"rich","title":"Dynamic Programming","description":"This example illustrates the dynamic programming concept of determining whether a target sum can be formed from a given array of integers, using two recursive approaches: a basic method and an improved memoized version. The visualization displays the result of checking whether 15 can be summed from [3,5,7] as true, alongside the memoization object that records computed subproblem outcomes. Rendered as static SVG text within a light gray frame using D3.js v5, the example highlights the efficiency gains of caching intermediate results.","provider_name":"VizHub AI Studio","provider_url":"https://vizhub.com","html":"<iframe src=\"https://vizhub.com/viz/bcdf3fbfa33e4daaa699b2fa6ad3ddc3?mode=embed\" width=\"960\" height=\"500\" scrolling=\"no\" frameborder=\"0\"></iframe>","width":960,"height":500,"cache_age":3600}