Dsa
Recursion
Medium
All Anagrams of a String
Given a string, write a function to generate all possible anagram combinations of the string characters. For example:
Input:
"abc"
Output:
abc
acb
bac
bca
cab
cba
The input will be a string where characters may repeat, and the output will be the anagrams generated, each on a new line.
Key concepts
recursionstring manipulation
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