Given an array, rotate the array to the right by  k  steps, where k is non-negative.
【LeetCode】0140. Word Break II
Given a  non-empty  string  s  and a dictionary  wordDict  containing a list of  non-empty words, add spaces in  s  to construct a sentence where each word is a valid dictionary word. Return all such possible sentences.
【LeetCode】0139. Word Break
Given a  non-empty  string  s  and a dictionary  wordDict  containing a list of  non-emptywords, determine if  s  can be segmented into a space-separated sequence of one or more dictionary words.
【LeetCode】0032. Longest Valid Parentheses
Given a string containing just the characters  '('  and  ')', find the length of the longest valid (well-formed) parentheses substring.
【LeetCode】0044. Wildcard Matching
Given an input string (s) and a pattern (p), implement wildcard pattern matching with support for  '?'  and  '*'.
1  |  | 
The matching should cover the entire input string (not partial).
Note:
scould be empty and contains only lowercase lettersa-z.pcould be empty and contains only lowercase lettersa-z, and characters like?or*.
【LeetCode】0020. Valid Parentheses
Given a string containing just the characters  '(',  ')',  '{',  '}',  '['  and  ']', determine if the input string is valid.
【LeetCode】0002. Add Two Numbers
You are given two non-empty linked lists representing two non-negative integers. The digits are stored in reverse order and each of their nodes contain a single digit. Add the two numbers and return it as a linked list.
【LeetCode】0175. Combine Two Tables
Write a SQL query for a report that provides the following information for each person in the Person table, regardless if there is an address for each of those people:
FirstName, LastName, City, State
【LeetCode】0010. Regular Expression Matching
Given an input string (s) and a pattern (p), implement regular expression matching with support for  '.'  and  '*'.
1  |  | 
The matching should cover the entire input string (not partial).
Note:
scould be empty and contains only lowercase lettersa-z.pcould be empty and contains only lowercase lettersa-z, and characters like.or*.
【LeetCode】0006. ZigZag Conversion
The string  "PAYPALISHIRING"  is written in a zigzag pattern on a given number of rows like this: (you may want to display this pattern in a fixed font for better legibility)
1  |  | 
And then read line by line:  "PAHNAPLSIIGYIR"