← All problemsSign in

String Permutation

Given a string, your task is to generate all different strings that can be created using its characters. ###Input: - The only input line has a string of length $n$. Each character is between a–z. ###Output: - First print an integer $k$: the number of strings. Then print $k$ lines: the strings in alphabetical order. ###Constraints - $1 \leq n \leq 8$ ###Sample Input: abc ##

HINT LADDERno hints yet
L1 Observation
L2 Technique
L3 Approach
L4 Pseudo-code
🔒
L5 Full solution
L5 unlocks only if you insist twice
solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI

Sign in to chat with the tutor and save your progress.

Sign in to start