Given an index k, return the kth row of the Pascal’s triangle.
Given a binary tree, return the level order traversal of its nodes’ values. (ie, from left to right, level by level).
Given a binary tree, return the zigzag level order traversal of its nodes’ values. (ie, from left to right, then right to left for the next level and alternate ...
Given a binary tree, return the bottom-up level order traversal of its nodes’ values. (ie, from left to right, level by level from leaf to root).
Given a collection of integers that might contain duplicates, nums, return all possible subsets (the power set).
Reverse a linked list from position m to n. Do it in-place and in one-pass.
Given a binary tree, return the inorder traversal of its nodes’ values.
Given an integer n, generate all structurally unique BST’s (binary search trees) that store values 1…n.
Given s1, s2, s3, find whether s3 is formed by the interleaving of s1 and s2.
Given a set of distinct integers, nums, return all possible subsets (the power set).
