# Coding Interview Question: Random Binary Tree

Coding Interview Question: Implement a binary tree with a method getRandomNode() that returns a random node. Click for the solution.

Coding Interview Question: Implement a binary tree with a method getRandomNode() that returns a random node. Click for the solution.

Coding Interview Question: Given a directed graph, find the shortest path between two nodes if one exists. Click for the solution.

Coding Interview Question: Given a 2D array of 1s and 0s, find the largest square subarray of all 1s. Click for the solution.

Coding Interview Question: Given k sorted arrays, merge them into a single sorted array. Click for the solution.

Coding Interview Question: Given an unsorted linked list, write a function to remove all the duplicates. Click for the solution.

Coding Interview Question: Given two nodes in a binary tree, write a function to find the lowest common ancestor. Click for the solution.

Coding Interview Question: Given a string and a dict, find the minimum number of characters to delete to make a valid word. Click for the solution.

Coding Interview Question: Given an sorted n x m array, write a function to determine whether the array contains an element x. Click for the solution.

Coding Interview Question: Given a tree, convert it into a doubly linked list from left to right by modifying the existing pointers. Click for the solution.

Coding Interview Question: Given a tree, find the length of the longest branch of nodes in increasing consecutive order. Click for the solution.