Container with Most Water 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 cont...

Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it is able to trap after raining.

Intersection of Two Linked ListsWrite a program to find the node at which the intersection of two singly linked lists begins.

Find the number connected component in the undirected graph. Each node in the graph contains a label and a list of its neighbors. (a connected component (or just component) of an undirected graph is a subgraph in which any two vertices are connected to each other by paths, and which is connected ...

题目：Clone an undirected graph. Each node in the graph contains a label and a list of its neighbors.

Given two values k1 and k2 (where k1 < k2) and a root pointer to a Binary Search Tree. Find all the keys of tree in range k1 to k2. i.e. print all x such that k1<=x<=k2 and x is a key of given BST. Return all the keys in ascending order.

原题检查两棵二叉树是否在经过若干次扭转后可以等价。扭转的定义是，交换任意节点的左右子树。等价的定义是，两棵二叉树必须为相同的结构，并且对应位置上的节点的值要相等。注意：你可以假设二叉树中不会有重复的节点值。样例

在root为根的二叉树中找A,B的LCA: 如果找到了就返回这个LCA 如果只碰到A，就返回A 如果只碰到B，就返回B 如果都没有，就返回null

Given a binary tree, find the maximum path sum. The path may start and end at any node in the tree. {代码...}

Given a sorted array, remove the duplicates in place such that each element appear only once and return the new length.