Given a positive 32-bit integer n, you need to find the smallest 32-bit integer which has exactly the same digits existing in the integer n and is greater in value than n. If no such positive 32-bit integer exists, you need to return -1.. Easy #39 Combination Sum. The index begins at 1. Single Number. Medium #37 Sudoku Solver. This Problem is similar to String Permutation in LintCode /** * Approach 1: Using Sorting -- (TLE) * Algorithm * The idea behind this approach is that one string will be a permutation of another string * only if both of them contain the same characters the same number of times. Medium #37 Sudoku Solver. Here are some examples. Backtracking 类型的题目，类似的题目还有Subsets, Permutations, Combination Sum, Palindrome Partioning ... Algorithm. Graph. The replacement must be in-place and use only constant extra memory.. Easy #39 Combination Sum. The index begins at 1. Given the permutation [1, 4, 2, 2], return 3. #31 Next Permutation. lintcode. Medium #40 Combination Sum II. Example. Array. Given a permutation which may contain repeated numbers, find its index in all the permutations of these numbers, which are ordered in lexicographical order. Example; Note; 题解. Hard #38 Count and Say. LinkedIn. * @return: All the combinations of k numbers out of 1..n. public List < List < Integer > > combine (int n, int k). Medium. Python; Question. Hard #38 Count and Say. Given a list of numbers with duplicate number in it. Medium #32 Longest Valid Parentheses. Hard #33 Search in Rotated Sorted Array. Find all unique permutations. Medium #34 Find First and Last Position of Element in Sorted Array. Medium #32 Longest Valid Parentheses. EPI. Next Permutation. Problem Statement. Easy #36 Valid Sudoku. 题解 Given a permutation which may contain repeated numbers, find its index in all the permutations of these numbers, which are ordered in lexicographical order. Easy #36 Valid Sudoku. Medium #35 Search Insert Position. 【题目描述】 Given a list of integers, which denote a permutation.Find the previous permutation in ascending order.Notice:The list may contains duplicate integers.给定一个整数数组来表示排列，找出其… Implement next permutation, which rearranges numbers into the lexicographically next greater permutation of numbers.. If such arrangement is not possible, it must rearrange it as the lowest possible order (ie, sorted in ascending order). Solution Hard #33 Search in Rotated Sorted Array. Medium #40 Combination Sum II. Medium #35 Search Insert Position. Permutation Index II 198 Question. Example. Medium. Flatten Binary Tree to Linked List. House robber II. Given the permutation [1, 4, 2, 2], return 3. #31 Next Permutation. Problems coming from LeetCode, LintCode, TopCoder, CtCi, etc. // write your code here Question. Disclaimer: Under construction. Example 1: Medium #34 Find First and Last Position of Element in Sorted Array. lintcode: (198) Permutation Index II; Problem Statement.