Build a Trie in Python
Problem In computer science, a trie (pronounced "try"), also called digital tree, radix tree or prefix tree, is a kind of search tree—an ordered tree »
Queue Reconstruction by Height
Problem Suppose you have a random list of people standing in a queue. Each person is described by a pair of integers (h, k), where h »
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 »
Merging Sorted Linked Lists
var jsav = new JSAV("ll"); jsav.label("Two sorted lists"); var ll1 = jsav.ds.list(); var ll2 = jsav.ds.list(); ll1.addLast("5").addLast("7").addLast( »
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 »