← Sprinklr questions

Plant trees in space of length L (Coin Change variant)

Filed under Sprinklr

The question

Given an empty space of length L and an array W representing widths of different trees, where you have many trees of each width, find the ways to plant trees such that no empty space remains (sum of widths equals L). This is equivalent to the coin change DP problem.

No write-up yet. Related questions below have one.

Related Sprinklr questions

Collected from public candidate posts and coding forums. Updated Nov 2026.