Dsa
Backtracking
Medium
Scrabble Rack Arrangements
You have a set of letters available on your Scrabble rack and a target word. Your task is to determine all possible unique arrangements of letters from your rack that can form the target word. Each letter can only be used as many times as it appears on your rack. Output all unique combinations that can be formed to match the target word.
Example:
Input:
"aabbc"
"abc"
Output:
a b c
a c b
b a c
b c a
c a b
c b a
Key concepts
backtrackingstringscombinatorics
Practise this out loud — free
Start a mock interview on THIS exact question — a voice AI interviewer opens with it, pushes back like a real onsite, then hands you an instant scorecard.
🎙 Practise this question now