题目描述：

Given a linked list, remove the n-th node from the end of list and return its head.

题目描述：

Given a string containing digits from 2-9 inclusive, return all possible letter combinations that the number could represent.

A mapping of digit to letters (just like on the telephone buttons) is given below. Note that 1 does not map to any letters.

题目描述：

Given an array nums of n integers, are there elements a, b, c in nums such that a + b + c = 0? Find all unique triplets in the array which gives the sum of zero.

note:

The solution set must not contain duplicate triplets.

题目描述：

Given n non-negative integers a1, a2, …, an , where each represents a point at coordinate (i, ai). n vertical lines are drawn such that the two endpoints of line i is at (i, ai) and (i, 0). Find two lines, which together with x-axis forms a container, such that the container contains the most water.

Note: You may not slant the container and n is at least 2.

The above vertical lines are represented by array [1,8,6,2,5,4,8,3,7]. In this case, the max area of water (blue section) the container can contain is 49.

蚊子昨天参与了同程艺龙的笔试，投的是 Java 岗，然后有四种题型：判断题、单选题、填空题、编程题，因为除了编程题之外，其他的题型题目都太多了，蚊子记不住，所以就在这里记录一下编程题。

上周参加了牛客网的模拟笔试（三月场），后面因为有事情就没有做编程题目，想来挺后悔的。然后编程题的题解是牛客网提供的题解~目前还没有开放做题权限，所以蚊子也不能补题，嘤~

题目描述：

Given an input string (s) and a pattern (p), implement regular expression matching with support for '.'and '*'.

1
2

'.' Matches any single character.
'*' Matches zero or more of the preceding element.

The matching should cover the entire input string (not partial).

就面试总问到 HashMap，蚊子就总说的一知半解，就研究了一下（其实也没有面几家，基本都简历杀了，呜呜呜呜呜~）

~<待完成>~

题目描述：

Given a string s, find the longest palindromic substring in s. You may assume that the maximum length of s is 1000.

题目描述：

There are two sorted arrays nums1 and nums2 of size m and n respectively.

Find the median of the two sorted arrays. The overall run time complexity should be O(log (m+n)).

You may assume nums1 and nums2 cannot be both empty.