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