摘要：
Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center). 阅读全文
摘要：
Given a binary tree, determine if it is a valid binary search tree (BST). 阅读全文
摘要：
Given a binary tree, flatten it to a linked list in-place. 阅读全文
摘要：
Given a binary tree, determine if it is height-balanced. 阅读全文
摘要：
Find the contiguous subarray within an array (containing at least one number) which has the largest sum. 阅读全文
摘要：
Given a binary tree, return the zigzag level order traversal of its nodes' values. 阅读全文
摘要：
Say you have an array for which the ith element is the price of a given stock on day i.
If you were only permitted to complete at most one transaction (ie, buy one and sell one share of the stock), design an algorithm to find the maximum profit. 阅读全文
摘要：
Given a binary tree, find the maximum path sum.The path may start and end at any node in the tree. 阅读全文
摘要：
Given a string, determine if it is a palindrome, considering only alphanumeric characters and ignoring cases. 阅读全文
摘要：
包括Phd和Post-doc, co-supervise关系David Marr(MIT)--------Shimon Ullman(Weizmann)---------Daniel Huttenlocher(Cornell)---------Demetri Terzopoulos(UCLA)--------Dimitris Metaxas(Rutgers)-------Eric Grimson(MIT)------Pedro Felzenszwalb(Uchicago)------Polina Golland(MIT)-----Xiaogang Wang(CUHK)---------Dani 阅读全文