## Unique Binary Search Trees II

QUESTION Given n, generate all structurally unique BST’s (binary search trees) that store values 1…n. This question is provided by Leetocode.

QUESTION Given n, generate all structurally unique BST’s (binary search trees) that store values 1…n. This question is provided by Leetocode.

QUESTION Given an array of integers, find two numbers such that they add up to a specific target number. The function twoSum should return indices of the two numbers such that they add up to the target, where index1 must be less than index2. Please note that your returned answers (both index1 and index2) are Read the full article…

QUESTION Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center). This question is provided by Leetocode.

QUESTION Given a 2D board containing ‘X’ and ‘O’, capture all regions surrounded by ‘X’. A region is captured by flipping all ‘O’s into ‘X’s in that surrounded region . This question is provided by Leetocode.

QUESTION Given a binary tree containing digits from 0-9 only, each root-to-leaf path could represent a number. An example is the root-to-leaf path 1->2->3 which represents the number 123. Find the total sum of all root-to-leaf numbers. This question is provided by Leetocode.

QUESTION Given a collection of integers that might contain duplicates, S, return all possible subsets. Note: Elements in a subset must be in non-descending order. The solution set must not contain duplicate subsets. This question is provided by Leetocode.

QUESTION Given a set of distinct integers, S, return all possible subsets. Note: Elements in a subset must be in non-descending order. The solution set must not contain duplicate subsets. This question is provided by Leetocode.

QUESTION Implement atoi to convert a string to an integer. Hint: Carefully consider all possible input cases. If you want a challenge, please do not see below and ask yourself what are the possible input cases. Notes: It is intended for this problem to be specified vaguely (ie, no given input specs). You are responsible Read the full article…

QUESTION Implement int sqrt(int x). Compute and return the square root of x. This question is provided by Leetocode.

- « Previous Page
- 1
- 2
- 3
- 4
- 5
- …
- 13
- Next Page »