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