- Given a string, determine if it has a permutation which is a palindrome. - Given an integer array arr and int k, determine how many subsets of arr s.t the sum of its' max and its' min is k at most. - Given a string consists only of parentheses, determine whether it is balanced or not. - Given a permutation, find the next permutation in the sequence. - Given a string, determine whether it is almost palindrome (i.e omitting one character results in a palindrome). - Given an iterable, return its' power set.
