Does anyone know a leetcode problem similar to this?\n\nSeems to be a dfs/backtracking problem. Can we somehow use DP because we dont need to return all possible sets, but just the total count of unique racks? Not sure how I\'d approach it\n\n```\nCount all possible scrabble racks, where 7 tiles are drawn from a bag containing a certain distribution of tiles. A tile can be (A-Z or blank)\nEg: 5As, 3Bs, 0Cs.....\nAAAAABB\nAAAABBB\n\nCount- 2\n\n\n\n```

Does anyone know a leetcode problem similar to this?\n\nSeems to be a dfs/backtracking problem. Can we somehow use DP because we dont need to return all possibl