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