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