:)
find the distance of the nearest 0 for each cell.
You have to get exactly n 'A' on the notepad by performing the minimum number of steps permitted.
Given a non-empty binary tree, find the maximum path sum.
Given preorder and inorder traversal of a tree, construct the binary tree.