#Problem description:

Given inorder and postorder traversal of a tree, construct the binary tree.

Note:
You may assume that duplicates do not exist in the tree.

Problem description:

/
Given a list of non-negative numbers and a target integer k, write a function to check if the array has a continuous subarray of size at least 2 that sums up to the multiple of k, that is, sums up to nk where n is also an integer.

Problem description:

Given an array with n objects colored red, white or blue, sort them in-place so that objects of the same color are adjacent, with the colors in the order red, white and blue.

#Problem description:

Given a non-negative index k where k ≤ 33, return the kth index row of the Pascal’s triangle.

Note that the row index starts from 0.

Problem description:

We have two special characters. The first character can be represented by one bit 0. The second character can be represented by two bits (10 or 11).

Problem description:

Given a binary tree, find the lowest common ancestor (LCA) of two given nodes in the tree.

Problem description:

Given an integer array with no duplicates. A maximum tree building on this array is defined as follow:

Problem description:

Given two words (beginWord and endWord), and a dictionary’s word list, find the length of shortest transformation sequence from beginWord to endWord, such that:

Problem description:

Given a 2d grid map of ‘1’s (land) and ‘0’s (water), count the number of islands. An island is surrounded by water and is formed by connecting adjacent lands horizontally or vertically. You may assume all four edges of the grid are all surrounded by water.

Problem description:

Given a binary tree, return the level order traversal of its nodes’ values. (ie, from left to right, level by level).