# [LeetCode 90] Subsets II [Java]

**2018-03-24

1. Description Given a collection of integers that might contain duplicates, nums, return all possible subsets (the power set). Note: The solution ...

1. Description Given a collection of integers that might contain duplicates, nums, return all possible subsets (the power set). Note: The solution ...

1. Description The gray code is a binary numeral system where two successive values differ in only one bit. Given a non-negative integer n represen...

1. Description Given a 2D board and a word, find if the word exists in the grid. The word can be constructed from letters of sequentially adjacent ...

1. Description Given a set of distinct integers, nums, return all possible subsets (the power set). Note: The solution set must not contain duplica...

1. Description Given a collection of distinct numbers, return all possible permutations. 2. Example [1,2,3] have the following permutations: [...

1. Description Remove the minimum number of invalid parentheses in order to make the input string valid. Return all possible results. Note: The ...

1. Description There is an m by n grid with a ball. Given the start coordinate (i,j) of the ball, you can move the ball to adjacent cell or cross t...

1. Description Given a collection of candidate numbers (C) and a target number (T), find all unique combinations in C where the candidate numbers s...

1. Description Given a set of candidate numbers (C) (without duplicates) and a target number (T), find all unique combinations in C where the candi...

1. Runtime Distribution 2. Submission Details 3. Description Given an integer matrix, find the length of the longest increasing path. From each c...