Given a m x n matrix, if an element is 0, set its entire row and column to 0. Do it in-place.

The set [1,2,3,…,n] contains a total of n! unique permutations.By listing and labeling all of the permutations in order, we get the following sequence for n = 3:

Suppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand.(i.e., [0,0,1,2,2,5,6] might become [2,5,6,0,0,1,2]).You are given a target value to search. If found i…

Given an array with n objects colored red, white or blue, sort them in-place so that objects of the same color are adjacent, with the colors in the order red, white and blue.Here, we will use the i…

假设两个只包含小写字母的字符串s和t，其中t是s中字母的乱序，并在某个位置上添加了一个新的字母。问添加的这个新的字母是什么？

Given a 2D board and a word, find if the word exists in the grid.

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

假设有1-n一共n个数字，从左往右开始每隔一位删除一个数字，到达最右侧后，再从右往左每隔一位删除一个数字，如此反复，直到剩下最后一个数字。问最后剩下的数字是多少。

Given a sorted linked list, delete all nodes that have duplicate numbers, leaving only distinct numbers from the original list.

Given a sorted array nums, remove the duplicates in-place such that duplicates appeared at most twice and return the new length.Do not allocate extra space for another array, you must do this by mo…