{"version":"1.0","type":"rich","title":"Dynamic Programming - How to get target sum","description":"This visualization demonstrates the dynamic programming approach to solving the \"howSum\" problem, where the goal is to find a combination of numbers from a given array that adds up to a target sum. The code implements a tabular dynamic programming algorithm that iteratively constructs a table of possible sums, showing how each state can be reached from previous states. Using D3.js version 5, the visualization displays the algorithm's process on an SVG canvas with a light gray background. The example also includes a recursive implementation of the same problem, though the tabular approach is the primary focus, with the data derived from the algorithm's internal logic rather than an external dataset.","provider_name":"VizHub AI Studio","provider_url":"https://vizhub.com","html":"<iframe src=\"https://vizhub.com/viz/dc75250da03440ffae44465b6847acbe?mode=embed\" width=\"960\" height=\"500\" scrolling=\"no\" frameborder=\"0\"></iframe>","width":960,"height":500,"cache_age":3600}