摘要：
Given a permutation which contains no repeated number, find its index in all the permutations of these numbers, which are ordered in lexicographical o 阅读全文
摘要：
Given a string, find all permutations of it without duplicates. Example Given "abb", return ["abb", "bab", "bba"]. Given "aabb", return ["aabb", "abab 阅读全文
摘要：
Given two strings, write a method to decide if one is a permutation of the other. Example abcd is a permutation of bcad, but abbe is not a permutation 阅读全文
摘要：
Given a list of integers, which denote a permutation. Find the previous permutation in ascending order. Notice The list may contains duplicate integer 阅读全文
摘要：
Given a list of integers, which denote a permutation. Find the next permutation in ascending order. Notice The list may contains duplicate integers. E 阅读全文
摘要：
Given a string s, cut s into some substrings such that every substring is a palindrome. Return the minimum cuts needed for a palindrome partitioning o 阅读全文
摘要：
Given a string s, partition s such that every substring of the partition is a palindrome. Return all possible palindrome partitioning of s. Example Gi 阅读全文
摘要：
Given a collection of candidate numbers (C) and a target number (T), find all unique combinations in C where the candidate numbers sums to T. Each num 阅读全文
摘要：
Given an array of integers, remove the duplicate numbers in it. You should:1. Do it in place in the array.2. Move the unique numbers to the front of t 阅读全文
摘要：
Given a set of candidate numbers (C) and a target number (T), find all unique combinations in C where the candidate numbers sums to T. The same repeat 阅读全文