Question Definition
Given a collection of candidate numbers (C) and a target number (T), find all unique combinations in C where the candidate numbers sums to T.
Each number in C may only be used once in the combination.
More …
Question Definition
Given preorder and inorder traversal of a tree, construct the binary tree.
More …
Question Definition
Given inorder and postorder traversal of a tree, construct the binary tree.
More …
Question Definition
Write an efficient algorithm that searches for a value in an m x n matrix. This matrix has the following properties:
- Integers in each row are sorted from left to right.
- The first integer of each row is greater than the last integer of the previous row.
More …
Question Definition
Given a m x n matrix, if an element is 0, set its entire row and column to 0. Do it in place.
More …