- 1.2) Subsets
Given a set of distinct integers nums, return all possible subsets (the power set) of the set.
- 1.3) Return all possible Permutations
Given a collection of distinct integers, nums, return all possible permutations of the integers.
- 1.4) Letter Combinations of a Phone Number
Given a string containing digits from 2 to 9 inclusive, return all possible letter combinations that the number could represent on a telephone keypad. The mapping of digits to letters is the same as that commonly found in a telephone keypad (e.g., 2 is associated with ‘abc’, 3 is associated with ‘def’, etc.).
- 1.5) Palindrome Partitioning of String
Given a string s, partition s such that every substring of the partition is a palindrome. Return all possible palindrome partitioning of s.
- 1.6) Find Combination Sum to Target
Given an array of distinct integers candidates and a target integer target, return all possible combinations of candidates where the chosen numbers sum to target. You may use the same number multiple times. The combinations should be returned in any order.