摘要：
You are given a string, S, and a list of words, L, that are all of the same length. Find all starting indices of substring(s) in S that is a concatenation of each word in L exactly once and without any intervening characters. 阅读全文
摘要：
Implement strStr(). 阅读全文
摘要：
Divide two integers without using multiplication, division and mod operator. 阅读全文
摘要：
Given a sorted array, remove the duplicates in place such that each element appear only once and return the new length. 阅读全文
摘要：
Given an array and a value, remove all instances of that value in place and return the new length. 阅读全文
摘要：
Given a linked list, reverse the nodes of a linked list k at a time and return its modified list. 阅读全文
摘要：
Given a linked list, swap every two adjacent nodes and return its head. 阅读全文
摘要：
Merge k sorted linked lists and return it as one sorted list. Analyze and describe its complexity. 阅读全文
摘要：
Given n pairs of parentheses, write a function to generate all combinations of well-formed parentheses. 阅读全文
摘要：
Given a string containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input string is valid. 阅读全文