Binary Search Tree Iterator

Problem Statement

Implement an iterator over a binary search tree (BST). Your iterator will be initialized with the root node of a BST.

Calling next() will return the next smallest number in the BST.

Clone Graph

Problem Statement

Clone an undirected graph. Each node in the graph contains a label and a list of its neighbors.

OJ’s undirected graph serialization:Nodes are labeled uniquely.We use # as a separator for each node, and , as a separator for…

Distance between 2 nodes in a BST

Problem Statement

In a Binary Search Tree containing unique integers, find the distance between 2 nodes given access to those 2 nodes and the root of the BST. The distance between 2 nodes P and Q is the number of edges on the…

Kth Largest Element in an Array

Problem Statement

Find the kth largest element in an unsorted array. Note that it is the kth largest element in the sorted order, not the kth distinct element.

Lowest Common Ancestor of a Binary Search Tree

Problem Statement

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

Binary Tree Paths

Problem Statement

Given a binary tree, return all root-to-leaf paths.

For example, given the following binary tree:

1
 /   \
2     3
 \
  5

Apache Zookeeper Ensemble on Local Machine

Setting up a Zookeeper Ensemble

The instructions are for simulating the set up of ensemble on a single machine. However with just the change in port numbers we can set it up on different machines in production.

Two Sum

Problem Statement

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…