Algorithm Interview Problems
Welcome This page contains solutions to common interview problems that may be encountered. Arrays Longest Substring Without Repeating Characters Rotate a 2D Matrix Buy/Sell Two »
Build a Binary Tree with Pre-order and In-order traversal data
Problem Given a pre-order traversal array of integers and an in-order traversal array of integers, construct a binary tree. Input preorder - array of integers inorder »
Validate a BST
Problem With a binary tree as input, determine if the tree is a BST or not Input node: Has 3 properties .val: Integer value of the »
Iterative In-Order Traversal
Problem Return the values of a binary tree using in-order traversal, iteratively. Input node: Has 3 properties .val: Integer value of the node .left: A pointer »
Symmetry in a Tree
var jsav = new JSAV("av-sym"); jsav.label("Symmetric tree"); var bt = jsav.ds.binarytree(); bt.root("5"); // set the value of the root bt.root().left( »