← All problemsSign in

Power Set

Given a string, we have to generate the power set of the given string in lexicographic order. Power set means set of all the subsets. Repetition of subsets is not allowed!. ### Input A string of length l without any duplicate elements. ### Output subsets of the string separated by space in lexicographic order. ### Constraints - $1 \leq l \leq 50$ ### Subtasks - 30 points : $1 \leq R \leq 10000

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