1329. Power Set Using Bitmask

Given a string s, generate all distinct non-empty subsequences of s using bitmask enumeration, and return them sorted in lexicographic order. A subsequence keeps the original relative order of the chosen characters. Duplicate subsequences (possible when s has repeated characters) appear only once.

Input: A JSON object {"s": <string of lowercase letters>}.

Output: Return the sorted list of distinct non-empty subsequences.

Examples

Input: {"s":"ab"}
Output: ["a","ab","b"]
Explanation: Subsequences a, b, ab sorted lexicographically.

Input: {"s":"aa"}
Output: ["a","aa"]
Explanation: Duplicates collapse to a and aa.

Constraints

• 1 <= len(s) <= 16
• s consists of lowercase English letters

Asked by