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