#递归和动态规划 · 小土刀 5.0

2016-01-10

All Permutations II

Given a collection of numbers that might contain duplicates, return all possible unique permutations.

2016-01-10

Given a collection of numbers that might contain duplicates, return all possible unique permutations.

2016-01-10

Given a collection of integers that might contain duplicates, return all possible subsets.

2016-01-10

Say you have an array for which the ith element is the price of a given stock on day i.

2016-01-10

Say you have an array for which the ith element is the price of a given stock on day i.

2016-01-10

Say you have an array for which the ith element is the price of a given stock on day i.

2016-01-10

Say you have an array for which the ith element is the price of a given stock on day i.

2016-01-10

Given a 2D board and a list of words from the dictionary, find all words in the board.

2016-01-10

Solve a boggle game(http://en.wikipedia.org/wiki/Boggle), with a dictionary given as unorderedset.

2016-01-10

A child is running up a staircase with n steps and can hop either 1 step, 2 steps, or 3 steps at a time.